Multi-objective Genetic Algorithms: Problem Difficulties and Construction of Test Problems
Kalyanmoy Deb · Evolutionary Computation · 1999
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 multi-objective optimization are also constructed. More importantly, these difficult test problems will enable researchers to test their algorithms for specific aspects of multi-objective optimization.
Cited by 1,451 works. doi:10.1162/evco.1999.7.3.205 Open-access PDF
Authors
References
- Genetic algorithms in search, optimization, and machine learning
- Muiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms
- Comparison of Multiobjective Evolutionary Algorithms: Empirical Results
- A niched Pareto genetic algorithm for multiobjective optimization
- Multiple Objective Optimization with Vector Evaluated Genetic Algorithms
- An Overview of Evolutionary Algorithms in Multiobjective Optimization
- Genetic algorithms with sharing for multimodal function optimization
- GENETIC ALGORITHMS FOR MULTI-OBJECTIVE OPTIMIZATION: FORMULATION, DISCUSSION, AND GENERALIZATION
- An Investigation of Niche and Species Formation in Genetic Function Optimization
- Multiple Criteria Optimization: Theory, Computation, and Application