TY  - JOUR
U1  - Wissenschaftlicher Artikel
A1  - Lapucci, Matteo
A1  - Mansueto, Pierluigi
A1  - Schoen, Fabio
T1  - A memetic procedure for global multi-objective optimization
JF  - Mathematical Programming Computation
N2  - In this paper we consider multi-objective optimization problems over a box. Several computational approaches to solve these problems have been proposed in the literature, that broadly fall into two main classes: evolutionary methods, which are usually very good at exploring the feasible region and retrieving good solutions even in the nonconvex case, and descent methods, which excel in efficiently approximating good quality solutions. In this paper, first we confirm, through numerical experiments, the advantages and disadvantages of these approaches. Then we propose a new method which combines the good features of both. The resulting algorithm, which we call Non-dominated Sorting Memetic Algorithm, besides enjoying interesting theoretical properties, excels in all of the numerical tests we performed on several, widely employed, test functions.
AB  - In this paper we consider multi-objective optimization problems over a box. Several computational approaches to solve these problems have been proposed in the literature, that broadly fall into two main classes: evolutionary methods, which are usually very good at exploring the feasible region and retrieving good solutions even in the nonconvex case, and descent methods, which excel in efficiently approximating good quality solutions. In this paper, first we confirm, through numerical experiments, the advantages and disadvantages of these approaches. Then we propose a new method which combines the good features of both. The resulting algorithm, which we call Non-dominated Sorting Memetic Algorithm, besides enjoying interesting theoretical properties, excels in all of the numerical tests we performed on several, widely employed, test functions.
Y1  - 2022
SN  - 1867-2949
SS  - 1867-2949
U6  - https://doi.org/10.1007/s12532-022-00231-3
DO  - https://doi.org/10.1007/s12532-022-00231-3
VL  - 15
IS  - 2
SP  - 227
EP  - 267
S1  - 41
PB  - Springer Science and Business Media LLC
ER  -