Multi-Objective Genetic Algorithms: Problem Difficulties and Construction of Test Problems (1999)
Cached
Download Links
- [mitpress.mit.edu]
- [www.jeo.org]
- [www.lania.mx]
- [dspace.hrz.uni-dortmund.de:8080]
- DBLP
Other Repositories/Bibliography
| Venue: | Evolutionary Computation |
| Citations: | 126 - 9 self |
BibTeX
@ARTICLE{Deb99multi-objectivegenetic,
author = {Kalyanmoy Deb},
title = {Multi-Objective Genetic Algorithms: Problem Difficulties and Construction of Test Problems},
journal = {Evolutionary Computation},
year = {1999},
volume = {7},
pages = {205--230}
}
Years of Citing Articles
OpenURL
Abstract
In this paper, we study the problem features that may cause a multi-objective genetic algorithm (GA) difficulty in converging to the true Pareto-optimal front. Identification of such features helps us develop difficult test problems for multi-objective optimization. Multi-objective test problems are constructed from single-objective optimization problems, thereby allowing known difficult features of single-objective problems (such as multi-modality, isolation, or deception) to be directly transferred to the corresponding multi-objective problem. In addition, test problems having features specific to multiobjective optimization are also constructed. More importantly, these difficult test problems will enable researchers to test their algorithms for specific aspects of multi-objective optimization. Keywords Genetic algorithms, multi-objective optimization, niching, pareto-optimality, problem difficulties, test problems. 1 Introduction After a decade since the pioneering wor...







