C-SOMGOAM: A Self-Organizing Migrating Grasshopper Mutation Algorithm for solving constrained optimization
Conteúdo do artigo principal
Resumo
This paper introduces C-SOMGOAM, a self-organizing migrating grasshopper optimization algorithm designed for constrained optimization (CO). The algorithm integrates features from the Grasshopper Optimization Algorithm (GOA), the Self-Organizing Migrating Algorithm (SOMA), and a non-uniform mutation operator. A key contribution of this work is the incorporation of a penalty-free constraint-handling mechanism into GOA to effectively address CO problems. Unlike some traditional methods, the proposed GOA variant explicitly operates on a population of solutions. Starting with a randomly selected population, the algorithm iteratively modifies these solutions to improve the approximation of the global optimum. C-SOMGOAM is not only simple to implement but also capable of generating feasible and high-quality solutions. To assess its performance, the algorithm is evaluated on ten constrained benchmark problems and three engineering design problems from the literature. The effectiveness of C-SOMGOAM is demonstrated through comprehensive result analysis and comparative evaluation against existing variants.
Detalhes do artigo
Este trabalho está licenciado sob uma licença Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
Referências
1. Arora, S., Anand, P.: Chaotic grasshopper optimization algorithm for global optimization. Neural Computing and Applications 31, 4385–4405 (2019). https://doi.org/10.1007/s00521-018-3343-2
2. Alatas, B., Akin, E., Ozer, A.B.: Chaos embedded particle swarm optimization algorithms. Chaos, Solitons & Fractals 40, 1715–1734 (2009). https://doi.org/10.1016/j.chaos.2007.09.063
3. Alatas, B.: Chaotic bee colony algorithms for global numerical optimization. Expert systems with applications 37, 5682–5687 (2010). https://doi.org/10.1016/j.eswa.2010.02.042
4. Coello, C.A.C.: Use of a self-adaptive penalty approach for engineering optimization problems. Computers in Industry 41, 113–127 (2000). https://doi.org/10.1016/S0166-3615(99)00046-9
5. Deep, K., & Singh, D.: A self-organizing migrating genetic algorithm for constrained optimization. Applied Mathematics and Computation 198, 237–250 (2008). https://doi.org/10.1016/j.amc.2007.08.032
6. Ewees, A. A., Abd Elaziz, M., Houssein, E. H.: Improved grasshopper optimization algorithm using opposition-based learning. Expert Systems with Applications 112, 156–172 (2018). https://doi.org/10.1016/j.eswa.2018.06.023
7. Eberhart, R., Kennedy, J. A new optimizer using particle swarm theory. In: MHS’95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science, pp.39–43 (1995). Ieee. https://doi.org/10.1109/MHS.1995.494215
8. El-Shorbagy, M.A., El-Refaey, A.M.: Hybridization of grasshopper optimization algorithm with genetic algorithm for solving system of non-linear equations. IEEE Access 8, 220944–220961 (2020). https://doi.org/10.1109/ACCESS.2020.3043029
9. Garg, H. Solving structural engineering design optimization problems using an artificial bee colony alorithm. J Ind Manag Optim 10, 777–794 (2014). https://doi.org/10.3934/jimo.2014.10.777
10. Garg, H.: A hybrid pso-ga algorithm for constrained optimization problems. Applied Mathe-matics and Computation 274, 292–305 (2016). https://doi.org/10.1016/j.amc.2015.11.001
11. Guo, S.-S., Wang, J.-S., Xie, W., Guo, M., Zhu, L.-F. Improved grasshopper algorithm based on gravity search operator and pigeon colony landmark operator. IEEE Access 8, 22203–22224 (2020). https://doi.org/10.1109/ACCESS.2020.2967399
12. Holland, J. H.: Genetic algorithms. Scientific american 267, 66–73 (1992). https://doi.org/10.1038/scientificamerican0792-66
13. Hertz, A., Werra, D. D.: Using tabu search techniques for graph coloring. Computing 39, 345–351 (1987). https://doi.org/10.1007/BF02239976
14. Jia, H., Li, Y., Lang, C., Peng, X., Sun, K., Li, J.: Hybrid grasshopper optimization algorithm and differential evolution for global optimization. Journal of Intelligent & Fuzzy Systems 37, 6899–6910 (2019). https://doi.org/10.3233/JIFS-190782
15. Kumar, N., Mahato, S. K., Bhunia, A. K.: A new qpso based hybrid algorithm for constrained optimization problems via tournamenting process. Soft Computing 24, 11365–11379 (2020). https://doi.org/10.1007/s00500-019-04601-3
16. Kuik, R., Salomon, M., Van Wassenhove, L. N., Maes, J.: Linear programming, simulated annealing and tabu search heuristics for lotsizing in bottleneck assembly systems. IIE transactions 25, 62–72 (1993).https://doi.org/10.1080/07408179308964266
17. Lee, J.-K., Kim, Y.-D.: Search heuristics for resource constrained project scheduling. Journal of the Operational Research Society 47, 678–689 (1996). https://doi.org/10.1057/jors.1996.79
18. Meraihi, Y., Gabis, A. B., Mirjalili, S., Ramdane-Cherif, A.: Grasshopper optimization algorithm: theory, variants, and applications. Ieee Access 9, 50001–50024 (2021). https://doi.org/10.1109/ACCESS.2021.3067597
19. Nadimi-Shahraki, M. H., Taghian, S., Mirjalili, S.: An improved grey wolf optimizer for solving engineering problems. Expert Systems with Applications 166, 113917 (2021). https://doi.org/10.1016/j.eswa.2020.113917
20. Pinto, H., Peña, A., Valenzuela, M., Fernández, A.: A binary grasshopper algorithm applied to the knapsack problem. In: Artificial Intelligence and Algorithms in Intelligent Systems. Proceedings of 7th Computer Science On-line Conference 2018, 27, pp. 132–143(2019). Springer. https://doi.org/10.1007/978-3-319-91189-2_14
21. Rashedi, E., Nezamabadi-Pour, H., Saryazdi, S.: Gsa: a gravitational search algorithm. Information sciences 179, 2232–2248 (2009). https://doi.org/10.1016/j.ins.2009.03.004
22. Singh, D., Agrawal, S.: A novel hybrid self organizing migrating algorithm with mutation for global optimization. Int J Soft Comput Eng 3, 101–106 (2014). https://www.ijsce.org/portfolio-item/f2006013614/
23. Singh, D., Agrawal, S.: Log-logistic soma with quadratic approximation crossover. In: International Conference on Computing, Communication & Automation, pp. 146–151 (2015).IEEE. https://doi.org/10.1109/CCAA.2015.7148380
24. Singh, D., Agrawal, S., Deep, K.: C-somaqi: self organizing migrating algorithm with quadratic interpolation crossover operator for constrained global optimization. Self-Organizing Migrating Algorithm: Methodology and Implementation 147–165 (2016). https://doi.org/10.1007/978-3-319-28161-2_7
25. Shayanfar, H., Gharehchopogh, F. S.: Farmland fertility: A new metaheuristic algorithm for solving continuous optimization problems. Applied Soft Computing 71, 728–746 (2018). https://doi.org/10.1016/j.asoc.2018.07.033
26. Saremi, S., Mirjalili, S., Lewis, A.: Grasshopper optimisation algorithm: theory and application. Advances in engineering software 105, 30–47 (2017). https://doi.org/10.1016/j.advengsoft.2017.01.004
27. Wolpert, D. H., Macready, W. G.: No free lunch theorems for optimization. IEEE transactions on evolutionary computation 1, 67–82 (1997). https://doi.org/10.1109/4235.585893
28. Yildiz, B. S., Mehta, P., Sait, S. M., Panagant, N., Kumar, S., Yildiz, A. R.: A new hybrid artificial hummingbird-simulated annealing algorithm to solve constrained mechanical engineering problems. Materials Testing 64, 1043–1050 (2022). https://doi.org/10.1515/mt-2022-0123
29. Yildiz, B. S., Patel, V., Pholdee, N., Sait, S. M., Bureerat, S., Yildiz, A. R.: Conceptual comparison of the ecogeography-based algorithm, equilibrium algorithm, marine predators algorithm and slime mold algorithm for optimal product design. Materials Testing 63,336–340 (2021). https://doi.org/10.1515/mt-2020-0049
30. Zamani, H., Nadimi-Shahraki, M. H., Gandomi, A. H. Starling murmuration optimizer: A novel bio-inspired algorithm for global and engineering optimization. Computer Methods in Applied Mechanics and Engineering 392, 114616 (2022). https://doi.org/10.1016/j.cma.2022.114616
31. Liao, X., Hoang, K., & Luo, X. (2025). Local search-based anytime algorithms for continuous distributed constraint optimization problems. IEEE/CAA Journal of Automatica Sinica 12, 288-290. https://doi.org/10.1109/JAS.2024.124413