Memory Enhanced Dynamic Multi-Objective Evolutionary Algorithm Based on Decomposition

In addition to the need for satisfying several objectives, many real-world problems are also dynamic and require the optimization algorithm to continuously track the time-varying Pareto optimal set over time. This paper proposes a memory enhanced dynamic multi-objective evolutionary algorithm based on decomposition (denoted by dMOEAD-M). Specifically, the dMOEAD-M decomposes a dynamic multi-objective optimization problem into a number of dynamic scalar optimization subproblems and optimizes them simultaneously. An improved environment detection operator is presented. Also, a subproblem-based bunchy memory scheme, which allows evolutionary algorithm to store good solutions from old environments and reuse them as necessary, is designed to respond to the environment change. Simulation results on eight benchmark problems show that the proposed dMOEAD-M not only runs at a faster speed, more memory capabilities, and a better robustness, but is also able to find a much better spread of solutions and converge better near the

[1]  Kay Chen Tan,et al.  A predictive gradient strategy for multiobjective evolutionary algorithms in a fast changing environment , 2010, Memetic Comput..

[2]  Bin Li,et al.  Multi-strategy ensemble evolutionary algorithm for dynamic multi-objective optimization , 2010, Memetic Comput..

[3]  Peter A. N. Bosman,et al.  Evolutionary Multiobjective Optimization for Dynamic Hospital Resource Management , 2009, EMO.

[4]  Yang Dong,et al.  Research on Evolutionary Multi-Objective Optimization Algorithms , 2009 .

[5]  Kalyanmoy Deb,et al.  Dynamic multiobjective optimization problems: test cases, approximations, and applications , 2004, IEEE Transactions on Evolutionary Computation.

[6]  Il Hong Suh,et al.  Dynamic multi-objective optimization based on membrane computing for control of time-varying unstable plants , 2011, Inf. Sci..

[7]  Jürgen Branke,et al.  Evolutionary optimization in uncertain environments-a survey , 2005, IEEE Transactions on Evolutionary Computation.

[8]  Jürgen Branke,et al.  Memory enhanced evolutionary algorithms for changing optimization problems , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[9]  Xiaodong Li,et al.  On performance metrics and particle swarm methods for dynamic multiobjective optimization problems , 2007, 2007 IEEE Congress on Evolutionary Computation.

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

[11]  Qingfu Zhang,et al.  MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition , 2007, IEEE Transactions on Evolutionary Computation.

[12]  Kalyanmoy Deb,et al.  Dynamic Multi-objective Optimization and Decision-Making Using Modified NSGA-II: A Case Study on Hydro-thermal Power Scheduling , 2007, EMO.

[13]  Wang Yu-ping,et al.  Dynamic Multi-Objective Optimization Evolutionary Algorithm Based on New Model , 2008 .

[14]  Zhuhong Zhang,et al.  Multiobjective optimization immune algorithm in dynamic environments and its application to greenhouse control , 2008, Appl. Soft Comput..

[15]  Kay Chen Tan,et al.  Evolutionary artificial potential fields and their application in real time robot path planning , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[16]  P. Di Barba.  Dynamic Multiobjective Optimization: A Way to the Shape Design With Transient Magnetic Fields , 2008 .

[17]  Kay Chen Tan,et al.  A Competitive-Cooperative Coevolutionary Paradigm for Dynamic Multiobjective Optimization , 2009, IEEE Transactions on Evolutionary Computation.

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

[19]  Xin Yao,et al.  Population-Based Incremental Learning With Associative Memory for Dynamic Environments , 2008, IEEE Transactions on Evolutionary Computation.