New challenges for memetic algorithms on continuous multi-objective problems

This work presents the main aspects to tackle when designing memetic algorithms using gradient-based local searchers.. We address the main drawbacks and advantages of this coupling, when focusing on the efficiency of the local search stage. We conclude with some guidelines and draw further research paths in these topics.

[1]  Carlos A. Coello Coello,et al.  Seeding the initial population of a multi-objective evolutionary algorithm using gradient-based information , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[2]  Marco Laumanns,et al.  Computing Gap Free Pareto Front Approximations with Stochastic Search Algorithms , 2010, Evolutionary Computation.

[3]  Peter A. N. Bosman,et al.  Exploiting gradient information in numerical multi--objective evolutionary optimization , 2005, GECCO '05.

[4]  Carlos A. Coello Coello,et al.  Evolutionary continuation methods for optimization problems , 2009, GECCO.

[5]  Isao Ono,et al.  Uniform sampling of local pareto-optimal solution curves by pareto path following and its applications in multi-objective GA , 2007, GECCO '07.

[6]  Joshua D. Knowles,et al.  Memetic Algorithms for Multiobjective Optimization: Issues, Methods and Prospects , 2004 .

[7]  Jörg Fliege,et al.  Steepest descent methods for multicriteria optimization , 2000, Math. Methods Oper. Res..

[8]  Carlos A. Coello Coello,et al.  Using gradient-based information to deal with scalability in multi-objective evolutionary algorithms , 2009, 2009 IEEE Congress on Evolutionary Computation.

[9]  Kalyanmoy Deb,et al.  A Local Search Based Evolutionary Multi-objective Optimization Approach for Fast and Accurate Convergence , 2008, PPSN.

[10]  Martin Brown,et al.  Directed Multi-Objective Optimization , 2005, Int. J. Comput. Syst. Signals.

[11]  Hisao Ishibuchi,et al.  Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling , 2003, IEEE Trans. Evol. Comput..

[12]  Hisao Ishibuchi,et al.  Generalization of Dominance Relation-Based Replacement Rules for Memetic EMO Algorithms , 2003, GECCO.

[13]  Carlos A. Coello Coello,et al.  HCS: A New Local Search Strategy for Memetic Multiobjective Evolutionary Algorithms , 2010, IEEE Transactions on Evolutionary Computation.

[14]  S. Schäffler,et al.  Stochastic Method for the Solution of Unconstrained Vector Optimization Problems , 2002 .

[15]  Andrzej Jaszkiewicz,et al.  A Comparative Study of Multiple-Objective Metaheuristics on the Bi-Objective Set Covering Problem and the Pareto Memetic Algorithm , 2004, Ann. Oper. Res..

[16]  Nicola Beume,et al.  Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Gradient-based / Evolutionary Relay Hybrid for Computing Pareto Front Approximations Maximizing the S-Metric , 2007 .

[17]  C. Hillermeier.  Nonlinear Multiobjective Optimization: A Generalized Homotopy Approach , 2001 .

[18]  Pradyumn Kumar Shukla,et al.  On Gradient Based Local Search Methods in Unconstrained Evolutionary Multi-objective Optimization , 2007, EMO.

[19]  Xiaolin Hu,et al.  Hybridization of the multi-objective evolutionary algorithms and the gradient-based algorithms , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[20]  Pradyumn Kumar Shukla.  Gradient Based Stochastic Mutation Operators in Evolutionary Multi-objective Optimization , 2007, ICANNGA.

[21]  Shigenobu Kobayashi,et al.  Hybridization of genetic algorithm and local search in multiobjective function optimization: recommendation of GA then LS , 2006, GECCO '06.

[22]  Hisao Ishibuchi,et al.  Implementation of Simple Multiobjective Memetic Algorithms and Its Applications to Knapsack Problems , 2004, Int. J. Hybrid Intell. Syst..