A Study on Dominance-Based Local Search Approaches for Multiobjective Combinatorial Optimization

International audienceThe purpose of the current paper is twofold. First, a unified view of dominance-based multiobjective local search algorithms is proposed. We focus on methods based on the iterative improvement of thenondominated set by means of a neighborhood operator. Next, the effect of current solutions selection and of neighborhood exploration techniques for such purpose is studied. Experiments are conducted on a permutation flowshop scheduling problem in a two- and a three-objective variant