PHC-NSGA-II: A Novel Multi-objective Memetic Algorithm for Continuous Optimization

We introduce in this paper a new multi-objective memetic algorithm. This algorithm is a result of hybridization of the NSGA-II algorithm with a new designed local search procedure that we named Pareto Hill Climbing. Verification of our novel algorithm is carried out by testing it on two sets of multi-objective test problems and comparing it to other multi-objective evolutionary algorithms (MOEAs) and other multi-criterion memetic algorithms (MMAs). Simulation results show the algorithm ability in tackling continuous multi-objective problems in terms of convergence and diversity. Our hybrid algorithm (1) outperforms pure MOEAs, (2) is competent with other gradient based MMAs, and (3) can solve non differentiable problems.

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

[2]  Hisao Ishibuchi,et al.  Multi-objective genetic local search algorithm , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[3]  Tomoharu Nakashima,et al.  A Self-Adaptive Hybrid Genetic Algorithm for Color Clustering , 2006, 2006 IEEE International Conference on Systems, Man and Cybernetics.

[4]  Gade Pandu Rangaiah,et al.  Tabu search for global optimization of continuous functions with application to phase equilibrium calculations , 2003, Comput. Chem. Eng..

[5]  Andrzej Jaszkiewicz,et al.  Genetic local search for multi-objective combinatorial optimization , 2022 .

[6]  Marco Laumanns,et al.  Performance assessment of multiobjective optimizers: an analysis and review , 2003, IEEE Trans. Evol. Comput..

[7]  Kalyanmoy Deb,et al.  Muiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms , 1994, Evolutionary Computation.

[8]  Kalyanmoy Deb,et al.  Hybridization of SBX based NSGA-II and sequential quadratic programming for solving multi-objective optimization problems , 2007, 2007 IEEE Congress on Evolutionary Computation.

[9]  Ralph E. Steuer.  Multiple criteria optimization , 1986 .

[10]  Carlos A. Coello Coello,et al.  An updated survey of GA-based multiobjective optimization techniques , 2000, CSUR.

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

[12]  Andrzej Jaszkiewicz,et al.  Do multiple-objective metaheuristics deliver on their promises? A computational experiment on the set-covering problem , 2003, IEEE Trans. Evol. Comput..

[13]  Peter Merz,et al.  Memetic algorithms for combinatorial optimization problems : fitness landscapes and effective search strategies , 2006 .

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

[15]  Ajith Abraham,et al.  Hybrid Line Search for Multiobjective Optimization , 2007, HPCC.

[16]  Thomas Stützle,et al.  Stochastic Local Search: Foundations & Applications , 2004 .

[17]  R. S. Laundy,et al.  Multiple Criteria Optimisation: Theory, Computation and Application , 1989 .

[18]  R. Stephenson.  A and V , 1962, The British journal of ophthalmology.

[19]  A. Dickson.  On Evolution , 1884, Science.

[20]  Marco Laumanns,et al.  SPEA2: Improving the strength pareto evolutionary algorithm , 2001 .

[21]  Joshua D. Knowles,et al.  M-PAES: a memetic algorithm for multiobjective optimization , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[22]  R. K. Ursem.  Multi-objective Optimization using Evolutionary Algorithms , 2009 .

[23]  Khaled Ghédira,et al.  Evolutionary multiobjective optimization of the multi-location transshipment problem , 2008, Oper. Res..

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

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

[26]  Marco Laumanns,et al.  Scalable multi-objective optimization test problems , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

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

[28]  Andrzej Jaszkiewicz,et al.  On the performance of multiple-objective genetic local search on the 0/1 knapsack problem - a comparative experiment , 2002, IEEE Trans. Evol. Comput..

[30]  Patrick Siarry,et al.  Tabu Search applied to global optimization , 2000, Eur. J. Oper. Res..

[31]  M. Raghuwanshi,et al.  Survey on multiobjective evolutionary and real coded genetic algorithms , 2004 .

[32]  Kalyanmoy Deb,et al.  A hybrid multi-objective optimization procedure using PCX based NSGA-II and sequential quadratic programming , 2007, 2007 IEEE Congress on Evolutionary Computation.

[33]  Joshua D. Knowles,et al.  ParEGO: a hybrid algorithm with on-line landscape approximation for expensive multiobjective optimization problems , 2006, IEEE Transactions on Evolutionary Computation.