New Simple Trigonometric Algorithms for Solving Optimization Problems

Baskar A

doi:10.6180/jase.202212_25(6).0020

New Simple Trigonometric Algorithms for Solving Optimization Problems

Mathematics / Statistics

Baskar A This email address is being protected from spambots. You need JavaScript enabled to view it.¹

¹Panimalar Institute of Technology, Poonamallee, Tamil Nadu 600123, India

Received: December 11, 2022
Accepted: February 2, 2022
Publication Date: March 1, 2022

Copyright The Author(s). This is an open access article distributed under the terms of the Creative Commons Attribution License (CC BY 4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are cited.

Download Citation: ||https://doi.org/10.6180/jase.202212_25(6).0020

ABSTRACT

Heuristics play a key role in solving optimization problems with complex functions. They are popular as efficient heuristics are capable of providing results quickly with acceptable solution quality. Population-based heuristics are stochastic and hence, several iterations and trials are needed to achieve the expected accuracy and convergence to the global optimum. This article proposes two new, simple; population-based trigonometric algorithms, Sine (AB) and Cosine (AB). The algorithms are validated using forty well-known benchmark test functions available in the literature. The results are compared with a similar popular Sine Cosine Algorithm and the computational results show that the performance of Sine (AB) and Cosine (AB) are better than Sine Cosine Algorithm. Wilcoxon Signed-Rank and Friedman tests are carried out for statistical analyses. In addition to unconstrained functions, three real-world, constrained problems are solved to have a more intensive analysis of the proposed algorithms.

Keywords: Optimization, Population-based heuristic, Un-constrained optimization, Sine Cosine Algorithm, Trigonometric Algorithm

REFERENCES

[1] Website. https://nptel.ac.in/content/storage2/courses/105108127/pdf/Module_1.
[2] E. Burke, M. Gendreau, M. Hyde, G. Kendall, G. Ochoa, E. Özcan, and R. Qu, (2013) “Hyper-heuristics: A survey of the state of the art" Journal of the Operational Research Society 64(12): 1695–1724. DOI: 10.1057/jors.2013.71.
[3] V. Kumar, J. Chhabra, and D. Kumar, (2014) “Parameter adaptive harmony search algorithm for unimodal and multimodal optimization problems" Journal of Computational Science 5(2): 144–155. DOI: 10.1016/j.jocs.2013.12.001.
[4] L. Abualigah and A. Diabat, (2021) “Advances in Sine Cosine Algorithm: A comprehensive survey" Artificial Intelligence Review 54(4): 2567–2608. DOI: 10.1007/s10462-020-09909-3.
[5] S. Droste, T. Jansen, and I. Wegener, (2006) “Upper and lower bounds for randomized search heuristics in black-box optimization" Theory of Computing Systems 39(4): 525–544. DOI: 10.1007/s00224-004-1177-z.
[6] P. K. Pal, K. Deep, and A. K. Nagar. “Performance of Sine–Cosine Algorithm on Large-Scale Optimization Problems”. In: Decision science in action. Springer, 2019, 139–154.
[7] R. Venkata Rao, (2016) “Jaya: A simple and new optimization algorithm for solving constrained and unconstrained optimization problems" International Journal of Industrial Engineering Computations 7(1): 19–34. DOI: 10.5267/j.ijiec.2015.8.004.
[8] R. Zitar, M. Al-Betar, M. Awadallah, I. Doush, and K. Assaleh, (2021) “An Intensive and Comprehensive Overview of JAYA Algorithm, its Versions and Applications" Archives of Computational Methods in Engineering: DOI: 10.1007/s11831-021-09585-8.
[9] S. Mirjalili, (2016) “SCA: A Sine Cosine Algorithm for solving optimization problems" Knowledge-Based Systems 96: 120–133. DOI: 10.1016/j.knosys.2015.12.022.
[10] R. Kommadath, J. Dondeti, and P. Kotecha. “Benchmarking JAYA and sine cosine algorithm on real parameter bound constrained single objective optimization problems (CEC2016)”. In: Part F127854. cited By 6. 2017, 31–34. DOI: 10.1145/3059336.3059363.
[11] S. Mirjalili and A. Lewis, (2016) “The Whale Optimization Algorithm" Advances in Engineering Software 95: 51–67. DOI: 10.1016/j.advengsoft.2016.01.008.
[12] A. Hussien, A. Hassanien, E. Houssein, M. Amin, and A. Azar, (2020) “New binary whale optimization algorithm for discrete optimization problems" Engineering Optimization 52(6): 945–959. DOI: 10.1080/0305215X.2019.1624740.
[13] E. Atashpaz-Gargari and C. Lucas. “Imperialist competitive algorithm: An algorithm for optimization inspired by imperialistic competition”. In: cited By 1792. 2007, 4661–4667. DOI: 10.1109/CEC.2007.4425083.
[14] R. Rao, V. Savsani, and D. Vakharia, (2011) “Teachinglearning- based optimization: A novel method for constrained mechanical design optimization problems" CAD Computer Aided Design 43(3): 303–315. DOI: 10.1016/j.cad.2010.12.015.
[15] L. Abualigah, A. Diabat, S. Mirjalili, M. Abd Elaziz, and A. Gandomi, (2021) “The Arithmetic Optimization Algorithm" Computer Methods in Applied Mechanics and Engineering 376: DOI: 10.1016/j.cma.2020.113609.
[16] F. Hashim, K. Hussain, E. Houssein, M. Mabrouk, and W. Al-Atabany, (2021) “Archimedes optimization algorithm: a new metaheuristic algorithm for solving optimization problems" Applied Intelligence 51(3): 1531–1551. DOI: 10.1007/s10489-020-01893-z.
[17] J. Agushaka and A. Ezugwu, (2021) “Advanced arithmetic optimization algorithm for solving mechanical engineering design problems" PLoS ONE 16(8 August): DOI: 10.1371/journal.pone.0255703.
[18] Z. Zhang, C. Huang, H. Huang, S. Tang, and K. Dong, (2018) “An optimization method: Hummingbirds optimization algorithm" Journal of Systems Engineering and Electronics 29(2): 386–404. DOI: 10.21629/JSEE.2018.02.19.
[19] W. Zhao, L.Wang, and S. Mirjalili, (2022) “Artificial hummingbird algorithm: A new bio-inspired optimizer with its engineering applications" Computer Methods in Applied Mechanics and Engineering 388: DOI: 10.1016/j.cma.2021.114194.
[20] D. Wolpert and W. Macready, (1997) “No free lunch theorems for optimization" IEEE Transactions on Evolutionary Computation 1(1): 67–82. DOI: 10.1109/4235.585893.
[21] D. Bertsekas. Nonlinear Programming. 3rd ed. Athena Scientific, 2016.
[22] A. Gabis, Y. Meraihi, S. Mirjalili, and A. Ramdane-Cherif, (2021) “A comprehensive survey of sine cosine algorithm: variants and applications" Artificial Intelligence Review 54(7): 5469–5540. DOI: 10.1007/s10462-021-10026-y.
[23] Virtual Library of Simulation Experiments: Test Functions and Datasets. Website. https://www.sfu.ca/~ssurjano/optimization.html. 2013.
[24] Website. https://seyedalimirjalili.com/sca..
[25] R. Eberhart and J. Kennedy. “New optimizer using particle swarm theory”. In: cited By 12748. 1995, 39–43.
[26] X.-S. Yang, (2010) “Firefly algorithm, stochastic test functions and design optimization" International Journal of Bio-Inspired Computation 2(2): 78–84. DOI: 10.1504/IJBIC.2010.032124.
[27] G. Farr, (2015) “Cost-effectiveness of algorithms" Discrete Mathematics & Theoretical Computer Science 17:
[28] V. Beiranvand, W. Hare, and Y. Lucet, (2017) “Best practices for comparing optimization algorithms" Optimization and Engineering 18(4): 815–848. DOI: 10.1007/s11081-017-9366-1.
[29] A. Sadollah, A. Bahreininejad, H. Eskandar, and M. Hamdi, (2013) “Mine blast algorithm: A new population based algorithm for solving constrained engineering optimization problems" Applied Soft Computing Journal 13(5): 2592–2612. DOI: 10.1016/j.asoc.2012.11.026.
[30] B. Kannan and S. Kramer, (1994) “An augmented lagrange multiplier based method for mixed integer discrete continuous optimization and its applications to mechanical design" Journal of Mechanical Design, Transactions of the ASME 116(2): 405–411. DOI: 10.1115/1.2919393.
[31] C. Coello Coello, (2000) “Use of a self-adaptive penalty approach for engineering optimization problems" Computers in Industry 41(2): 113–127. DOI: 10.1016/S0166-3615(99)00046-9.