A Memetic Algorithm for Dynamic Multiobjective Optimization

Dynamic multi-objective optimization (DMO) is one of the most challenging class of multi-objective optimization problems where the objective function(s) change over time and the optimization algorithm is required to identify the corresponding Pareto optimal solutions with minimal time lag. DMO has received very little attention in the past and none of the existing multi-objective algorithms perform too well on the set of newly proposed DMO test problems. In this chapter, we introduce a memetic algorithm (MA) to deal with such class of problems. The memetic algorithm employs an orthogonal epsilon-constrained formulation to deal with multiple objectives and a sequential quadratic programming (SQP) solver is embedded as its local search mechanism to improve the rate of convergence. The performance of the memetic algorithm is compared with an evolutionary algorithm (EA) embedded with a Sub-EA on two benchmarks FDA1 and modified FDA2. The memetic algorithm consistently outperforms the evolutionary algorithm with Sub-EA for both FDA1 and modified FDA2 for all problem sizes. A variational study on the effect of the number of SQP iterations on the behavior of MA is included to highlight the benefits offered by MA for such class of problems.

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

[2]  Günter Rudolph,et al.  Evolutionary Optimization of Dynamic Multiobjective Functions , 2006 .

[3]  Yacov Y. Haimes,et al.  Multiobjective Decision Making: Theory and Methodology , 1983 .

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

[5]  Pablo Moscato,et al.  On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms , 1989 .

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

[7]  Kalyanmoy Deb,et al.  Simulated Binary Crossover for Continuous Search Space , 1995, Complex Syst..

[8]  David Wallace,et al.  Dynamic multi-objective optimization with evolutionary algorithms: a forward-looking approach , 2006, GECCO.

[9]  Gary B. Lamont,et al.  Multiobjective evolutionary algorithm test suites , 1999, SAC '99.

[10]  Edmund K. Burke,et al.  Multimeme Algorithms for Protein Structure Prediction , 2002, PPSN.

[11]  Paolo Amato,et al.  An ALife-Inspired Evolutionary Algorithm for Dynamic Multiobjective Optimization Problems , 2005 .

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

[13]  Andy J. Keane,et al.  Meta-Lamarckian learning in memetic algorithms , 2004, IEEE Transactions on Evolutionary Computation.

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

[15]  Kalyanmoy Deb,et al.  A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimisation: NSGA-II , 2000, PPSN.