A painless gradient-assisted multi-objective memetic mechanism for solving continuous bi-objective optimization problems

In this work we present a simple way to introduce gradient-based information as a means to improve the search performed by a multi-objective evolutionary algorithm (MOEA). Our proposal can be easily incorporated into any MOEA, and is able to improve its performance when solving continuous bi-objective problems. We propose a novel mechanism to control the balance between the local search, and the global search performed by a MOEA. We discuss the advantages of the proposed method and its possible use when dealing with more objectives. Finally, we provide some guidelines regarding the use of our proposed approach.

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

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

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

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

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

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

[7]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

[8]  H. Kita,et al.  Failure of Pareto-based MOEAs: does non-dominated really mean near to optimal? , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[9]  Andreas Griewank,et al.  Automatic Differentiation of Algorithms: From Simulation to Optimization , 2000, Springer New York.

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

[11]  Kay Chen Tan,et al.  An investigation on evolutionary gradient search for multi-objective optimization , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

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

[13]  Charles Gide,et al.  Cours d'économie politique , 1911 .

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

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

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

[17]  M. Dellnitz,et al.  Covering Pareto Sets by Multilevel Subdivision Techniques , 2005 .

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

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

[20]  Isao Ono,et al.  Local Search for Multiobjective Function Optimization: Pareto Descent Method , 2006 .

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

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

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

[24]  K. Schittkowski,et al.  NONLINEAR PROGRAMMING , 2022 .