A. Blot, L. Jourdan, and M. E. Kessaci-marmion, Automatic design of multi-objective local search algorithms, Proceedings of the Genetic and Evolutionary Computation Conference on , GECCO '17, pp.227-234, 2017.
DOI : 10.1109/4235.797969
URL : https://hal.archives-ouvertes.fr/hal-01569617

M. M. Drugan and D. Thierens, Path-Guided Mutation for Stochastic Pareto Local Search Algorithms, PPSN XI, pp.485-495, 2010.
DOI : 10.1007/978-3-642-15844-5_49

J. Dubois-lacoste, M. López-ibáñez, and T. Stützle, A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems, Computers & Operations Research, vol.38, issue.8, pp.1219-1236, 2011.
DOI : 10.1016/j.cor.2010.10.008

J. Dubois-lacoste, M. López-ibáñez, and T. Stützle, Improving the anytime behavior of two-phase local search, Annals of Mathematics and Artificial Intelligence, vol.3, issue.4, pp.125-154, 2011.
DOI : 10.1109/4235.797969

J. Dubois-lacoste, M. López-ibáñez, and T. Stützle, Combining Two Search Paradigms for Multi-objective Optimization: Two-Phase and Pareto Local Search, In: Hybrid Metaheuristics, vol.434, pp.97-117, 2013.
DOI : 10.1007/978-3-642-30671-6_3

J. Dubois-lacoste, M. López-ibáñez, and T. Stützle, Anytime Pareto local search, European Journal of Operational Research, vol.243, issue.2, pp.369-385, 2015.
DOI : 10.1016/j.ejor.2014.10.062

A. Liefooghe, J. Humeau, S. Mesmoudi, L. Jourdan, and E. G. Talbi, On dominancebased multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems, JOH, vol.18, issue.2, pp.317-352, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00628215

T. Lust and J. Teghem, The multiobjective multidimensional knapsack problem: a survey and a new approach, International Transactions in Operational Research, vol.7, issue.2, pp.495-520, 2012.
DOI : 10.1109/TEVC.2003.810758

L. Paquete, M. Chiarandini, and T. Stützle, Pareto Local Optimum Sets in the Biobjective Traveling Salesman Problem: An Experimental Study, Metaheuristics for Multiobjective Optimisation, LNMES, pp.177-200, 2004.
DOI : 10.1007/978-3-642-17144-4_7

L. Paquete and T. Stützle, A Two-Phase Local Search for the Biobjective Traveling Salesman Problem, EMO 2003, pp.479-493, 2003.
DOI : 10.1007/3-540-36970-8_34

L. Paquete and T. Stützle, Stochastic Local Search Algorithms for Multiobjective Combinatorial Optimization, pp.29-30, 2007.
DOI : 10.1201/9781420010749.ch29

R. Ruiz and T. Stützle, A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem, European Journal of Operational Research, vol.177, issue.3, pp.2033-2049, 2007.
DOI : 10.1016/j.ejor.2005.12.009

´. E. Taillard, Benchmarks for basic scheduling problems, European Journal of Operational Research, vol.64, issue.2, pp.278-285, 1993.
DOI : 10.1016/0377-2217(93)90182-M

Q. Zhang and H. Li, MOEA/D: A multiobjective evolutionary algorithm based on decomposition, IEEE TEC, vol.11, issue.6, pp.712-731, 2007.

E. Zitzler, L. Thiele, M. Laumanns, C. M. Fonseca, and V. Grunert-da-fonseca, Performance assessment of multiobjective optimizers: an analysis and review, IEEE Transactions on Evolutionary Computation, vol.7, issue.2, pp.117-132, 2003.
DOI : 10.1109/TEVC.2003.810758