Laumanns, Marco ; Thiele, Lothar ; Deb, Kalyanmoy ; Zitzler, Eckart (2002) Combining convergence and diversity in evolutionary multiobjective optimization Evolutionary Computation, 10 (3). pp. 263-282. ISSN 1063-6560
![]()
|
PDF
- Publisher Version
202kB |
Official URL: http://www.mitpressjournals.org/doi/abs/10.1162/10...
Related URL: http://dx.doi.org/10.1162/106365602760234108
Abstract
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 ε -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 ε -dominance introduced in this paper is practical and should make the proposed algorithms useful to researchers and practitioners alike.
Item Type: | Article |
---|---|
Source: | Copyright of this article belongs to MIT Press. |
ID Code: | 9413 |
Deposited On: | 02 Nov 2010 12:15 |
Last Modified: | 16 May 2016 19:13 |
Repository Staff Only: item control page