{"id":5387,"date":"2026-05-03T12:38:07","date_gmt":"2026-05-03T04:38:07","guid":{"rendered":"\/jase\/?post_type=tkuisotope&p=5387"},"modified":"2026-07-01T12:30:10","modified_gmt":"2026-07-01T04:30:10","slug":"new-simple-trigonometric-algorithms-for-solving-optimization-problems","status":"publish","type":"tkuisotope","link":"\/jase\/?tkuisotope=new-simple-trigonometric-algorithms-for-solving-optimization-problems","title":{"rendered":"New Simple Trigonometric Algorithms for Solving Optimization Problems"},"content":{"rendered":"\n
\n
\n

<\/i> 2022<\/a><\/p>\n<\/div>\n\n\n\n

\n

<\/i> Volume 25, Issue 6<\/a><\/p>\n<\/div>\n\n\n\n

\n
\n
\n
\n

Baskar A1<\/sup><\/i><\/a><\/p>\n\n\n\n

1<\/sup>Panimalar Institute of Technology, Poonamallee, Tamil Nadu 600123, India<\/p>\n<\/div>\n\n\n\n

\n

Received:\u00a0December 11, 2021
Accepted:\u00a0February 02, 2022
Publication Date:\u00a0May 03, 2026<\/p>\n<\/div>\n<\/div>\n\n\n\n

\"\u4e0a\u50b3\u5716\u7247\"\n\n\n

Values of Sine (2\u2217<\/sup>pi\u2217<\/sup>rand)) and Cosine (2\u2217<\/sup>pi\u2217<\/sup>rand))<\/p>\n<\/div>\n<\/div>\n\n\n\n

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

Download Citation:  BibTeX <\/a>| http:\/\/dx.doi.org\/10.6180\/jase.202212_25(6).0020<\/a>  <\/p>\n\n\n\n

Download PDF<\/a><\/p>\n\n\n\n

<\/div>\n\n\n\n

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.<\/p>\n\n\n\n

Keywords:\u00a0Optimization, Population-based heuristic, Un-constrained optimization, Sine Cosine Algorithm, Trigonometric Algorithm<\/em><\/p>\n\n\n\n

