Initial Population Construction for Convergence Improvement of MOEAs

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.

[1]  Lothar Thiele,et al.  Multiobjective Optimization Using Evolutionary Algorithms - A Comparative Case Study , 1998, PPSN.

[2]  Jürgen Teich,et al.  System-Level Synthesis Using Evolutionary Algorithms , 1998, Des. Autom. Embed. Syst..

[3]  Giorgio Rizzoni,et al.  An Architecture for Exploring Large Design Spaces , 1998, AAAI/IAAI.

[4]  Xavier Gandibleux,et al.  Use of a Genetic Heritage for Solving the Assignment Problem with Two Objectives , 2003, EMO.

[5]  Krzysztof Kuchcinski,et al.  Time-energy design space exploration for multi-layer memory architectures , 2004, Proceedings Design, Automation and Test in Europe Conference and Exhibition.

[6]  Marco Laumanns,et al.  Performance assessment of multiobjective optimizers: an analysis and review , 2003, IEEE Trans. Evol. Comput..

[7]  B. Ramakrishna Rau,et al.  Fast Design Space Exploration Through Validity and Quality Filtering of Subsystem Designs , 2000 .

[8]  Kalyanmoy Deb,et al.  Multi-objective Genetic Algorithms: Problem Difficulties and Construction of Test Problems , 1999, Evolutionary Computation.

[9]  Tobias Blickle,et al.  Theory of evolutionary algorithms and application to system synthesis , 1997 .

[10]  Christian Haubelt,et al.  Accelerating design space exploration using Pareto-front arithmetics [SoC design] , 2003, Proceedings of the ASP-DAC Asia and South Pacific Design Automation Conference, 2003..

[11]  Eckart Zitzler,et al.  Evolutionary algorithms for multiobjective optimization: methods and applications , 1999 .

[12]  Gary B. Lamont,et al.  Evolutionary Algorithms for Solving Multi-Objective Problems , 2002, Genetic Algorithms and Evolutionary Computation.

[13]  Jürgen Teich,et al.  Pareto-Front Exploration with Uncertain Objectives , 2001, EMO.

[14]  Gary B. Lamont,et al.  Multiobjective evolutionary algorithms: classifications, analyses, and new innovations , 1999 .

[15]  Christian Haubelt,et al.  Accelerating design space exploration using pareto-front arithmetics , 2003, ASP-DAC '03.

[16]  Marco Laumanns,et al.  SPEA2: Improving the Strength Pareto Evolutionary Algorithm For Multiobjective Optimization , 2002 .

[17]  Gary B. Lamont,et al.  Evolutionary Algorithms for Solving Multi-Objective Problems (Genetic and Evolutionary Computation) , 2006 .

[18]  Marco Laumanns,et al.  PISA: A Platform and Programming Language Independent Interface for Search Algorithms , 2003, EMO.

[19]  Xavier Gandibleux,et al.  The Supported Solutions Used as a Genetic Information in a Population Heuristics , 2001, EMO.

[20]  Shapour Azarm,et al.  Multi-level Multi-objective Genetic Algorithm Using Entropy to Preserve Diversity , 2003, EMO.