Abstract
This study introduces the extension of currently developed Seagull Optimization Algorithm (SOA) in terms of multi-objective problems, which is entitled as Multi-objective Seagull Optimization Algorithm (MOSOA). In this algorithm, a concept of dynamic archive is introduced, which has the feature to cache the non-dominated Pareto optimal solutions. The roulette wheel selection approach is utilized to choose the effective archived solutions by simulating the migration and attacking behaviors of seagulls. The proposed algorithm is approved by testing it with twenty-four benchmark test functions, and its performance is compared with existing metaheuristic algorithms. The developed algorithm is analyzed on six constrained problems of engineering design to assess its appropriateness for finding the solutions of real-world problems. The outcomes from the empirical analyzes depict that the proposed algorithm is better than other existing algorithms. The proposed algorithm also considers those Pareto optimal solutions, which demonstrate high convergence.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
