EF1-NSGA-III: An evolutionary algorithm based on the first front to obtain non-negative and non-repeated extreme points

Multi-Objective and Many-objective Optimization problems have been extensively solved through evolutionary algorithms over a few decades. Despite the fact that NSGA-II and NSGA-III are frequently employed as a reference for a comparative evaluation of new evolutionary algorithms, the latter is propr...

Full description

Bibliographic Details
Main Authors: Luis Felipe Ariza Vesga, Johan Sebastián Eslava Garzón, Rafael Puerta Ramirez
Format: Article
Language:English
Published: Universidad Nacional de Colombia 2020-10-01
Series:Ingeniería e Investigación
Subjects:
Online Access:https://revistas.unal.edu.co/index.php/ingeinv/article/view/82906
id doaj-3862989ea40c4a0cb270829321d410e5
record_format Article
spelling doaj-3862989ea40c4a0cb270829321d410e52021-03-15T14:21:38ZengUniversidad Nacional de ColombiaIngeniería e Investigación0120-56092248-87232020-10-01403556910.15446/inginvestig.v40n3.8290666295EF1-NSGA-III: An evolutionary algorithm based on the first front to obtain non-negative and non-repeated extreme pointsLuis Felipe Ariza Vesga0https://orcid.org/0000-0003-1262-1413Johan Sebastián Eslava Garzón1Rafael Puerta Ramirez2Universidad Nacional de ColombiaUniversidad Nacional de ColombiaEricssonMulti-Objective and Many-objective Optimization problems have been extensively solved through evolutionary algorithms over a few decades. Despite the fact that NSGA-II and NSGA-III are frequently employed as a reference for a comparative evaluation of new evolutionary algorithms, the latter is proprietary. In this paper, we used the basic framework of the NSGA-II, which is very similar to the NSGA-III, with significant changes in its selection operator. We took the first front generated at the non-dominating sort procedure to obtain nonnegative and nonrepeated extreme points. This opensource version of the NSGA-III is called EF1-NSGA-III, and its implementation does not start from scratch; that would be reinventing the wheel. Instead, we took the NSGA-II code from the authors in the repository of the Kanpur Genetic Algorithms Laboratory to extend the EF1-NSGA-III. We then adjusted its selection operator from diversity, based on the crowding distance, to the one found on reference points and preserved its parameters. After that, we continued with the adaptive EF1-NSGA-III (A-EF1-NSGA-III), and the efficient adaptive EF1-NSGA-III (A2-EF1-NSGA-III), while also contributing to explain how to generate different types of reference points. The proposed algorithms resolve optimization problems with constraints of up to 10 objective functions. We tested them on a wide range of benchmark problems, and they showed notable improvements in terms of convergence and diversity by using the Inverted Generational Distance (IGD) and the HyperVolume (HV) performance metrics. The EF1-NSGA-III aims to resolve the power consumption for Centralized Radio Access Networks and the BiObjective Minimum DiameterCost Spanning Tree problems.https://revistas.unal.edu.co/index.php/ingeinv/article/view/82906evolutionary algorithmmanyobjective optimization problem
collection DOAJ
language English
format Article
sources DOAJ
author Luis Felipe Ariza Vesga
Johan Sebastián Eslava Garzón
Rafael Puerta Ramirez
spellingShingle Luis Felipe Ariza Vesga
Johan Sebastián Eslava Garzón
Rafael Puerta Ramirez
EF1-NSGA-III: An evolutionary algorithm based on the first front to obtain non-negative and non-repeated extreme points
Ingeniería e Investigación
evolutionary algorithm
manyobjective optimization problem
author_facet Luis Felipe Ariza Vesga
Johan Sebastián Eslava Garzón
Rafael Puerta Ramirez
author_sort Luis Felipe Ariza Vesga
title EF1-NSGA-III: An evolutionary algorithm based on the first front to obtain non-negative and non-repeated extreme points
title_short EF1-NSGA-III: An evolutionary algorithm based on the first front to obtain non-negative and non-repeated extreme points
title_full EF1-NSGA-III: An evolutionary algorithm based on the first front to obtain non-negative and non-repeated extreme points
title_fullStr EF1-NSGA-III: An evolutionary algorithm based on the first front to obtain non-negative and non-repeated extreme points
title_full_unstemmed EF1-NSGA-III: An evolutionary algorithm based on the first front to obtain non-negative and non-repeated extreme points
title_sort ef1-nsga-iii: an evolutionary algorithm based on the first front to obtain non-negative and non-repeated extreme points
publisher Universidad Nacional de Colombia
series Ingeniería e Investigación
issn 0120-5609
2248-8723
publishDate 2020-10-01
description Multi-Objective and Many-objective Optimization problems have been extensively solved through evolutionary algorithms over a few decades. Despite the fact that NSGA-II and NSGA-III are frequently employed as a reference for a comparative evaluation of new evolutionary algorithms, the latter is proprietary. In this paper, we used the basic framework of the NSGA-II, which is very similar to the NSGA-III, with significant changes in its selection operator. We took the first front generated at the non-dominating sort procedure to obtain nonnegative and nonrepeated extreme points. This opensource version of the NSGA-III is called EF1-NSGA-III, and its implementation does not start from scratch; that would be reinventing the wheel. Instead, we took the NSGA-II code from the authors in the repository of the Kanpur Genetic Algorithms Laboratory to extend the EF1-NSGA-III. We then adjusted its selection operator from diversity, based on the crowding distance, to the one found on reference points and preserved its parameters. After that, we continued with the adaptive EF1-NSGA-III (A-EF1-NSGA-III), and the efficient adaptive EF1-NSGA-III (A2-EF1-NSGA-III), while also contributing to explain how to generate different types of reference points. The proposed algorithms resolve optimization problems with constraints of up to 10 objective functions. We tested them on a wide range of benchmark problems, and they showed notable improvements in terms of convergence and diversity by using the Inverted Generational Distance (IGD) and the HyperVolume (HV) performance metrics. The EF1-NSGA-III aims to resolve the power consumption for Centralized Radio Access Networks and the BiObjective Minimum DiameterCost Spanning Tree problems.
topic evolutionary algorithm
manyobjective optimization problem
url https://revistas.unal.edu.co/index.php/ingeinv/article/view/82906
work_keys_str_mv AT luisfelipearizavesga ef1nsgaiiianevolutionaryalgorithmbasedonthefirstfronttoobtainnonnegativeandnonrepeatedextremepoints
AT johansebastianeslavagarzon ef1nsgaiiianevolutionaryalgorithmbasedonthefirstfronttoobtainnonnegativeandnonrepeatedextremepoints
AT rafaelpuertaramirez ef1nsgaiiianevolutionaryalgorithmbasedonthefirstfronttoobtainnonnegativeandnonrepeatedextremepoints
_version_ 1724220505578274816