SPEA2: Improving the strength pareto evolutionary algorithm
Eckart Zitzler, Marco Laumanns, Lothar Thiele · 2001
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
Cited by 5,008 works. doi:10.3929/ethz-a-004284029
Authors
References
- A fast and elitist multiobjective genetic algorithm: NSGA-II
- Density Estimation for Statistics and Data Analysis
- Muiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms
- Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach
- Comparison of Multiobjective Evolutionary Algorithms: Empirical Results
- A niched Pareto genetic algorithm for multiobjective optimization
- Multiple Objective Optimization with Vector Evaluated Genetic Algorithms
- A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimization: NSGA-II
- Simulated Binary Crossover for Continuous Search Space.
- Evolutionary algorithms for multiobjective optimization: methods and applications