Global Multiobjective Optimization Using Evolutionary Algorithms

  • Authors:
  • Thomas Hanne

  • Affiliations:
  • Institute for Techno- and Economathematics (ITWM), Dept. of Optimization, Gottlieb-Daimler-Str. 49, 67663 Kaiserslantern, Germany. hanne@itwm.uni-kl.de

  • Venue:
  • Journal of Heuristics
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

Since the 60s, several approaches (genetic algorithms, evolution strategies etc.) have been developed which apply evolutionary concepts for simulation and optimization purposes. Also in the area of multiobjective programming, such approaches (mainly genetic algorithms) have already been used (Evolutionary Computation 3(1), 1–16).In our presentation, we consider a generalization of common approaches like evolution strategies: a multiobjective evolutionary algorithm (MOEA) for analyzing decision problems with alternatives taken from a real-valued vector space and evaluated according to several objective functions. The algorithm is implemented within the Learning Object-Oriented Problem Solver (LOOPS) framework developed by the author. Various test problems are analyzed using the MOEA: (multiobjective) linear programming, convex programming, and global programming. Especially for ‘hard’ problems with disconnected or local efficient regions, the algorithms seems to be a useful tool.