Marine predator algorithm with elite strategies for engineering design problems

• Published in: Concurrency and computation Vol. 35; no. 7
• Main Authors: Aydemir, Salih Berkan, Kutlu Onay, Funda
• Format: Journal Article
• Language: English
• Published: Hoboken Wiley Subscription Services, Inc 25.03.2023
• Subjects: Algorithms; benchmark function; Benchmarks; Convergence; Design engineering; elite evolution strategy; engineering problems; Evolution; Heuristic methods; marine predator algorithm; metaheuristic algorithm; Mutation; Optimization; Predators; Solution space; Strategy
• ISSN: 1532-0626; 1532-0634
• DOI: 10.1002/cpe.7612

Summary Marine predator algorithm (MPA) is a powerful metaheuristic optimization algorithm that shows effective convergence ability on complex benchmark functions. The combination of Brownian and Levy flight distributions directly affects the convergence strategy of MPA. Although MPA has good convergence performance, it is open to improvement as it falls to a local optimum and cannot comprehensively scan the search area during the exploration phase. In this study, MPA has been improved by integrating elite natural evolution and elite random mutation strategies. In addition, these two strategies are combined with Gaussian mutation. The proposed method in this study which is named as elite evolution strategy MPA (EEMPA) has achieved comprehensive scanning of the solution space and considerably reduced the risk of falling into the local optimum trap, with elite strategies. The effect of EEMPA has been tested with the CEC2017 and CEC2019 benchmark functions. EEMPA has been compared with some metaheuristic algorithms frequently used in the literature and gives promising results among the considered optimization methods. Furthermore, EEMPA has been examined for seven well‐known real world engineering problems. When the results are compared with both classical MPA and enhanced MPA methods, EEMPA converges to better than the other methods.