Multi-Objective Search Group Algorithm for engineering design problems

Huy, T.H.B. and Nallagownden, P. and Truong, K.H. and Kannan, R. and Vo, D.N. and Ho, N. (2022) Multi-Objective Search Group Algorithm for engineering design problems. Applied Soft Computing, 126.

Full text not available from this repository.
Official URL: https://www.scopus.com/inward/record.uri?eid=2-s2....

Abstract

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

Item Type: Article
Impact Factor: cited By 0
Uncontrolled Keywords: Benchmarking; Genetic algorithms; Optimal systems; Pareto principle, Benchmark problems; Elitist non-dominated sorting; Engineering design problems; Multi objective; Multi-objectives optimization; Nondominated solutions; Pareto archive; Pareto optimal solutions; Search group algorithm; Sorting techniques, Multiobjective optimization
Depositing User: Mr Ahmad Suhairi Mohamed Lazim
Date Deposited: 07 Sep 2022 07:19
Last Modified: 07 Sep 2022 07:19
URI: http://scholars.utp.edu.my/id/eprint/33509

Actions (login required)

View Item
View Item