Research Area: Metaheuristic Computing
Recently, several meta-heuristics and evolutionary algorithms have been proposed for tackling optimization problems. Such methods tend to suffer from degraded performance when solving multi-objective optimization problems due to addressing the conflicting goals of finding accurate estimation of Pareto optimal solutions and increasing their distribution across all objectives. In this paper, the Whale Optimization Algorithm (WOA) is improved and extended to solve such multi-objective optimization problems with the purpose of alleviating these drawbacks. The improvements include: (1) modifying the distance control factor of the standard WOA to contain values generated dynamically instead of a fixed one, (2) the trade-off between moving toward the opposite of the best solution and its original values based on a certain probability to prevent stuck into local minima, and (3) accelerating the convergence and coverage using Nelder–Mead method and the Pareto Archived Evolution Strategy (PAES). The proposed algorithm is tested on three benchmark multi-objective test functions (DTLZ, CEC 2009, and GLT), including 25 test functions, to verify its effectiveness by comparing with nine robust multi-objective algorithms. The experiments demonstrate the superiority of the proposed algorithm compared to some of the existing multi-objective algorithms in the literature.
Keywords:
Whale Optimization Algorithm
Nelder–Mead simplex
multi-objective optimization problems
Pareto Archived Evolution Strategy
Author(s) Name: Mohamed Abdel-Basset, Reda Mohamed, Seyedali Mirjalili
Journal name: Knowledge-Based Systems
Conferrence name:
Publisher name: Elsevier
DOI: 10.1016/j.knosys.2020.106619
Volume Information: Volume 212, 5 January 2021, 106619
