Multi-objective genetic algorithms: Problem difficulties and construction of test problems

  • Authors:
  • Kalyanmoy Deb

  • Affiliations:
  • Kanpur Genetic Algorithms Laboratory (KanGAL) Department of Mechanical Engineering Indian Institute of Technology Kanpur Kanpur, PIN 208 016, India deb@iitk.ac.in

  • Venue:
  • Evolutionary Computation
  • Year:
  • 1999

Quantified Score

Hi-index 0.01

Visualization

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 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.