Abstract
The 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 the nondominated 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. © 2009 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Liefooghe, A., Mesmoudi, S., Humeau, J., Jourdan, L., & Talbi, E. G. (2009). A study on dominance-based local search approaches for multiobjective combinatorial Optimization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5752 LNCS, pp. 120–124). https://doi.org/10.1007/978-3-642-03751-1_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
