Obtaining Smoothly Navigable Approximation Sets in Bi-Objective Multi-Modal Optimization
Abstract
Even if a Multi-modal Multi-Objective Evolutionary Algorithm (MMOEA) is designed to find solutions well spread over all locally optimal approximation sets of a Multi-modal Multi-objective Optimization Problem (MMOP), there is a risk that the found set of solutions is not smoothly navigable because the solutions belong to various niches, reducing the insight for decision makers. To tackle this issue, a new MMOEAs is proposed: the Multi-Modal Bézier Evolutionary Algorithm (MM-BezEA), which produces approximation sets that cover individual niches and exhibit inherent decision-space smoothness as they are parameterized by Bézier curves. MM-BezEA combines the concepts behind the recently introduced BezEA and MO-HillVallEA to find all locally optimal approximation sets. When benchmarked against the MMOEAs MO_Ring_PSO_SCD and MO-HillVallEA on MMOPs with linear Pareto sets, MM-BezEA was found to perform best in terms of best hypervolume.
Authors 5
-
Centrum Wiskunde & Informatica · Delft University of Technology
Affiliation as printed
Centrum Wiskunde & Informatica , Amsterdam , The Netherlands
Delft University of Technology , Delft , The Netherlands
-
Centrum Wiskunde & Informatica
Affiliation as printed
Centrum Wiskunde & Informatica , Amsterdam , The Netherlands
-
Leah R. M. Dickhoff Aachen
Leiden University Medical Center
Affiliation as printed
Leiden University Medical Center , Leiden , The Netherlands
-
Tanja Alderliesten Aachen
Leiden University Medical Center
Affiliation as printed
Leiden University Medical Center , Leiden , The Netherlands
-
Centrum Wiskunde & Informatica · Delft University of Technology
Affiliation as printed
Centrum Wiskunde & Informatica , Amsterdam , The Netherlands
Delft University of Technology , Delft , The Netherlands
Cited by 0 stored of 0
No patents citing this paper on Lens.org (checked 2026-10-11).