Non-Epsilon Dominated Evolutionary Algorithm for the Set of Approximate Solutions
In this paper, we present a novel evolutionary algorithm for the computation of approximate solutions for multi-objective optimization problems. These solutions are of particular interest to the decision-maker as backup solutions since they can provide solutions with similar quality but in different...
Main Authors: | Carlos Ignacio Hernández Castellanos, Oliver Schütze, Jian-Qiao Sun, Sina Ober-Blöbaum |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2020-01-01
|
Series: | Mathematical and Computational Applications |
Subjects: | |
Online Access: | https://www.mdpi.com/2297-8747/25/1/3 |
Similar Items
-
Variation Rate to Maintain Diversity in Decision Space within Multi-Objective Evolutionary Algorithms
by: Oliver Cuate, et al.
Published: (2019-09-01) -
Multi-objective evolutionary optimization of sandwich structures: An evaluation by elitist non-dominated sorting evolution strategy
by: Ilyani Akmar, A.B, et al.
Published: (2015) -
Numerical Computation of Lightly Multi-Objective Robust Optimal Solutions by Means of Generalized Cell Mapping
by: Carlos Ignacio Hernández Castellanos, et al.
Published: (2020-11-01) -
A Comparison of Archiving Strategies for Characterization of Nearly Optimal Solutions under Multi-Objective Optimization
by: Alberto Pajares, et al.
Published: (2021-04-01) -
Solution Representation Learning in Multi-Objective Transfer Evolutionary Optimization
by: Ray Lim, et al.
Published: (2021-01-01)