## The Pareto Envelope-based Selection Algorithm for Multiobjective Optimization (2000)

Venue: | Proceedings of the Parallel Problem Solving from Nature VI Conference |

Citations: | 57 - 2 self |

### BibTeX

@INPROCEEDINGS{Corne00thepareto,

author = {David W. Corne and Joshua D. Knowles and Martin J. Oates},

title = {The Pareto Envelope-based Selection Algorithm for Multiobjective Optimization},

booktitle = {Proceedings of the Parallel Problem Solving from Nature VI Conference},

year = {2000},

pages = {839--848},

publisher = {Springer}

}

### Years of Citing Articles

### OpenURL

### Abstract

. We introduce a new multiobjective evolutionary algorithm called PESA (the Pareto Envelope-based Selection Algorithm), in which selection and diversity maintenance are controlled via a simple hyper-grid based scheme. PESA's selection method is relatively unusual in comparison with current well known multiobjective evolutionary algorithms, which tend to use counts based on the degree to which solutions dominate others in the population. The diversity maintenance method is similar to that used by certain other methods. The main attraction of PESA is the integration of selection and diversity maintenance, whereby essentially the same technique is used for both tasks. The resulting algorithm is simple to describe, with full pseudocode provided here and real code available from the authors. We compare PESA with two recent strongperforming MOEAs on some multiobjective test problems recently proposed by Deb. We find that PESA emerges as the best method overall on these problems...

### Citations

498 | Multiobjective evolutionary algorithms: A comparative case study and the strength pareto approach
- Zitzler, Thiele
- 1999
(Show Context)
Citation Context ...mproved techniques which provide fast and effective approximations to the Pareto frontier for a variety of benchmark problems. These new methods include SPEA (Strength Pareto Evolutionary Algorithm --=-=Zitzler and Thiele, 1999-=-), and PAES (Pareto Archived Evolution Strategy -- Knowles and Corne, 2000). Both PAES and SPEA have been shown to outperform sophisticated versions of NPGA and NDS on a variety of benchmark problems,... |

364 | Multiobjective optimization using nondominated sorting in genetic algorithms
- Srinivas, Deb
- 1994
(Show Context)
Citation Context ...lowing seminal work on multiobjective evolutionary algorithms (MOEAs) such as the Niched Pareto Genetic Algorithm (Horn et al., 1994; Horn and Nafpliotis, 1994), and the Non-Dominated Sorting method (=-=Srinivas and Deb, 1994-=-), more recent work on MOEAs has resulted in improved techniques which provide fast and effective approximations to the Pareto frontier for a variety of benchmark problems. These new methods include S... |

361 | An Overview of Evolutionary Algorithms in Multi-Objective Optimization. Evolutionary Computation
- Fonseca, Fleming
- 1995
(Show Context)
Citation Context ...n to outperform sophisticated versions of NPGA and NDS on a variety of benchmark problems, while various other modern MOEAs exist which have been shown to perform well on particular applications (eg: =-=Fonseca and Fleming, 1995-=-; Parks and Miller, 1998), but have not yet been systematically compared against other modern MOEAs on a common set of test problems. Somewhat removed from the MOEA research community, researchers in ... |

279 | A niched pareto genetic algorithm for multiobjective optimization
- Horn, Nafpliotis, et al.
- 1994
(Show Context)
Citation Context ...nd that PESA emerges as the best method overall on these problems. 1 Introduction Following seminal work on multiobjective evolutionary algorithms (MOEAs) such as the Niched Pareto Genetic Algorithm (=-=Horn et al., 1994-=-; Horn and Nafpliotis, 1994), and the Non-Dominated Sorting method (Srinivas and Deb, 1994), more recent work on MOEAs has resulted in improved techniques which provide fast and effective approximatio... |

236 | Approximarting the nondominated front using the pareto archived evolution strategy
- Knowles, Corne
- 2000
(Show Context)
Citation Context ...areto frontier for a variety of benchmark problems. These new methods include SPEA (Strength Pareto Evolutionary Algorithm --Zitzler and Thiele, 1999), and PAES (Pareto Archived Evolution Strategy -- =-=Knowles and Corne, 2000-=-). Both PAES and SPEA have been shown to outperform sophisticated versions of NPGA and NDS on a variety of benchmark problems, while various other modern MOEAs exist which have been shown to perform w... |

152 | Multi-Objective Genetic Algorithms: Problem Difficulties and Construction of Test Problems - Deb - 1999 |

111 | Multiobjetive optimization using the niched pareto genetic algorithm
- Horn, Nafpliotis
- 1993
(Show Context)
Citation Context ...s as the best method overall on these problems. 1 Introduction Following seminal work on multiobjective evolutionary algorithms (MOEAs) such as the Niched Pareto Genetic Algorithm (Horn et al., 1994; =-=Horn and Nafpliotis, 1994-=-), and the Non-Dominated Sorting method (Srinivas and Deb, 1994), more recent work on MOEAs has resulted in improved techniques which provide fast and effective approximations to the Pareto frontier f... |

81 | On the performance assessment and comparison of stochastic multiobjective optimizers
- Fonseca, Fleming
- 1996
(Show Context)
Citation Context ...n to outperform sophisticated versions of NPGA and NDS on a variety of benchmark problems, while various other modern MOEAs exist which have been shown to perform well on particular applications (eg: =-=Fonseca and Fleming, 1995-=-; Parks and Miller, 1998), but have not yet been systematically compared against other modern MOEAs on a common set of test problems. Somewhat removed from the MOEA research community, researchers in ... |

57 | Pareto Simulated Annealing - A Metaheuristic Technique for Multiple Objective - Czyzak, Jaszkiewicz - 1998 |

31 |
Selective breeding in a multiobjective genetic algorithm
- Parks, Miller
- 1998
(Show Context)
Citation Context ...ed versions of NPGA and NDS on a variety of benchmark problems, while various other modern MOEAs exist which have been shown to perform well on particular applications (eg: Fonseca and Fleming, 1995; =-=Parks and Miller, 1998-=-), but have not yet been systematically compared against other modern MOEAs on a common set of test problems. Somewhat removed from the MOEA research community, researchers in multiple criteria decisi... |

26 | A Tabu Search Procedure to solve Multiobjective Combinatorial Optimization - Gandibleux, Mezdaoui, et al. - 1997 |

10 | Tabu Search for Multiobjective Optimization - Hansen - 1997 |

4 | Generating a Diversity of Good Solutions to a Practical Combinatorial Problem using Vectorized Simulated Annealing. Submitted to Control and Cybernetics - Hansen - 1997 |

2 |
Local Search, Multiobjective Optimisation and the Pareto Archived Evolution Strategy
- Knowles, Corne
- 1999
(Show Context)
Citation Context ...isticated statistical comparison method based on ideas from Fonseca and Fleming (1995a). Both SPEA and PESA have already been found to outperform NDS and NPGA on these functions (Zitzler et al, 1999; =-=Knowles and Corne, 1999-=-). We find that each algorithm turns out to be the winner on at least one of the test functions, but PESA is the overall best performer. The remainder of the paper is organized as follows. In Section ... |