×

Multi-objective mantis search algorithm (MOMSA): a novel approach for engineering design problems and validation. (English) Zbl 1539.90108

Summary: This paper proposes a new Multi-Objective Mantis Search Algorithm (MOMSA) to handle complex optimization problems, including real-world engineering optimization problems. The Mantis Search Algorithm (MSA) is a recently reported nature-inspired metaheuristic algorithm, and it has been inspired by the unique hunting behavior and sexual cannibalism of praying mantises. The proposed MOMSA algorithm employs the same underlying MSA mechanisms for convergence combined with an elitist non-dominated sorting approach to estimate Pareto-optimal solutions. In addition, MOMSA employs the crowding distance mechanism to enhance the coverage of optimal solutions across all objectives. To validate its performance, we conduct 29 case studies, encompassing twenty multi-objective benchmark problems (ZDT, DTLZ, and CEC 2009) and nine engineering design problems. Furthermore, MOMSA is applied to the IEEE-30 bus system, addressing both single- and multi-objective optimal power flow problems across eight distinct cases. Results are compared with some state-of-the-art approaches using various performance metrics such as GD, MS, IGD, and HV. The findings demonstrate MOMSA’s ability to effectively balance convergence, diversity, and uniformity, providing valuable insights for decision-makers addressing complex problems. The source code of MOMSA is publicly accessible at https://www.mathworks.com/matlabcentral/fileexchange/159623-momsa-multi-objective-mantis-search-algorithm.

MSC:

90C29 Multi-objective and goal programming
65K05 Numerical mathematical programming methods
90C59 Approximation methods and heuristics in mathematical programming
90C70 Fuzzy and other nonstochastic uncertainty mathematical programming
Full Text: DOI

References:

