Multi‐objective optimization using metaheuristics: non‐standard algorithms |
| |
Authors: | El‐Ghazali Talbi Matthieu Basseur Antonio J. Nebro Enrique Alba |
| |
Affiliation: | 1. INRIA-University of Lille, , Villeneuve d'Ascq, France;2. King Saud University, , Riyadh, Saudi Arabia;3. Laboratoire d'Etudes et de Recherche en Informatique d'Angers, , 49000 Angers, France;4. Departamento de Lenguajes y Ciencias de la Computación, University of Málaga, Campus de Teatinos, , Málaga, 29071 Spain |
| |
Abstract: | In recent years, the application of metaheuristic techniques to solve multi‐objective optimization problems has become an active research area. Solving this kind of problems involves obtaining a set of Pareto‐optimal solutions in such a way that the corresponding Pareto front fulfils the requirements of convergence to the true Pareto front and uniform diversity. Most of the studies on metaheuristics for multi‐objective optimization are focused on Evolutionary Algorithms, and some of the state‐of‐the‐art techniques belong this class of algorithms. Our goal in this paper is to study open research lines related to metaheuristics but focusing on less explored areas to provide new perspectives to those researchers interested in multi‐objective optimization. In particular, we focus on non‐evolutionary metaheuristics, hybrid multi‐objective metaheuristics, parallel multi‐objective optimization and multi‐objective optimization under uncertainty. We analyze these issues and discuss open research lines. |
| |
Keywords: | multi‐objective optimization metaheuristics hybridization parallelism optimization under uncertainty |
|
|