Muiltiobjective optimization using nondominated sorting in genetic algorithms

  • Authors:

  • N. Srinivas;Kalyanmoy Deb

  • Affiliations:

  • Department of Mechanical Engineering Indian Institute of Technology Kanpur, UP 208 016, India;Department of Mechanical Engineering Indian Institute of Technology Kanpur, UP 208016, India deb@iitk.ernet.in

  • Venue:
  • Evolutionary Computation
  • Year:
  • 1994

Quantified Score

Hi-index 0.04

Visualization

Abstract

In trying to solve multiobjective optimization problems, many traditional methods scalarize the objective vector into a single objective. In those cases, the obtained solution is highly sensitive to the weight vector used in the scalarization process and demands that the user have knowledge about the underlying problem. Moreover, in solving multiobjective problems, designers may be interested in a set of Pareto-optimal points, instead of a single point. Since genetic algorithms (GAs) work with a population of points, it seems natural to use GAs in multiobjective optimization problems to capture a number of solutions simultaneously. Although a vector evaluated GA (VEGA) has been implemented by Schaffer and has been tried to solve a number of multiobjective problems, the algorithm seems to have bias toward some regions. In this paper, we investigate Goldberg's notion of nondominated sorting in GAs along with a niche and speciation method to find multiple Pareto-optimal points simultaneously. The proof-of-principle results obtained on three problems used by Schaffer and others suggest that the proposed method can be extended to higher dimensional and more difficult multiobjective problems. A number of suggestions for extension and application of the algorithm are also discussed.