An evolutionary algorithm for dynamic multi-objective optimization

In this paper, the dynamic multi-objective optimization problem (DMOP) is first approximated by a series of static multi-objective optimization problems (SMOPs) by dividing the time period into several equal subperiods. In each subperiod, the dynamic multi-objective optimization problem is seen as a static multi-objective optimization problem by taking the time parameter fixed. Then, to decrease the amount of computation and efficiently solve the static problems, each static multi-objective optimization problem is transformed into a two-objective optimization problem based on two re-defined objectives. Finally, a new crossover operator and mutation operator adapting to the environment changing are designed. Based on these techniques, a new evolutionary algorithm is proposed. The simulation results indicate that the proposed algorithm can effectively track the varying Pareto fronts with time.

[1]  Terence C. Fogarty,et al.  Learning the local search range for genetic optimisation in nonstationary environments , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

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

[3]  Guojun Lu,et al.  DAFHEA: a dynamic approximate fitness-based hybrid EA for optimisation problems , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

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

[5]  Helen G. Cobb,et al.  An Investigation into the Use of Hypermutation as an Adaptive Operator in Genetic Algorithms Having Continuous, Time-Dependent Nonstationary Environments , 1990 .

[6]  Zafer Bingul,et al.  Adaptive genetic algorithms applied to dynamic multiobjective problems , 2007, Appl. Soft Comput..

[7]  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).

[8]  Yiu-Wing Leung,et al.  An effective uniform genetic algorithm for hard optimization problems , 2000, Proceedings of the 3rd World Congress on Intelligent Control and Automation (Cat. No.00EX393).

[9]  Kalyanmoy Deb,et al.  Searching for Robust Pareto-Optimal Solutions in Multi-objective Optimization , 2005, EMO.

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

[11]  Yuping Wang,et al.  U-measure: a quality measure for multiobjective programming , 2003, IEEE Trans. Syst. Man Cybern. Part A.

[12]  Shapour Azarm,et al.  A multi-objective genetic algorithm for robust design optimization , 2005, GECCO '05.

[13]  王元,et al.  NUMBER THEORETIC METHOD IN APPLIED STATISTICS , 1990 .

[14]  H. Beyer.  Evolutionary algorithms in noisy environments : theoretical issues and guidelines for practice , 2000 .

[15]  Lance D. Chambers.  Practical handbook of genetic algorithms , 1995 .

[16]  Bernhard Sendhoff,et al.  Constructing Dynamic Optimization Test Problems Using the Multi-objective Optimization Concept , 2004, EvoWorkshops.

[17]  D. Dasgupta.  Incorporating Redundancy and Gene Activation Mechanisms in Genetic search for adapting to Non-Stationarv Environments. , 2019, Practical Handbook of Genetic Algorithms.

[18]  S. Tsutsui,et al.  Function optimization in nonstationary environment using steady state genetic algorithms with aging of individuals , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[19]  Jürgen Branke,et al.  Faster convergence by means of fitness estimation , 2005, Soft Comput..

[20]  Jürgen Branke,et al.  Evolutionary Optimization in Dynamic Environments , 2001, Genetic Algorithms and Evolutionary Computation.

[21]  Hajime Kita,et al.  Adaptation to Changing Environments by Means of the Memory Based Thermodynamical Genetic Algorithm , 1997, ICGA.

[22]  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.

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