Initial population construction for convergence improvement of MOEAs

  • Authors:
  • Christian Haubelt;Jürgen Gamenik;Jürgen Teich

  • Affiliations:
  • Hardware-Software-Co-Design, Department of Computer Science 12, University of Erlangen-Nuremberg, Germany;Hardware-Software-Co-Design, Department of Computer Science 12, University of Erlangen-Nuremberg, Germany;Hardware-Software-Co-Design, Department of Computer Science 12, University of Erlangen-Nuremberg, Germany

  • Venue:
  • EMO'05 Proceedings of the Third international conference on Evolutionary Multi-Criterion Optimization
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Nearly all Multi-Objective Evolutionary Algorithms (MOEA) rely on random generation of initial population. In large and complex search spaces, this random method often leads to an initial population composed of infeasible solutions only. Hence, the task of a MOEA is not only to converge towards the Pareto-optimal front but also to guide the search towards the feasible region. This paper proposes the incorporation of a novel method for constructing initial populations into existing MOEAs based on so-called Pareto-Front-Arithmetics (PFA). We will provide experimental results from the field of embedded system synthesis that show the effectiveness of our proposed methodology.