Population-Based Incremental Learning for Multiobjective Optimisation

The work in this paper presents the use of population-based incremental learning (PBIL), one of the classic single-objective population-based optimisation methods, as a tool for multiobjective optimisation. The PBIL method with two different updating schemes of its probability vectors is presented. The performance of the two proposed multiobjective optimisers are measured and compared with four other established multiobjective evolutionary algorithms i.e. niched Pareto genetic algorithm, version 2 of non-dominated sorting genetic algorithm, version 2 of strength Pareto evolutionary algorithm, and Pareto archived evolution strategy. The optimisation methods are implemented to solve 8 bi-objective test problems where design variables are encoded as a binary string. The Pareto optimal solutions obtained from the various methods are compared and discussed. It can be concluded that, with the assigned test problems, the multiobjective PBIL methods are comparable to the previously developed algorithms in terms of convergence rate. The clear advantage in using PBILs is that they can provide considerably better population diversity.

[1]  Michèle Sebag,et al.  Extending Population-Based Incremental Learning to Continuous Search Spaces , 1998, PPSN.

[2]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[3]  Shumeet Baluja,et al.  A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning , 1994 .

[4]  Peter J. Fleming,et al.  Genetic Algorithms for Multiobjective Optimization: FormulationDiscussion and Generalization , 1993, ICGA.

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

[6]  Kalyanmoy Deb,et al.  Muiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms , 1994, Evolutionary Computation.

[7]  Ramana V. Grandhi,et al.  Multiobjective Optimization of Large-Scale Structures , 1993 .

[8]  Colin Fyfe.  Structured population-based incremental learning , 1998, Soft Comput..

[9]  Lothar Thiele,et al.  Comparison of Multiobjective Evolutionary Algorithms: Empirical Results , 2000, Evolutionary Computation.

[10]  Arturo Hernández Aguirre,et al.  Multiobjective Shape Optimization Using Estimation Distribution Algorithms and Correlated Information , 2005, EMO.

[11]  J. E. Cooper,et al.  Evolutionary methods for the optimisation of engineering systems , 1998 .

[12]  David W. Corne,et al.  Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy , 2000, Evolutionary Computation.

[13]  Sujin Bureerat,et al.  Performance enhancement of evolutionary search for structural topology optimisation , 2006 .

[14]  Zbigniew Michalewicz,et al.  Evolutionary Computation 2 , 2000 .

[15]  Carlos A. Coello Coello,et al.  Evolutionary Algorithms and Multiple Objective Optimization , 2003 .

[16]  Kalyanmoy Deb,et al.  Constrained Test Problems for Multi-objective Evolutionary Optimization , 2001, EMO.

[17]  A. Messac,et al.  The normalized normal constraint method for generating the Pareto frontier , 2003 .

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

[19]  Marcus Gallagher,et al.  Playing in continuous spaces: some analysis and extension of population-based incremental learning , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[20]  David E. Goldberg,et al.  A niched Pareto genetic algorithm for multiobjective optimization , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[21]  Thomas Bäck,et al.  Parallel Problem Solving from Nature — PPSN V , 1998, Lecture Notes in Computer Science.