Multi-Objective Search Group Algorithm for engineering design problems

This study proposes a new multi-objective version of the Search Group Algorithm (SGA) called the Multi-Objective Search Group Algorithm (MOSGA). The MOSGA is the combination of the conventional SGA integrated with an elitist non-dominated sorting technique, enabling it to define Pareto optimal solut...

Full description

Saved in:
Bibliographic Details
Main Authors: Huy, T.H.B., Nallagownden, P., Truong, K.H., Kannan, R., Vo, D.N., Ho, N.
Format: Article
Published: Elsevier Ltd 2022
Online Access:https://www.scopus.com/inward/record.uri?eid=2-s2.0-85134598067&doi=10.1016%2fj.asoc.2022.109287&partnerID=40&md5=d9ea23dc50ddb29be5b4e18a09b35047
http://eprints.utp.edu.my/33509/
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This study proposes a new multi-objective version of the Search Group Algorithm (SGA) called the Multi-Objective Search Group Algorithm (MOSGA). The MOSGA is the combination of the conventional SGA integrated with an elitist non-dominated sorting technique, enabling it to define Pareto optimal solutions via mutation, offspring generation, and selection. The Pareto archive with a selection mechanism is used to preserve and enhance the convergence and diversity of solutions. The MOSGA is validated on twenty-five prominent case studies, including nineteen unconstrained multi-objective benchmark problems, six constrained multi-objective benchmark problems, and five multi-objective engineering design problems to validate its capability and effectiveness. The statistical results are compared to the outcomes of other well-regarded algorithms using the same performance metrics. The comparative results show that MOGSA is robust and superior in handling a wide variety of multi-objective problems. © 2022