Abstract
This novel article presents the multi-objective version of the recently proposed the Grey Wolf Optimizer (GWO) known as Non-Dominated Sorting Grey Wolf Optimizer (NSGWO). This proposed NSGWO algorithm works in such a manner that it first collects all non-dominated Pareto optimal solutions in achieve till the evolution of last iteration limit. The best solutions are then chosen from the collection of all Pareto optimal solutions using a crowding distance mechanism based on the coverage of solutions and leadership hierarchy of grey wolfs in nature to guide hunting of wolfs towards the dominated regions of multi-objective search spaces. For validate the efficiency and effectiveness of proposed NSGWO algorithm is applied to a set of standard unconstrained, constrained and engineering design problems. The results are verified by comparing NSGWO algorithm against Multi objective Colliding Bodies Optimizer (MOCBO), Multi objective Particle Swarm Optimizer (MOPSO), non-dominated sorting genetic algorithm II (NSGA-II) and Multi objective Symbiotic Organism Search (MOSOS). The results of proposed NSGWO algorithm validates its efficiency in terms of Execution Time (ET) and effectiveness in terms of Generalized Distance (GD), Diversity Metric (DM) on standard unconstraint, constraint and engineering design problem in terms of high coverage and faster convergence.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Engineering Applications of Artificial Intelligence
Disclaimer: 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.