<\/div>\n\n\n\n
\n
    \n
  1. [1] Website. https:\/\/nptel.ac.in\/content\/storage2\/<\/a> courses\/105108127\/pdf\/Module_1.<\/li>\n
  2. [2] E. Burke, M. Gendreau, M. Hyde, G. Kendall, G. Ochoa, E. \u00d6zcan, and R. Qu, (2013) \u201cHyper-heuristics: A survey of the state of the art” Journal of the Operational Research Society 64(12): 1695\u20131724. DOI: 10.1057\/jors.2013.71.<\/span><\/li>\n
  3. [3] V. Kumar, J. Chhabra, and D. Kumar, (2014) \u201cParameter adapti<\/span>ve harmony search algor<\/span>ithm for unimodal and multimodal optimization problems” Journal of Computational Science 5(2): 144\u2013155. DOI: 10.1016\/j.jocs. 2013.12.001.<\/span><\/li>\n
  4. [4] L. Abualigah<\/span> and A. Diabat, (2021) \u201cAdvances in Sine Cosine Algorithm: A comprehe<\/span>nsive survey” Artificial Intelligence Review 54(4): 2567\u20132608. DOI: 10.1007\/ s10462-020-09909-3.<\/span><\/li>\n
  5. [5] S. Droste, T. Jansen, and I. Wegener, (2006<\/span>) \u201cUpper and lower bounds for randomized <\/span>search heuristics in black-box optimization” Theory of Computing Systems 39(4): 525\u2013544. DOI: 10.1007\/s00224-004-1177z.<\/span><\/li>\n
  6. [6] P. K. Pal<\/span>, K. Deep, and A. K. Nagar. \u201cPerformance of Sine\u2013Cosine Algorithm on Large<\/span>-Scale Optimization Problems\u201d. In: Decision science in action. Springer, 2019, 139\u2013154.<\/span><\/li>\n
  7. [7] R. Venkata Rao, (2016) \u201cJaya: A simple and new optimization algorithm for solvi<\/span>ng constrained and unconstrained optimization problems” International Journal of Industrial Engineering Computations 7(1): 19\u201334. DOI: 10.5267\/j.ijiec.2015.8.004.<\/span><\/li>\n
  8. [8] R. Zitar, M. Al-Betar, M. Awadallah, I. Doush, and K. Assaleh, (2021) \u201cAn Intensive and C<\/span>omprehensive Overview of JAYA Algorithm, its Versions and Applications” Archives of Computationa<\/span>l Methods in Enginee<\/span>ring: DOI: 10.1007\/s11831-021-09585-8.<\/span><\/li>\n
  9. [9] <\/span>S. Mirjalili, (2016) \u201cSCA: A Sine Cosine Algorithm for solving optimization problems<\/span>” Knowledge-Based Systems 96: 120\u20131<\/span>33. DOI: 10.1016\/j.knosys.2015.12.022.<\/span><\/li>\n
  10. [10] R. Kommadath, J. Dondeti, and P. Kotecha. \u201cBenchmarking JAYA and sine cosine al<\/span>gor<\/span>ithm on real parameter bound constrained single objective optimization problems (CEC2016)\u201d. In: Part F127854. ci<\/span>ted By<\/span> 6. 2017, 31\u201334. DOI: 10.1145\/3059336.3059363.<\/span><\/li>\n
  11. [11] S. Mirjalili and A. Lewis, (2016) \u201cThe Whale Optimization Algo<\/span>rithm” Advances <\/span>in Engineering Software 95: 51\u201367. DOI: 10.1016\/j.advengsoft.2016.01.008.<\/span><\/li>\n
  12. [12] A. Hussien, A. Hassanien, E. Houssein, M. Amin, and A. Azar, (2020) <\/span>\u201cNew binary whale<\/span> optimization algorithm for discrete optimization problems” Engineering Optimization 52(6): 945\u2013959. DOI: 10.1080\/0305215X. 2019.1624740.<\/span><\/li>\n
  13. [13] E. Atashpaz-Gargari and C. Lucas. \u201cImperialist competitive algorithm: An <\/span>algorithm for optimization inspired by imperialistic competition\u201d. In: cited By 1792. 2007, 4661\u20134667. DOI: 10.1109\/CEC.2007. 4425083.<\/span><\/li>\n
  14. [14] R. Rao, V. Savsani, and D. Vakharia, (2011) \u201cTeaching-learning-based opti<\/span>mization: A novel method for constrained mechanical design optimization problems” CAD Computer Aided Design 43<\/span>(3):<\/span> 303\u2013315. DOI: 10. 1016\/j.cad.2010.12.015.<\/span><\/li>\n
  15. [15] L. Abualigah, A. Diabat, S. Mirjalili, M. Abd Elaziz<\/span>, and A. Gandomi, (2021) \u201cThe Arit<\/span>hmetic Optimization Algorithm” Computer Methods in Applied Mechanics and Engineering 376: DOI: 10.1016\/j.cma.2020. 113609.<\/span><\/li>\n
  16. [16] F. Hashim, K. Hussain, E. Houssein, M. Mabrou<\/span>k, and W. Al-Atabany, (2021) <\/span>\u201cArchimed<\/span>es optimization algorithm: a new metaheuristic algorithm for solving optimization problems” Applied Intelligence 51(3): 15311551. DOI: 10.1007\/s10489-020-01893-z.<\/span><\/li>\n
  17. [17] J. Agushaka and A. Ezugwu, <\/span>(2021) \u201cAdvanced arithmetic optimization algorithm fo<\/span>r solving mechanical engineering design problems” PLoS ONE 16(8 August): DOI: 10.1371\/journal.pone.0255703.<\/span><\/li>\n
  18. [18] Z. Zhang, C. Huang, H. Huang, S. Tang, and K. Dong, (201<\/span>8) \u201cAn optimization method:<\/span> Hummingbirds optimization algorithm” Journal of Systems Engineering and Electronics 29(2): 386\u2013404. DOI: 10.21629\/JSEE. 2018.02.19.<\/span><\/li>\n
  19. [19] W. Zhao, L. Wang, and S. Mirjalili, (2022) \u201cArtificial hummingbird algorith<\/span>m: A <\/span>new bio-inspired optimizer with its engineering applications” Computer Methods in Applied Mechanics and Engineering 388: DOI: 10.1016\/j.cma.2021.114194.<\/span><\/li>\n
  20. [20] D. Wolpert and W. Macready, (1997) \u201cNo free lunch theorems f<\/span>or optimization” IEEE Transactions on Evolutionary Computation 1(1): 67\u201382. DOI: 10.1109\/ 4235.585893.<\/li>\n
  21. [21] D. Bertsekas. Nonlinear Programming. 3rd ed. Athena Scientific, 2016.<\/li>\n
  22. [22] A. Gabis, Y. Meraihi, S. Mirjalili, and A. Ramdane Cherif, (2021) \u201cA comprehensive survey of sine cosine algorithm: variants and applications” Artificial Intelligence Review 54(7): 5469\u20135540. DOI: 10.1007\/s10462021-10026-y.<\/span><\/li>\n
  23. [23] Virtual Library of Simulation Experiments: Test Functions and Datasets. Website. <\/span>https:\/\/www.sfu.ca\/<\/span><\/a> ~ssurjano\/optimization.html. 2013.<\/span><\/li>\n
  24. [24] Website. <\/span>https:\/\/seyedalimirjalili.com\/sca<\/span><\/a>..<\/span><\/li>\n
  25. [25]<\/span> R. Eberhart and J. Kennedy. \u201cNew optimizer using particle swarm theory\u201d. In<\/span>: cited By 12748. 1995, 3943.<\/span><\/li>\n
  26. [26] X.-S. Ya<\/span>ng, (2010) <\/span>\u201cFirefly algorithm, stochastic test functions and design optimization” International Journal of Bio-Inspired Computation 2(2): 78\u201384. DOI: 10. 1504\/IJBIC.2010.032124.<\/span><\/li>\n
  27. [27] G. Farr, (2015) \u201cCost-effectiveness o<\/span>f algorithms” Discrete Mathematics &<\/span> Theoretical Computer Science 17:<\/span><\/li>\n
  28. [28] V. Beiranvand, W. Hare,<\/span> and Y. Lucet, (2017) \u201cBest practices for comparing optimization algorithms” Optimization and Engineering 18(4): 815\u2013848. DOI: 10. 1007\/s11081-017-9366-1.<\/span><\/li>\n
  29. [29] A. Sadollah, A. Bahreinine<\/span>jad, H. Eskandar, and M. Hamdi, (2013) \u201cMine blast algorithm: A new population based algorithm for solving constrained engineering optimization problems” Applied Soft Computing Journal 13(5): 2592\u20132612. DOI: 10.1016\/j.asoc.2012.11.026.<\/span><\/li>\n
  30. [30] B. Kannan and S. K<\/span>ramer, (1994) \u201cAn 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\u2013411. DOI: 10.1115\/1. 2919393.<\/span><\/li>\n
  31. [31]<\/span> C. Coello Coel<\/span>lo, (2000) \u201cUse of a self-adaptive penalty approach for engineering optimization problems” Computers in Industry 41(2): 113\u2013127. DOI: 10.1016\/ S0166-3615(99)00046-9.<\/li>\n<\/ol>\n<\/div>\n\n\n\n

    <\/p>\n","protected":false},"author":3,"template":"wp-custom-template-detail-4-aricles","meta":{"_uag_custom_page_level_css":""},"categories":[936,6,942],"tags":[1072],"acf":[],"uagb_featured_image_src":[],"uagb_author_info":{"display_name":"\u6797\u923a\u6db5","author_link":"\/jase\/?author=3"},"uagb_comment_info":0,"uagb_excerpt":" 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:  BibTeX | http:\/\/dx.doi.org\/10.6180\/jase.202212_25(6).0020   Download PDF Heuristics play a key role in solving optimization problems with complex…","_links":{"self":[{"href":"\/jase\/index.php?rest_route=\/wp\/v2\/tkuisotope\/5387"}],"collection":[{"href":"\/jase\/index.php?rest_route=\/wp\/v2\/tkuisotope"}],"about":[{"href":"\/jase\/index.php?rest_route=\/wp\/v2\/types\/tkuisotope"}],"author":[{"embeddable":true,"href":"\/jase\/index.php?rest_route=\/wp\/v2\/users\/3"}],"wp:attachment":[{"href":"\/jase\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=5387"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"\/jase\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=5387"},{"taxonomy":"post_tag","embeddable":true,"href":"\/jase\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=5387"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}