Dynamic multiobjective evolutionary algorithm: adaptive cell-based rank and density estimation

This paper proposes a new evolutionary approach to multiobjective optimization problems - the dynamic multiobjective evolutionary algorithm (DMOEA). In DMOEA, a novel cell-based rank and density estimation strategy is proposed to efficiently compute dominance and diversity information when the population size varies dynamically. In addition, a population growing and declining strategies are designed to determine if an individual will survive or be eliminated based on some qualitative indicators. Meanwhile, an objective space compression strategy is devised to continuously refine the quality of the resulting Pareto front. By examining the selected performance metrics on three recently designed benchmark functions, DMOEA is found to be competitive with or even superior to five state-of-the-art MOEAs in terms of maintaining the diversity of the individuals along the tradeoff surface, tending to extend the Pareto front to new areas, and finding a well-approximated Pareto optimal front. Moreover, DMOEA is evaluated by using different parameter settings on the chosen test functions to verify its robustness of converging to an optimal population size, if it exists. Simulations show that DMOEA has the potential of autonomously determining the optimal population size, which is found insensitive to the initial population size chosen.

[1]  Samir W. Mahfoud Genetic drift in sharing methods , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

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

[3]  John J. Grefenstette,et al.  Optimization of Control Parameters for Genetic Algorithms , 1986, IEEE Transactions on Systems, Man, and Cybernetics.

[4]  D.A. Van Veldhuizen,et al.  On measuring multiobjective evolutionary algorithm performance , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[5]  Kalyanmoy Deb-Kanpur Multi-objective Genetic Algorithms : Problem Difficulties and Construction of Test Problems , 2001 .

[6]  Zbigniew Michalewicz,et al.  GAVaPS-a genetic algorithm with varying population size , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[7]  Peter Y. K. Cheung,et al.  Improved variable ordering of BDDs with novel genetic algorithm , 1996, 1996 IEEE International Symposium on Circuits and Systems. Circuits and Systems Connecting the World. ISCAS 96.

[8]  Martin J. Oates,et al.  The Pareto Envelope-Based Selection Algorithm for Multi-objective Optimisation , 2000, PPSN.

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

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

[11]  E. F. Khor,et al.  Evolutionary algorithms with goal and priority information for multi-objective optimization , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[12]  Marco Laumanns,et al.  Scalable multi-objective optimization test problems , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[13]  Carlos A. Coello Coello,et al.  A Micro-Genetic Algorithm for Multiobjective Optimization , 2001, EMO.

[14]  Peter J. Fleming,et al.  An Overview of Evolutionary Algorithms in Multiobjective Optimization , 1995, Evolutionary Computation.

[15]  Peter J. Fleming,et al.  Multiobjective optimization and multiple constraint handling with evolutionary algorithms. II. Application example , 1998, IEEE Trans. Syst. Man Cybern. Part A.

[16]  Lothar Thiele,et al.  Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach , 1999, IEEE Trans. Evol. Comput..

[17]  G. Yen,et al.  Rank-density based multiobjective genetic algorithm , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[18]  Melanie Mitchell,et al.  An introduction to genetic algorithms , 1996 .

[19]  Tong Heng Lee,et al.  Evolutionary algorithms with dynamic population size and local exploration for multiobjective optimization , 2001, IEEE Trans. Evol. Comput..

[20]  Marco Laumanns,et al.  SPEA2: Improving the strength pareto evolutionary algorithm , 2001 .

[21]  T. Krink,et al.  Parameter control using the agent based patchwork model , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[22]  Hao Wang,et al.  Introduction to Genetic Algorithms in Electromagnetics , 1995 .

[23]  Russell C. Eberhart,et al.  Multiobjective optimization using dynamic neighborhood particle swarm optimization , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[24]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .