Download:
by Eckart Zitzler, Marco Laumanns, Lothar Thiele
ftp://ftp.tik.ee.ethz.ch/pub/people/laumanns/ZLT2001a.pdf
Add To MetaCart
Abstract:
The Strength Pareto Evolutionary Algorithm (SPEA) (Zitzler and Thiele 1999) is a relatively recent technique for finding or approximating the Pareto-optimal set for multiobjective optimization problems. In different studies (Zitzler and Thiele 1999; Zitzler, Deb, and Thiele 2000) SPEA has shown very good performance in comparison to other multiobjective evolutionary algorithms, and therefore it has been a point of reference in various recent investigations, e.g., (Corne, Knowles, and Oates 2000). Furthermore, it has been used in different applications, e.g., (Lahanas, Milickovic, Baltas, and Zamboglou 2001). In this paper, an improved version, namely SPEA2, is proposed, which incorporates in contrast to its predecessor a fine-grained fitness assignment strategy, a density estimation technique, and an enhanced archive truncation method. The comparison of SPEA2 with SPEA and two other modern elitist methods, PESA and NSGA-II, on different test problems yields promising results. 1
Citations
|
938
|
Density Estimation for Statistics and Data Analysis
– Silverman
- 1986
|
|
323
|
Genetic algorithms for multi-objective optimization: Formulation, discussion and generalization
– Fonseca, Fleming
- 1993
|
|
246
|
Multiple objective optimization with vector evaluated genetic algorithms
– Schaffer
- 1985
|
|
235
|
1993�. Multiobjective Optimization Using Nondominated Sorting in Genetic Algorithms
– Srinivas�, Deb
|
|
224
|
Thiele (2000) Comparison of Multiobjective Evolutionary Algorithms: Empirical Results. Evolutionary Computation 8(2): 173-195
– Zitzler, Deb, et al.
- 2001
|
|
208
|
A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II
– Pratab, Deb, et al.
- 2000
|
|
205
|
A niched Pareto genetic algorithm for multiobjective optimization: Evolutionary Computation
– Horn, J, et al.
- 1994
|
|
186
|
An evolutionary algorithm for multi-objective optimization: The strength Pareto approach
– Zitzler, Thiele
- 1998
|
|
87
|
The Pareto Archived Evolution Strategy: A new baseline algorithm for Pareto multiobjective optimisation
– Knowles, Corne
- 1999
|
|
79
|
A variant of evolution strategies for vector optimization
– Kursawe
- 1991
|
|
77
|
Simulated binary crossover for continuous search space
– Deb, Agrawal
- 1995
|
|
59
|
Multiobjective evolutionary algorithms: analyzing the state-of-theart
– Veldhuizen, Lamont
- 2000
|
|
53
|
On a multi-objective evolutionary algorithm and its convergence to the pareto set
– Rudolph
- 1998
|
|
38
|
The Pareto Envelope-based Selection Algorithm for Multiobjective Optimization
– Corne, Knowles, et al.
- 2000
|
|
36
|
Selective breeding in a multiobjective genetic algorithm
– Parks, Miller
- 1998
|
|
28
|
A unified model for multi-objective evolutionary algorithms with elitism
– Laumanns, Zitzler, et al.
- 2000
|
|
20
|
On the effects of archiving, elitism, and density based selection in evolutionary multi-objective optimization
– Laumanns, Zitzler, et al.
- 2001
|
|
18
|
Multiobjective genetic programming: reducing bloat using spea2
– Bleuler
- 2001
|
|
15
|
Mutation control and convergence in evolutionary multi-objective optimization
– Laumanns, Rudolph, et al.
- 2001
|
|
14
|
On the performance of multiple objective genetic local search on the 0/1 knapsack problem. a comparative experiment
– Jaszkiewicz
- 2000
|
|
12
|
A multiobjective evolutionary algorithm for solving vehicle routing problem with time windows
– Tan, Lee, et al.
|
|
7
|
Coupling genetic algorithms and gradient based optimization techniques
– Quagliarella, Vicini
- 1997
|
|
2
|
Application of multiobjective evolutionary algorithms for dose optimization problems in brachytherapy
– Lahanas, Milickovic, et al.
- 2001
|
