Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy

  • Authors:

  • Joshua D. Knowles;David W. Corne

  • Affiliations:

  • School of Computer Science, Cybernetics and Electronic Engineering, University of Reading, Reading, UK;School of Computer Science, Cybernetics and Electronic Engineering, University of Reading, Reading, UK

  • Venue:
  • Evolutionary Computation
  • Year:
  • 2000

Quantified Score

Hi-index 0.02

Visualization

Abstract

We introduce a simple evolution scheme for multiobjective optimization problems, called the Pareto Archived Evolution Strategy (PAES). We argue that PAES may represent the simplest possible nontrivial algorithm capable of generating diverse solutions in the Pareto optimal set. The algorithm, in its simplest form, is a (1 + 1) evolution strategy employing local search but using a reference archive of previously found solutions in order to identify the approximate dominance ranking of the current and candidate solution vectors. (1 + 1)-PAES is intended to be a baseline approach against which more involved methods may be compared. It may also serve well in some real-world applications when local search seems superior to or competitive with population-based methods. We introduce (1 + λ) and (μ | λ) variants of PAES as extensions to the basic algorithm. Six variants of PAES are compared to variants of the Niched Pareto Genetic Algorithm and the Nondominated Sorting Genetic Algorithm over a diverse suite of six test functions. Results are analyzed and presented using techniques that reduce the attainment surfaces generated from several optimization runs into a set of univariate distributions. This allows standard statistical analysis to be carried out for comparative purposes. Our results provide strong evidence that PAES performs consistently well on a range of multiobjective optimization tasks.