Journal
EVOLUTIONARY COMPUTATION
Volume 10, Issue 3, Pages 263-282Publisher
MIT PRESS
DOI: 10.1162/106365602760234108
Keywords
evolutionary algorithms; multiobjective optimization; convergence; preservation of diversity; epsilon-approximation; elitism; archiving
Ask authors/readers for more resources
Over the past few years, the research on evolutionary algorithms has demonstrated their niche in solving multiobjective Optimization problems, where the goal is to find a number of Pareto-optimal solutions in a single simulation run. Many studies have depicted different ways evolutionary algorithms can progress towards the Pareto-optimal set with a widely spread distribution of solutions. However, none of the multiobjective evolutionary algorithms (MOEAs) has a proof of convergence to the true Pareto-optimal solutions with a wide diversity among the solutions. In this paper, we discuss why a number of earlier MOEAs do not have such properties. Based on the concept of c-dominance, new archiving strategies are proposed that overcome this fundamental problem and provably lead to MOEAs that have both the desired convergence and distribution properties. A number of modifications to the baseline algorithm are also suggested. The concept of c-dominance introduced in this paper is practical and should make the proposed algorithms useful to researchers and practitioners alike.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available