Multi-objective Local Search Based on Decomposition

It is generally believed that Local search (Ls) should be used as a basic tool in multi-objective evolutionary computation for combinatorial optimization. However, not much effort has been made to investigate how to efficiently use Ls in multi-objective evolutionary computation algorithms. In this paper, we study some issues in the use of cooperative scalarizing local search approaches for decomposition-based multi-objective combinatorial optimization. We propose and study multiple move strategies in the Moea/d framework. By extensive experiments on a new set of bi-objective traveling salesman problems with tunable correlated objectives, we analyze these policies with different Moea/d parameters. Our empirical study has shed some insights about the impact of the Ls move strategy on the anytime performance of the algorithm.

[1]  Qingfu Zhang,et al.  MOEA/D for flowshop scheduling problems , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[2]  Thomas Stützle,et al.  Design and analysis of stochastic local search for the multiobjective traveling salesman problem , 2009, Comput. Oper. Res..

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

[4]  El-Ghazali Talbi,et al.  On dominance-based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems , 2012, J. Heuristics.

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

[6]  Jacques Teghem,et al.  Two-phase Pareto local search for the biobjective traveling salesman problem , 2010, J. Heuristics.

[7]  Qingfu Zhang,et al.  Multiobjective Optimization Problems With Complicated Pareto Sets, MOEA/D and NSGA-II , 2009, IEEE Transactions on Evolutionary Computation.

[8]  Qingfu Zhang,et al.  Hybridization of Decomposition and Local Search for Multiobjective Optimization , 2014, IEEE Transactions on Cybernetics.

[9]  Bilel Derbel,et al.  On Maintaining Diversity in MOEA/D: Application to a Biobjective Combinatorial FJSP , 2015, GECCO.

[11]  Hisao Ishibuchi,et al.  A multi-objective genetic local search algorithm and its application to flowshop scheduling , 1998, IEEE Trans. Syst. Man Cybern. Part C.

[12]  Qingfu Zhang,et al.  MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition , 2007, IEEE Transactions on Evolutionary Computation.

[13]  Lothar Thiele,et al.  A Tutorial on the Performance Assessment of Stochastic Multiobjective Optimizers , 2006 .

[14]  Sébastien Vérel,et al.  On the structure of multiobjective combinatorial search space: MNK-landscapes with correlated objectives , 2013, Eur. J. Oper. Res..

[15]  Qingfu Zhang,et al.  MOEA/D-ACO: A Multiobjective Evolutionary Algorithm Using Decomposition and AntColony , 2013, IEEE Transactions on Cybernetics.