[1] Tanabe, R.; Ishibuchi, H., An easy-to-use real-world multi-objective optimization problem suite, Appl. Soft Comput., 89, Article 106078 pp., 2020
[2] Abouhawwash, M.; Jameel, M.; Deb, K., A smooth proximity measure for optimality in multi-objective optimization using benson’s method, Comput. Oper. Res., 117, Article 104900 pp., 2020 · Zbl 1458.90566
[3] Premkumar, M.; Jangir, P.; Sowmya, R., MOGBO: A new multiobjective gradient-based optimizer for real-world structural optimization problems, Knowl.-Based Syst., 218, Article 106856 pp., 2021
[4] Dommel, H. W.; Tinney, W. F., Optimal power flow solutions, IEEE Trans. Power Appar. Syst., 10, 1866-1876, 1968
[5] Hazra, J.; Sinha, A., A multi-objective optimal power flow using particle swarm optimization, Eur. Trans. Electr. Power, 21, 1, 1028-1045, 2011
[6] Premkumar, M.; Jangir, P.; Sowmya, R.; Alhelou, H. H.; Heidari, A. A.; Chen, H., MOSMA: Multi-objective slime mould algorithm based on elitist non-dominated sorting, IEEE Access, 9, 3229-3248, 2020
[7] Adam, S. P.; Alexandropoulos, S.-A. N.; Pardalos, P. M.; Vrahatis, M. N., No free lunch theorem: A review, Approx. Optim.: Algorithms Complex. Appl., 57-82, 2019 · Zbl 1425.90111
[8] Got, A.; Zouache, D.; Moussaoui, A., MOMRFO: Multi-objective manta ray foraging optimizer for handling engineering design problems, Knowl.-Based Syst., 237, Article 107880 pp., 2022
[9] Deb, K., Advances in evolutionary multi-objective optimization, (Search Based Software Engineering: 4th International Symposium, SSBSE 2012, Riva Del Garda, Italy, September 28-30, 2012. Proceedings 4, 2012, Springer), 1-26
[10] Savsani, V.; Tawhid, M. A., Non-dominated sorting moth flame optimization (NS-MFO) for multi-objective problems, Eng. Appl. Artif. Intell., 63, 20-32, 2017
[11] Long, Q.; Li, G.; Jiang, L., A novel solver for multi-objective optimization: Dynamic non-dominated sorting genetic algorithm (DNSGA), Soft Comput., 1-23, 2022
[12] Li, B.; Wang, H., Multi-objective sparrow search algorithm: A novel algorithm for solving complex multi-objective optimisation problems, Expert Syst. Appl., 210, Article 118414 pp., 2022
[13] Coello, C. C.; Lechuga, M. S., MOPSO: A proposal for multiple objective particle swarm optimization, (Proceedings of the 2002 Congress on Evolutionary Computation. CEC’02 (Cat. No. 02TH8600), Vol. 2, 2002, IEEE), 1051-1056
[14] Zhang, Q.; Li, H., MOEA/D: a multiobjective evolutionary algorithm based on decomposition, IEEE Trans. Evol. Comput., 11, 6, 712-731, 2007
[15] Mirjalili, S.; Jangir, P.; Saremi, S., Multi-objective ant lion optimizer: a multi-objective optimization algorithm for solving engineering problems, Appl. Intell., 46, 79-95, 2017
[16] Zhang, M.; Wang, H.; Cui, Z.; Chen, J., Hybrid multi-objective cuckoo search with dynamical local search, Memet. Comput., 10, 199-208, 2018
[17] Mirjalili, S.; Gandomi, A. H.; Mirjalili, S. Z.; Saremi, S.; Faris, H.; Mirjalili, S. M., Salp swarm algorithm: A bio-inspired optimizer for engineering design problems, Adv. Eng. Softw., 114, 163-191, 2017
[18] Mirjalili, S., Dragonfly algorithm: a new meta-heuristic optimization technique for solving single-objective, discrete, and multi-objective problems, Neural Comput. Appl., 27, 1053-1073, 2016
[19] Khodadadi, N.; Soleimanian Gharehchopogh, F.; Mirjalili, S., MOAVOA: A new multi-objective artificial vultures optimization algorithm, Neural Comput. Appl., 34, 23, 20791-20829, 2022
[20] Premkumar, M.; Jangir, P.; Sowmya, R.; Alhelou, H. H.; Mirjalili, S.; Kumar, B. S., Multi-objective equilibrium optimizer: Framework and development for solving multi-objective optimization problems, J. Comput. Des. Eng., 9, 1, 24-50, 2022
[21] Varadarajan, M.; Swarup, K. S., Solving multi-objective optimal power flow using differential evolution, IET Gen. Transm. Distrib., 2, 5, 720-730, 2008
[22] Khunkitti, S.; Siritaratiwat, A.; Premrudeepreechacharn, S., Multi-objective optimal power flow problems based on slime mould algorithm, Sustainability, 13, 13, 7448, 2021
[23] Layth, A.; Murtadha, A.; Jaleel, A., Solving optimal power flow problem using improved differential evolution algorithm, Int. J. Electr. Electron. Eng. Telecommun., 11, 2, 146-155, 2022
[24] Premkumar, M.; Jangir, P.; Sowmya, R.; Elavarasan, R. M., Many-objective gradient-based optimizer to solve optimal power flow problems: analysis and validations, Eng. Appl. Artif. Intell., 106, Article 104479 pp., 2021
[25] Huband, S.; Hingston, P.; Barone, L.; While, L., A review of multiobjective test problems and a scalable test problem toolkit, IEEE Trans. Evol. Comput., 10, 5, 477-506, 2006
[26] Q. Zhang, A. Zhou, S. Zhao, P.N. Suganthan, W. Liu, S. Tiwari, et al. Multiobjective optimization test instances for the CEC 2009 special session and competition, no. 264, pp. 1-30, 2008.
[27] Deb, K.; Agrawal, S.; Pratap, A.; Meyarivan, T., A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II, (Parallel Problem Solving from Nature PPSN VI: 6th International Conference Paris, France, September 18-20, 2000 Proceedings 6, 2000, Springer), 849-858
[28] Ray, T.; Liew, K., A swarm metaphor for multiobjective design optimization, Eng. Optim., 34, 2, 141-153, 2002
[29] Van Veldhuizen, D. A.; Lamont, G. B., Multiobjective Evolutionary Algorithm Research: a History and Analysistech. rep., 1998, Citeseer
[30] Zitzler, E.; Deb, K.; Thiele, L., Comparison of multiobjective evolutionary algorithms: Empirical results, Evol. Comput., 8, 2, 173-195, 2000
[31] Li, S.; Chen, H.; Wang, M.; Heidari, A. A.; Mirjalili, S., Slime mould algorithm: A new method for stochastic optimization, Future Gener. Comput. Syst., 111, 300-323, 2020
[32] Hashim, F. A.; Houssein, E. H.; Hussain, K.; Mabrouk, M. S.; Al-Atabany, W., Honey badger algorithm: New metaheuristic algorithm for solving optimization problems, Math. Comput. Simulation, 192, 84-110, 2022 · Zbl 1540.90296
[33] Mohammed, H.; Rashid, T., FOX: a FOX-inspired optimization algorithm, Appl. Intell., 53, 1, 1030-1050, 2023
[34] Mirjalili, S., The ant lion optimizer, Adv. Eng. Softw., 83, 80-98, 2015
[35] Mirjalili, S. Z.; Mirjalili, S.; Saremi, S.; Faris, H.; Aljarah, I., Grasshopper optimization algorithm for multi-objective optimization problems, Appl. Intell., 48, 805-820, 2018
[36] Zitzler, E.; Laumanns, M.; Thiele, L., SPEA2: Improving the strength Pareto evolutionary algorithm, TIK Report, 103, 2001
[37] Yue, C.; Qu, B.; Liang, J., A multiobjective particle swarm optimizer using ring topology for solving multimodal multiobjective problems, IEEE Trans. Evol. Comput., 22, 5, 805-817, 2017
[38] Duman, S.; Akbel, M.; Kahraman, H. T., Development of the multi-objective adaptive guided differential evolution and optimization of the MO-ACOPF for wind/PV/tidal energy sources, Appl. Soft Comput., 112, Article 107814 pp., 2021
[39] Qu, B.; Li, C.; Liang, J.; Yan, L.; Yu, K.; Zhu, Y., A self-organized speciation based multi-objective particle swarm optimizer for multimodal multi-objective problems, Appl. Soft Comput., 86, Article 105886 pp., 2020
[40] Barocio, E.; Regalado, J.; Cuevas, E.; Uribe, F.; Zúñiga, P.; Torres, P. J.R., Modified bio-inspired optimisation algorithm with a centroid decision making approach for solving a multi-objective optimal power flow problem, IET Gen. Transm. Distrib., 11, 4, 1012-1022, 2017
[41] Deb, K., Multi-objective optimisation using evolutionary algorithms: an introduction, (Multi-Objective Evolutionary Optimisation for Product Design and Manufacturing, 2011, Springer), 3-34
[42] Jangir, P.; Heidari, A. A.; Chen, H., Elitist non-dominated sorting harris hawks optimization: Framework and developments for multi-objective problems, Expert Syst. Appl., 186, Article 115747 pp., 2021
[43] Jangir, P.; Jangir, N., Non-dominated sorting whale optimization algorithm (NSWOA): a multi-objective optimization algorithm for solving engineering design problems, Glob. J. Res. Eng., 17, 15-42, 2017
[44] Tawhid, M. A.; Savsani, V., Multi-objective sine-cosine algorithm (MO-SCA) for multi-objective engineering design problems, Neural Comput. Appl., 31, 915-929, 2019
[45] Daqaq, F.; Kamel, S.; Ouassaid, M.; Ellaia, R.; Agwa, A. M., Non-dominated sorting manta ray foraging optimization for multi-objective optimal power flow with wind/solar/small-hydro energy sources, Fractal Fract., 6, 4, 194, 2022
[46] Sharma, S.; Khodadadi, N.; Saha, A. K.; Gharehchopogh, F. S.; Mirjalili, S., Non-dominated sorting advanced butterfly optimization algorithm for multi-objective problems, J. Bionic Eng., 20, 2, 819-843, 2023
[47] Jangir, P.; Buch, H.; Mirjalili, S.; Manoharan, P., MOMPA: Multi-objective marine predator algorithm for solving multi-objective optimization problems, Evol. Intell., 16, 1, 169-195, 2023
[48] Akbari, R.; Hedayatzadeh, R.; Ziarati, K.; Hassanizadeh, B., A multi-objective artificial bee colony algorithm, Swarm Evol. Comput., 2, 39-52, 2012
[49] Mirjalili, S.; Saremi, S.; Mirjalili, S. M.; Coelho, L.d. S., Multi-objective grey wolf optimizer: a novel algorithm for multi-criterion optimization, Expert Syst. Appl., 47, 106-119, 2016
[50] Mirjalili, S.; Jangir, P.; Mirjalili, S. Z.; Saremi, S.; Trivedi, I. N., Optimization of problems with multiple objectives using the multi-verse optimization algorithm, Knowl.-Based Syst., 134, 50-71, 2017
[51] Khishe, M.; Orouji, N.; Mosavi, M., Multi-objective chimp optimizer: An innovative algorithm for multi-objective problems, Expert Syst. Appl., 211, Article 118734 pp., 2023
[52] Khodadadi, N.; Talatahari, S.; Dadras Eslamlou, A., MOTEO: a novel multi-objective thermal exchange optimization algorithm for engineering problems, Soft Comput., 26, 14, 6659-6684, 2022
[53] Khodadadi, N.; Abualigah, L.; Al-Tashi, Q.; Mirjalili, S., Multi-objective chaos game optimization, Neural Comput. Appl., 35, 20, 14973-15004, 2023
[54] Abdel-Basset, M.; Mohamed, R.; Zidan, M.; Jameel, M.; Abouhawwash, M., Mantis search algorithm: A novel bio-inspired algorithm for global optimization and engineering design problems, Comput. Methods Appl. Mech. Engrg., 415, Article 116200 pp., 2023 · Zbl 1539.90068
[55] Sivasubramani, S.; Swarup, K., Sequential quadratic programming based differential evolution algorithm for optimal power flow problem, IET Gen. Transm. Distrib., 5, 11, 1149-1154, 2011
[56] Knowles, J.; Corne, D., The pareto archived evolution strategy: A new baseline algorithm for pareto multiobjective optimisation, (Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406), Vol. 1, 1999, IEEE), 98-105
[57] Gandomi, A. H.; Yang, X.-S.; Alavi, A. H., Mixed variable structural optimization using firefly algorithm, Comput. Struct., 89, 23-24, 2325-2336, 2011
[58] Knowles, J. D.; Thiele, L.; Zitzler, E., A tutorial on the performance assessment of stochastic multiobjective optimizers, TIK-Report, 214, 2006
[59] Singh, H. K., Understanding hypervolume behavior theoretically for benchmarking in evolutionary multi/many-objective optimization, IEEE Trans. Evol. Comput., 24, 3, 603-610, 2019
[60] Alsac, O.; Stott, B., Optimal load flow with steady-state security, IEEE Trans. Power Appar. Syst., 3, 745-751, 1974
[61] Su, H.; Zhao, D.; Heidari, A. A.; Liu, L.; Zhang, X.; Mafarja, M.; Chen, H., RIME: A physics-based optimization, Neurocomputing, 532, 183-214, 2023
[62] Faramarzi, A.; Heidarinejad, M.; Mirjalili, S.; Gandomi, A. H., Marine predators algorithm: A nature-inspired metaheuristic, Expert Syst. Appl., 152, Article 113377 pp., 2020
[63] Abdel-Basset, M.; El-Shahat, D.; Jameel, M.; Abouhawwash, M., Young’s double-slit experiment optimizer: A novel metaheuristic optimization algorithm for global and constraint optimization problems, Comput. Methods Appl. Mech. Engrg., 403, Article 115652 pp., 2023 · Zbl 1536.90246
[64] Eberhart, R.; Kennedy, J., Particle swarm optimization, (Proceedings of the IEEE International Conference on Neural Networks, Vol. 4, 1995, Citeseer), 1942-1948
[65] Gandomi, A. H.; Yang, X.-S.; Alavi, A. H., Cuckoo search algorithm: a metaheuristic approach to solve structural optimization problems, Eng. Comput., 29, 17-35, 2013
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.