Comparing a coevolutionary genetic algorithm for multiobjective optimization

  • Authors:
  • J. D. Lohn;W. F. Kraus;G. L. Haith

  • Affiliations:
  • Computational Sci. Div., NASA Ames Res. Center, Moffett Field, CA, USA;LIFL, Lille Univ., Villeneuve d'Ascq, France;LIFL, Lille Univ., Villeneuve d'Ascq, France

  • Venue:
  • CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present results from a study comparing a recently developed coevolutionary genetic algorithm (CGA) against a set of evolutionary algorithms using a suite of multiobjective optimization benchmarks. The CGA embodies competitive coevolution and employs a simple, straightforward target population representation and fitness calculation based on developmental theory of learning. Because of these properties, setting up the additional population is trivial making implementation no more difficult than using a standard GA. Empirical results using a suite of two-objective test functions indicate that this CGA performs well at finding solutions on convex, nonconvex, discrete, and deceptive Pareto-optimal fronts, while giving respectable results on a nonuniform optimization. On a multimodal Pareto front, the CGA yields poor coverage across the Pareto front, yet finds a solution that dominates all the solutions produced by the eight other algorithms.