A. Hoos, H. H. Jourdan, L. Kessaci-marmion, M. Trautmann, and H. , MO-ParamILS: A multi-objective automatic algorithm configuration framework, The following papers have been, in chronological order, submitted, accepted, and have or will be presented in international conferences during this thesis: ? Blot, vol.10079, pp.32-47, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01370392

A. Blot, A. Pernet, L. Jourdan, M. Kessaci-marmion, H. H. Hoos et al., Automatically configuring multi-objective local search using multi-objective optimisation, Evolutionary MultiCriterion Optimization-9th International Conference, EMO 2017. Proceedings, vol.10173, pp.586-588, 2017.
DOI : 10.1007/978-3-319-54157-0_5
URL : https://hal.archives-ouvertes.fr/hal-01559690

A. Blot, L. Jourdan, and M. Kessaci-marmion, Automatic design of multi-objective local search algorithms: case study on a bi-objective permutation flowshop scheduling problem, Genetic and Evolutionary Computation Conference, GECCO 2017. Proceedings, pp.227-234, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01569617

A. Blot, M. Kessaci, J. , and L. , Survey and unification of local search techniques in metaheuristics for multi-objective combinatorial optimisation, Journal of Heuristics, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01840111

A. Blot, M. Kessaci, L. Jourdan, and P. D. Causmaecker, Adaptive multi-objective local search algorithms for the permutation flowshop scheduling problem, Learning and Intelligent Optimization-12th International Conference, LION 12. Revised Selected Papers, 2018.
DOI : 10.1007/978-3-030-05348-2_22
URL : https://hal.archives-ouvertes.fr/hal-01868401

A. Publications-?-blot, M. López-ibáñez, M. Kessaci, J. , L. Auger et al., New initialisation techniques for multi-objective local search application on the biobjective permutation flowshop, Parallel Problem Solving from Nature-15th International Conference, PPSN XV. Proceedings, Part I, vol.11101, 2018.

A. Blot, H. H. Hoos, M. Kessaci, J. , and L. , Automatic configuration of multi-objective optimization algorithms. impact of correlation between objectives, 30th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2018, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01928060

C. Pageau, A. Blot, M. Kessaci-marmion, L. Jourdan, and H. H. Hoos, Additionally, the following papers also have been submitted to international journals and conferences, and are either currently under review or revision

A. Blot, M. Kessaci-marmion, L. Jourdan, and H. H. Hoos, Automatic configuration of multi-objective local search algorithms for permutation problems
URL : https://hal.archives-ouvertes.fr/hal-01927901

M. Abbasi, L. Paquete, and F. B. Pereira, Local search for multiobjective multiple sequence alignment, Bioinformatics and Biomedical Engineering-Third International Conference, IWBBIO 2015. Proceedings, Part II, vol.9044, p.43, 2015.
DOI : 10.1007/978-3-319-16480-9_18

B. Adenso-díaz and M. Laguna, Fine-tuning of algorithms using fractional experimental designs and local search, Operations Research, vol.54, issue.1, p.29, 2006.

H. E. Aguirre and K. Tanaka, Random bit climbers on multiobjective mnklandscapes: Effects of memory and population climbing, IEICE Transactions, vol.50, issue.1, p.61, 2005.

A. Aleti and I. Moser, Predictive parameter control, p.155, 2011.

A. Aleti and I. Moser, Entropy-based adaptive range parameter control for evolutionary algorithms, Genetic and Evolutionary Computation Conference, GECCO 2013. Proceedings, p.155, 2013.
DOI : 10.1145/2463372.2463560

A. Aleti and I. Moser, A systematic literature review of adaptive parameter control methods for evolutionary algorithms, ACM Computing Surveys, vol.49, issue.3, 2016.

A. Aleti, I. Moser, I. Meedeniya, G. , and L. , Choosing the appropriate forecasting model for predictive parameter control, Evolutionary Computation, vol.22, issue.2, p.155, 2014.

A. Aleti, I. Moser, and S. Mostaghim, Adaptive range parameter control, IEEE Congress on Evolutionary Computation, CEC 2012. Proceedings, p.155, 2012.
DOI : 10.1109/cec.2012.6256567

R. Amadini, M. Gabbrielli, M. , and J. , SUNNY: a lazy portfolio approach for constraint solving, Theory and Practice of Logic Programming, vol.14, issue.45, pp.27-76, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01088489

E. Angel, E. Bampis, G. , and L. , Approximating the Pareto curve with local search for the bicriteria TSP(1, 2) problem, Theoretical Computer Science, vol.310, issue.1-3, p.61, 2004.

C. Ansótegui, Y. Malitsky, H. Samulowitz, M. Sellmann, T. et al., , 2015.

, Model-based genetic algorithms for algorithm configuration, Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015. Proceedings, p.29

C. Ansótegui, M. Sellmann, T. , and K. , A gender-based genetic algorithm for the automatic configuration of algorithms, Principles and Practice of Constraint Programming-15th International Conference, vol.5732, p.29, 2009.

J. E. Arroyo, S. Ottoni, R. De-paiva, and A. Oliveira, Multiobjective variable neighborhood search algorithms for a single machine scheduling problem with distinct due windows, Electronic Notes in Theoretical Computer Science, vol.281, p.45, 2011.
DOI : 10.1016/j.entcs.2011.11.022
URL : https://doi.org/10.1016/j.entcs.2011.11.022

P. Auer, N. Cesa-bianchi, and P. Fischer, Finite-time analysis of the multiarmed bandit problem, Machine Learning, vol.47, p.154, 2002.

P. Balaprakash, M. Birattari, T. ;. Stützle, M. J. Aguilera, C. Blum et al., Improvement strategies for the F-Race algorithm: Sampling design and iterative refinement, Hybrid Metaheuristics-4th International Workshop, HM 2007. Proceedings, vol.4771, p.28, 2007.

S. Bandyopadhyay, S. Saha, U. Maulik, D. , and K. , A simulated annealing-based multiobjective optimization algorithm: AMOSA, IEEE Transactions on Evolutionary Computation, vol.12, issue.3, p.44, 2008.
DOI : 10.1109/tevc.2007.900837
URL : http://www.isical.ac.in/~sriparna_r/amosa_final_indraft_twoc.pdf

T. Bartz-beielstein, J. Branke, B. Filipic, and J. Smith, Parallel Problem Solving from Nature, 13th International Conference, PPSN XIII. Proceedings, vol.8672, 2014.

T. Bartz-beielstein, C. Lasarczyk, and M. Preuss, Sequential parameter optimization, IEEE Congress on Evolutionary Computation, CEC 2005. Proceedings, p.29, 2005.

T. Bartz-beielstein and S. Markon, Tuning search algorithms for real-world applications: a regression tree based approach, IEEE Congress on Evolutionary Computation, CEC 2004. Proceedings, p.29, 2004.

M. Basseur and E. K. Burke, Indicator-based multi-objective local search, IEEE Congress on Evolutionary Computation, CEC 2007. Proceedings, vol.43, p.61, 2007.
DOI : 10.1109/cec.2007.4424867
URL : https://hal.archives-ouvertes.fr/hal-00609252

M. Basseur, R. Zeng, and J. Hao, Hypervolume-based multi-objective local search, Neural Computing and Applications, vol.21, issue.8, p.48, 2012.
DOI : 10.1007/s00521-011-0588-4

R. Battiti, M. Brunato, and F. Mascia, Reactive Search and Intelligent Optimization, 2008.
DOI : 10.1007/978-0-387-09624-7
URL : http://eprints.biblio.unitn.it/1242/1/DIT%2D07%2D049.pdf

A. Baykasoglu, S. Owen, G. , and N. , A taboo search based approach to find the Pareto optimal set in multiple objective optimization. Engineering Optimization, vol.31, p.44, 1999.

R. P. Beausoleil, Multiple criteria scatter search, 4th Metaheuristics International Conference, p.44, 2001.
DOI : 10.15517/rmta.v11i1.235
URL : https://revistas.ucr.ac.cr/index.php/matematica/article/download/235/215

J. Belluz, M. Gaudesi, G. Squillero, T. , and A. P. , Operator selection using improved dynamic multi-armed bandit, p.154, 2015.
DOI : 10.1145/2739480.2754712
URL : https://hal.archives-ouvertes.fr/hal-01536526

J. Bergstra and Y. Bengio, Random search for hyper-parameter optimization, Journal of Machine Learning Research, vol.13, p.28, 2012.

L. C. Bezerra, M. López-ibáñez, and T. Stützle, Automatic design of evolutionary algorithms for multi-objective combinatorial optimization, p.19, 2014.
DOI : 10.1007/978-3-319-10762-2_50
URL : http://iridia.ulb.ac.be/IridiaTrSeries/link/IridiaTr2014-011.pdf

A. Biedenkapp, M. T. Lindauer, K. Eggensperger, F. Hutter, C. Fawcett et al., Efficient parameter importance analysis via ablation with surrogates, Thirty-First AAAI Conference on Artificial Intelligence. Proceedings, p.146, 2017.

M. Birattari, T. Stützle, L. Paquete, K. Varrentrapp, W. B. Langdon et al., A racing algorithm for configuring metaheuristics, Genetic and Evolutionary Computation Conference, GECCO 2002. Proceedings, p.28, 2002.

A. Blot, H. E. Aguirre, C. Dhaenens, L. Jourdan, M. Marmion et al., Neutral but a winner! How neutrality helps multiobjective local search algorithms, Evolutionary Multi-Criterion Optimization-8th International Conference, EMO 2015. Proceedings, Part I, vol.9018, pp.34-47, 2015.
DOI : 10.1007/978-3-319-15934-8_3
URL : https://hal.archives-ouvertes.fr/hal-01216485

A. Blot, H. H. Hoos, L. Jourdan, M. Kessaci-marmion, and H. Trautmann, MO-ParamILS: A multi-objective automatic algorithm configuration framework, vol.87, p.32, 2016.
DOI : 10.1007/978-3-319-50349-3_3
URL : https://hal.archives-ouvertes.fr/hal-01370392

A. Blot, H. H. Hoos, M. Kessaci, J. , and L. , Automatic configuration of multi-objective optimization algorithms. impact of correlation between objectives, 30th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2018, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01928060

A. Blot, L. Jourdan, and M. Kessaci-marmion, Automatic design of multiobjective local search algorithms: case study on a bi-objective permutation flowshop scheduling problem, Bosman (2017), pp.227-234, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01569617

A. Blot, M. Kessaci, J. , and L. , Survey and unification of local search techniques in metaheuristics for multi-objective combinatorial optimisation, Journal of Heuristics, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01840111

A. Blot, M. Kessaci, L. Jourdan, and P. D. Causmaecker, Adaptive multiobjective local search algorithms for the permutation flowshop scheduling problem, Learning and Intelligent Optimization-12th International Conference, LION 12, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01868401

A. Blot, M. Kessaci-marmion, J. , and L. , AMH: a new framework to design adaptive metaheuristics, 12th Metaheuristics International Conference, MIC 2017. Proceedings. (citations on pages 64 and 185, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01559687

A. Blot, M. López-ibáñez, M. Kessaci, J. , L. Auger et al., Archive-aware scalarisation-based multi-objective local search for a bi-objective permutation flowshop problem, Parallel Problem Solving from Nature-15th International Conference, PPSN XV. Proceedings, Part I, vol.11101, p.186, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01868414

A. Blot, A. Pernet, L. Jourdan, M. Kessaci-marmion, and H. H. Hoos, Automatically configuring multi-objective local search using multi-objective optimisation, pp.61-76, 2017.
DOI : 10.1007/978-3-319-54157-0_5
URL : https://hal.archives-ouvertes.fr/hal-01559690

P. A. Bosman, Genetic and Evolutionary Computation Conference, GECCO 2017. Proceedings. ACM. (citations on pages 190 and 192, 2017.

E. K. Burke, M. Gendreau, M. R. Hyde, G. Kendall, G. Ochoa et al., Hyper-heuristics: a survey of the state of the art, Journal of the Operational Research Society, vol.64, issue.12, p.30, 2013.

E. K. Burke, M. Hyde, G. Kendall, G. Ochoa, E. Özcan et al., A classification of hyper-heuristic approaches, Gendreau and Potvin, pp.449-468, 2010.
DOI : 10.1007/978-1-4419-1665-5_15
URL : http://www.cs.nott.ac.uk/~ekb/Publications/Class-HH.pdf

N. Cesa-bianchi and P. Fischer, Finite-time regret bounds for the multiarmed bandit problem, Fifteenth International Conference on Machine Learning, ICML 1998. Proceedings, p.153, 1998.

, Learning and Intelligent Optimization-5th International Conference, LION 5. Selected Papers, Lecture Notes in Computer Science. Springer, vol.6683, 2011.

C. A. Coello and N. C. Cortés, Solving multiobjective optimization problems using an artificial immune system. Genetic Programming and Evolvable Machines, vol.6, p.15, 2005.

C. A. Coello, G. B. Lamont, and D. A. Van-veldhuizen, Evolutionary algorithms for solving multi-objective problems, p.13, 2007.

L. D. Costa, Á. Fialho, M. Schoenauer, and M. Sebag, Adaptive operator selection with dynamic multi-armed bandits, Genetic and Evolutionary Computation Conference, pp.30-154, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00278542

P. I. Cowling, G. Kendall, and E. Soubeiga, A hyperheuristic approach to scheduling a sales summit, Practice and Theory of Automated Timetabling III-Third International Conference, PATAT 2000. Selected Papers, vol.2079, p.30, 2000.

P. Czyzak and A. Jaszkiewicz, A multiobjective metaheuristic approach to the location of petrol stations by the capital budgeting model, Control and Cybernetics, vol.25, pp.177-187, 1996.

P. Czyzak and A. Jaszkiewicz, Pareto simulated annealing-a metaheuristic technique for multiple-objective combinatorial optimization, Journal of MultiCriteria Decision Analysis, vol.7, issue.1, pp.44-53, 1998.

N. Dang, L. P. Cáceres, P. D. Causmaecker, and T. Stützle, Configuring irace using surrogate configuration benchmarks, p.145, 2017.

K. Deb, Multi-objective optimization using evolutionary algorithms, pp.13-56, 2001.

K. Deb, S. Agrawal, A. Pratap, T. ;. Meyarivan, K. Deb et al., A fast elitist nondominated sorting genetic algorithm for multi-objective optimisation: NSGA-II, 2000.

P. Conference and . Vi, Lecture Notes in Computer Science, vol.1917, p.13

K. Deb, S. Agrawal, A. Pratap, and T. Meyarivan, A fast and elitist multiobjective genetic algorithm: NSGA-II, IEEE Transactions on Evolutionary Computation, vol.6, issue.2, pp.182-197, 2002.

G. Di-tollo, F. Lardeux, J. Maturana, and F. Saubion, An experimental study of adaptive control for evolutionary algorithms, Applied Soft Computing, vol.35, pp.359-372, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01392219

B. Doerr and C. Doerr, Optimal parameter choices through self-adjustment: Applying the 1/5-th rule in discrete settings, p.29, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01272868

M. Dorigo, V. Maniezzo, C. , and A. , Ant system: optimization by a colony of cooperating agents, IEEE Transactions on Systems, Man, and Cybernetics, vol.26, issue.1, p.13, 1996.

M. M. Drugan and A. Nowé, Designing multi-objective multi-armed bandits algorithms: A study, International Joint Conference on Neural Networks, IJCNN 2013, p.154, 2013.

M. M. Drugan, D. Thierens, R. Schaefer, C. Cotta, J. Kolodziej et al., Path-guided mutation for stochastic Pareto local search algorithms, Parallel Problem Solving from Nature-11th International Conference, PPSN XI. Proceedings, Part I, vol.6238, p.59, 2010.

M. M. Drugan and D. Thierens, Stochastic Pareto local search: Pareto neighbourhood exploration and perturbation strategies, Journal of Heuristics, vol.18, issue.5, pp.727-766, 2012.

J. Dubois-lacoste, M. López-ibáñez, and T. Stützle, Automatic configuration of state-of-the-art multi-objective optimizers using the TP+PLS framework, p.32, 2011.

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.

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.61, issue.2, p.19, 2011.

J. Dubois-lacoste, M. López-ibáñez, and T. Stützle, Pareto local search algorithms for anytime bi-objective optimization, Evolutionary Computation in Combinatorial Optimization-12th European Conference, vol.7245, pp.49-56, 2012.

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.

A. E. Eiben, R. Hinterding, and Z. Michalewicz, Parameter control in evolutionary algorithms, IEEE Transactions on Evolutionary Computation, vol.3, issue.2, pp.124-141, 1999.
URL : https://hal.archives-ouvertes.fr/inria-00140549

A. E. Eiben, M. Horváth, W. Kowalczyk, M. C. Schut, S. Brueckner et al., Engineering Self-Organising Systems-4th International Workshop, ESOA 2006. Revised and Invited Papers, Lecture Notes in Computer Science, vol.4335, p.155, 2006.

A. E. Eiben, Z. Michalewicz, M. Schoenauer, and J. E. Smith, Parameter control in evolutionary algorithms, Parameter Setting in Evolutionary Algorithms, vol.54, p.151, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00140549

A. E. Eiben and S. K. Smit, Evolutionary algorithm parameters and methods to tune them, p.25, 2012.

P. Engrand, A multi-objective optimization approach based on simulated annealing and its application to nuclear fuel management, p.44, 1998.

T. A. Feo, M. G. Resende, and S. H. Smith, A greedy randomized adaptive search procedure for maximum independent set, Operations Research, vol.42, issue.5, p.44, 1994.

P. Festa, M. Sellmann, and J. Vanschoren, Learning and Intelligent Optimization-10th International Conference, LION 10. Revised Selected Papers, Lecture Notes in Computer Science. Springer, vol.10079, p.190, 0200.

Á. Fialho, L. D. Costa, M. Schoenauer, and M. Sebag, Analyzing banditbased adaptive operator selection mechanisms, Annals of Mathematics and Artificial Intelligence, vol.60, issue.1-2, p.154, 2010.
DOI : 10.1007/s10472-010-9213-y
URL : https://hal.archives-ouvertes.fr/inria-00519579

C. M. Fonseca, P. J. Fleming, E. Zitzler, K. Deb, T. et al., Evolutionary Multi-Criterion Optimization-Second International Conference, EMO 2003. Proceedings, vol.2632, 2003.

Y. Gai, B. Krishnamachari, J. , and R. , Combinatorial network optimization with unknown variables: Multi-armed bandits with linear rewards and individual observations, IEEE/ACM Transactions on Networking, vol.20, issue.5, p.154, 2012.
DOI : 10.1109/tnet.2011.2181864

M. J. Geiger, Randomised variable neighbourhood search for multi objective optimisation, Design and Evaluation of Advanced Hybrid Meta-Heuristics4th EU/ME Workshop. Proceedings, pp.34-42, 2008.

M. Gendreau and J. Potvin, Handbook of Metaheuristics, International Series in Operations Research & Management Science, vol.146, 2010.

F. Glover, Tabu search-part I, ORSA Journal on computing, vol.1, issue.3, p.44, 1989.
DOI : 10.1287/ijoc.1.3.190

F. W. Glover and M. Laguna, Tabu Search. Springer US. (citations on pages 13, vol.42, 1997.
URL : https://hal.archives-ouvertes.fr/hal-01412610

A. Gretsista and E. K. Burke, An iterated local search framework with adaptive operator selection for nurse rostering, Learning and Intelligent Optimization-11th International Conference, LION 11. Revised Selected Papers, vol.10556, p.156, 2017.
DOI : 10.1007/978-3-319-69404-7_7

Y. Hamadi, E. Monfroy, and F. Saubion, Autonomous Search. Springer. (citations on pages 25, vol.31, 2012.
DOI : 10.1007/978-3-642-41482-4_7
URL : https://hal.archives-ouvertes.fr/hal-00872880

M. P. Hansen, Multiple Criteria Decision Making-13th International Conference, Proceedings, pp.574-586, 1997.

J. H. Holland, Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence, p.13, 1992.

H. Hoos, M. T. Lindauer, and T. Schaub, Advances in algorithm selection for answer set programming. Theory and Practice of Logic Programming, vol.2, p.35, 2014.

H. H. Hoos, Programming by optimization, Communications of the ACM, vol.55, issue.2, p.24, 2012.

H. H. Hoos, R. Kaminski, M. T. Lindauer, and T. Schaub, aspeed: Solver scheduling via answer set programming. Theory and Practice of Logic Programming, vol.15, pp.27-76, 2015.

H. H. Hoos and T. Stützle, Stochastic Local Search: Foundations & Applications, 2004.

D. Horn, K. Schork, T. Wagner, J. Handl, E. Hart et al., Multi-objective selection of algorithm portfolios: Experimental validation, Parallel Problem Solving from Nature-14th International Conference, PPSN XIV. Proceedings, vol.9921, p.32, 2016.
DOI : 10.1007/978-3-319-45823-6_39

F. Hutter, H. H. Hoos, and K. Leyton-brown, Sequential model-based optimization for general algorithm configuration, pp.507-523, 2011.
DOI : 10.1007/978-3-642-25566-3_40
URL : http://www.cs.ubc.ca/spider/hutter/papers/10-TR-SMAC.pdf

F. Hutter, H. H. Hoos, and K. Leyton-brown, Identifying key algorithm parameters and instance features using forward selection, Nicosia and Pardalos, p.146, 2013.
DOI : 10.1007/978-3-642-44973-4_40
URL : http://www.cs.ubc.ca/%7Ehoos/Publ/HutEtAl13-preprint.pdf

F. Hutter, H. H. Hoos, K. Leyton-brown, and T. Stützle, Paramils: An automatic algorithm configuration framework, Journal of Artificial Intelligence Research, vol.36, pp.267-306, 2009.
DOI : 10.1613/jair.2861
URL : https://jair.org/index.php/jair/article/download/10628/25415

F. Hutter, H. H. Hoos, and T. Stützle, Automatic algorithm configuration based on local search, Twenty-Second AAAI Conference on Artificial Intelligence. Proceedings, pp.1152-1157, 2007.

M. Inja, C. Kooijman, M. De-waard, D. M. Roijers, W. et al., , 2014.

, Queued Pareto local search for multi-objective optimization, p.49, 2014.

H. Ishibuchi and T. Murata, Multi-objective genetic local search algorithm, Evolutionary Computation, IEEE International Conference. Proceedings, vol.43, p.61, 1996.

H. Ishibuchi and T. Murata, A multi-objective genetic local search algorithm and its application to flowshop scheduling, IEEE Transactions on Systems, vol.28, issue.3, p.46, 1998.

H. Ishibuchi, N. Tsukamoto, and Y. Nojima, Evolutionary many-objective optimization: A short review, IEEE Congress on Evolutionary Computation, CEC 2008. Proceedings, p.43, 2008.

D. Jaeggi, C. Asselin-miller, G. Parks, T. Kipouros, T. Bell et al., Multi-objective parallel tabu search, p.44, 2004.

D. Jaeggi, G. T. Parks, T. Kipouros, and P. J. Clarkson, The development of a multi-objective tabu search algorithm for continuous optimisation problems, European Journal of Operational Research, vol.185, issue.3, p.44, 2008.

A. Jaszkiewicz, Genetic local search for multi-objective combinatorial optimization, European Journal of Operational Research, vol.137, issue.1, p.43, 2002.

S. Kadioglu, Y. Malitsky, A. Sabharwal, H. Samulowitz, and M. Sellmann, Algorithm selection and scheduling, Principles and Practice of Constraint Programming-17th International Conference, vol.6876, p.27, 2011.

S. Kadioglu, Y. Malitsky, M. Sellmann, T. , K. Coelho et al., ISAC-instancespecific algorithm configuration, 19th European Conference on Artificial Intelligence, ECAI 2010. Proceedings, vol.215, p.27, 2010.

G. Karafotias, Á. E. Eiben, and M. Hoogendoorn, Generic parameter control with reinforcement learning, Genetic and Evolutionary Computation Conference, p.155, 2014.

G. Karafotias, M. Hoogendoorn, and Á. E. Eiben, Parameter control in evolutionary algorithms: Trends and challenges, IEEE Transactions on Evolutionary Computation, vol.19, issue.2, pp.167-187, 2015.

G. Karafotias, S. K. Smit, A. E. Eiben, A. Agapitos, S. Cagnoni et al., A generic approach to parameter control, Lecture Notes in Computer Science, vol.7248, p.68, 2012.

J. Kennedy and R. Eberhart, Particle swarm optimization, IEEE International Conference on Neural Networks. Proceedings, vol.4, p.13, 1995.

B. W. Kernighan and S. Lin, An efficient heuristic procedure for partitioning graphs. The Bell system technical journal, vol.49, p.21, 1970.

M. Kessaci-marmion, C. Dhaenens, and J. Humeau, Neutral neighbors in bi-objective optimization: Distribution of the most promising for permutation problems, pp.344-358, 2017.

S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, Optimization by simulated annealing. science, vol.220, p.43, 1983.

J. Knowles, L. Thiele, and E. Zitzler, A tutorial on the performance assessment of stochastic multiobjective optimizers, vol.214, p.106, 2006.

J. D. Knowles and D. Corne, Instance generators and test suites for the multiobjective quadratic assignment problem, p.22, 2003.

J. D. Knowles and D. W. Corne, The Pareto archived evolution strategy: A new baseline algorithm for Pareto multiobjective optimisation, IEEE Congress on Evolutionary Computation, CEC 99. Proceedings, vol.43, p.61, 1999.

J. D. Knowles and D. W. Corne, Approximating the nondominated front using the Pareto archived evolution strategy, Evolutionary Computation, vol.8, issue.2, p.61, 2000.
DOI : 10.1162/106365600568167
URL : https://www.mitpressjournals.org/userimages/ContentEditor/1164817256746/lib_rec_form.pdf

J. D. Knowles and D. W. Corne, M-PAES: A memetic algorithm for multiobjective optimization, IEEE Congress on Evolutionary Computation, CEC 00. Proceedings, p.46, 2000.
DOI : 10.1109/cec.2000.870313

J. D. Knowles and D. W. Corne, On metrics for comparing nondominated sets, IEEE Congress on Evolutionary Computation, CEC 2002. Proceedings, vol.1, p.14, 2002.
DOI : 10.1109/cec.2002.1007013

L. ;. Kotthoff, L. D. Raedt, L. Kotthoff, S. Nijssen, B. O'sullivan et al., Algorithm selection for combinatorial search problems: A survey, Data Mining and Constraint Programming: Foundations of a Cross-Disciplinary Approach, vol.10101, p.27, 2016.
DOI : 10.1007/978-3-319-50137-6_7
URL : http://arxiv.org/abs/1210.7959

L. Kotthoff, C. Thornton, H. H. Hoos, F. Hutter, and K. Leyton-brown, Auto-weka 2.0: Automatic model selection and hyperparameter optimization in WEKA, Journal of Machine Learning Research, vol.18, p.35, 2017.

N. Krasnogor and P. L. Lanzi, Genetic and Evolutionary Computation Conference, GECCO 2011. Proceedings. ACM. (citations on pages 187 and 193, 2011.

T. L. Lai and H. Robbins, Asymptotically efficient adaptive allocation rules, Advances in applied mathematics, vol.6, issue.1, p.154, 1985.
DOI : 10.1016/0196-8858(85)90002-8
URL : https://doi.org/10.1016/0196-8858(85)90002-8

W. B. Langdon, Genetically improved software, Handbook of Genetic Programming Applications, p.32, 2015.
DOI : 10.1007/978-3-319-20883-1_8

E. L. Lawler, J. K. Lenstra, A. H. Kan, and D. B. Shmoys, Sequencing and scheduling: Algorithms and complexity, Handbooks in operations research and management science, vol.4, p.18, 1993.
DOI : 10.1016/s0927-0507(05)80189-6

A. Liefooghe, J. Humeau, S. Mesmoudi, L. Jourdan, and E. Talbi, On dominance-based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems, Journal of Heuristics, vol.18, issue.2, pp.317-352, 2012.
DOI : 10.1007/s10732-011-9181-3
URL : https://hal.archives-ouvertes.fr/hal-00628215

S. Lin and B. W. Kernighan, An effective heuristic algorithm for the traveling-salesman problem, Operations research, vol.21, issue.2, p.21, 1973.

M. Lindauer, R. Bergdoll, and F. Hutter, An empirical study of per-instance algorithm scheduling, pp.27-76, 2016.

M. T. Lindauer, H. H. Hoos, F. Hutter, and T. Schaub, AutoFolio: An automatically configured algorithm selector, Journal of Artificial Intelligence Research, vol.53, p.35, 2015.
DOI : 10.1613/jair.4726
URL : https://jair.org/index.php/jair/article/download/10955/26096

M. López-ibáñez, J. Dubois-lacoste, L. P. Cáceres, M. Birattari, and T. Stützle, The irace package: Iterated racing for automatic algorithm configuration, Operations Research Perspectives, vol.3, pp.43-58, 2016.

M. López-ibáñez, T. ;. Stützle, M. Birattari, G. A. Caro, R. Doursat et al., Automatic configuration of multiobjective ACO algorithms, Swarm Intelligence-7th International Conference, vol.6234, p.13, 2010.

M. López-ibáñez and T. Stützle, The impact of design choices of multiobjective antcolony optimization algorithms on performance: an experimental study on the biobjective TSP, Genetic and Evolutionary Computation Conference, p.13, 2010.

H. Lourenço, O. Martin, and T. Stützle, Iterated local search: Framework and applications, Gendreau and Potvin, p.42, 2010.

H. Lourenço, O. Martin, and T. Stützle, Iterated local search, Handbook of Metaheuristics, vol.57, p.89, 2003.

T. Lust and J. Teghem, Two-phase Pareto local search for the biobjective traveling salesman problem, Journal of Heuristics, vol.16, issue.3, p.48, 2010.

Y. Malitsky, A. Sabharwal, H. Samulowitz, and M. Sellmann, Algorithm portfolios based on cost-sensitive hierarchical clustering, Twenty-Third International Joint Conference on Artificial Intelligence, IJCAI 2013. Proceedings, p.27, 2013.

I. B. Mansour and I. Alaya, Indicator based ant colony optimization for multi-objective knapsack problem, Procedia Computer Science, vol.60, p.12, 2015.
DOI : 10.1016/j.procs.2015.08.165
URL : https://doi.org/10.1016/j.procs.2015.08.165

R. Martí, V. Campos, M. G. Resende, and A. Duarte, Multiobjective GRASP with path relinking, European Journal of Operational Research, vol.240, issue.1, p.45, 2015.

J. Maturana, Á. Fialho, F. Saubion, M. Schoenauer, and M. Sebag, Extreme compass and dynamic multi-armed bandits for adaptive operator selection, IEEE Congress on Evolutionary Computation, vol.70, p.30, 2009.
DOI : 10.1109/cec.2009.4982970
URL : https://hal.archives-ouvertes.fr/inria-00377450

N. Mladenovi´cmladenovi´c and P. Hansen, Variable neighborhood search, Computers & Operations Research, vol.24, issue.11, p.45, 1997.

L. Moalic, A. Caminada, and S. Lamrous, A fast local search approach for multiobjective problems, Nicosia and Pardalos, vol.50, p.61, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00926403

K. V. Moffaert, M. M. Drugan, A. ;. Nowé, P. J. Fleming, C. M. Fonseca et al., Hypervolume-based multiobjective reinforcement learning, Evolutionary Multi-Criterion Optimization7th International Conference, EMO 2013. Proceedings, vol.7811, p.70, 2013.

J. Molina, M. Laguna, R. Martí, and R. Caballero, SSPMO: A scatter tabu search procedure for non-linear multiobjective optimization, INFORMS Journal on Computing, vol.19, issue.1, p.44, 2007.

G. Moslehi and M. Mahnam, A Pareto approach to multi-objective flexible job-shop scheduling problem using particle swarm optimization and local search, International Journal of Production Economics, vol.129, issue.1, p.47, 2011.
DOI : 10.1016/j.ijpe.2010.08.004

T. Murata, H. Ishibuchi, G. , and M. , Cellular genetic local search for multi-objective optimization, 2000.

L. Spector, I. C. Parmee, and H. Beyer, Genetic and Evolutionary Computation Conference, GECCO '00. Proceedings, p.46
DOI : 10.1145/2330784.2330926

M. Nawaz, E. E. Enscore, and I. Ham, A heuristic algorithm for the mmachine, n-job flow-shop sequencing problem, Omega, vol.11, issue.1, p.151, 1983.

G. Nicosia and P. M. Pardalos, Learning and Intelligent Optimization, 7th International Conference, LION 7. Revised Selected Papers, vol.7997, 2013.

T. Okabe, Y. Jin, and B. Sendhoff, A critical survey of performance indices for multi-objective optimisation, IEEE Congress on Evolutionary Computation, CEC 2003. Proceedings, p.14, 2003.

L. Paquete, M. Chiarandini, T. ;. Stützle, M. Sevaux, K. Sörensen et al., Pareto local optimum sets in the biobjective traveling salesman problem: An experimental study, Metaheuristics for multiobjective optimisation, vol.535, pp.177-199, 2004.

L. Paquete and T. Stützle, A two-phase local search for the biobjective traveling salesman problem, p.47, 2003.

V. Pareto, Cours d'économie politique, F. Rouge, vol.1, p.11, 1896.

J. Petke, S. O. Haraldsson, M. Harman, W. B. Langdon, D. R. White et al., Genetic improvement of software: a comprehensive survey, IEEE Transactions on Evolutionary Computation, p.32, 2017.

K. Rajaraman and P. S. Sastry, Finite time analysis of the pursuit algorithm for learning automata, IEEE Transactions on Systems, Man, and Cybernetics, vol.26, issue.4, p.153, 1996.

J. R. Rice, The algorithm selection problem, Advances in computers, vol.15, p.26, 1976.

N. Riquelme, C. Von-lücken, and B. Barán, Performance metrics in multiobjective optimization, 2015 Latin American Computing Conference, p.14, 2015.

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, p.116, 2007.
DOI : 10.1016/j.ejor.2005.12.009
URL : http://iridia.ulb.ac.be/~stuetzle/publications/IG_FSP.ps.gz

N. R. Sabar, M. Ayob, G. Kendall, and R. Qu, A dynamic multiarmed bandit-gene expression programming hyper-heuristic for combinatorial optimization problems, IEEE Transactions on Cybernetics, vol.45, issue.2, p.154, 2015.
DOI : 10.1109/tcyb.2014.2323936
URL : http://eprints.nottingham.ac.uk/28275/1/IEEEcybernets14.pdf

Y. Sakurai, K. Takada, T. Kawabe, and S. Tsuruta, A method to control parameters of evolutionary algorithms by using reinforcement learning, Sixth International Conference on Signal-Image Technology and Internet-Based Systems, p.155, 2010.
DOI : 10.1109/sitis.2010.22

M. Schumer and K. Steiglitz, Adaptive step size random search, IEEE Transactions on Automatic Control, vol.13, issue.3, p.30, 1968.
DOI : 10.1109/tac.1968.1098903
URL : http://www.cs.princeton.edu/~ken/adaptivestepsize68.pdf

P. Serafini, Simulated annealing for multi objective optimization problems, Multiple Criteria Decision Making, pp.283-292, 1994.
DOI : 10.1007/978-1-4612-2666-6_29

S. Silva and A. I. Esparcia-alcázar, GECCO 2015. Proceedings. ACM. (citations on pages 189, vol.193, p.206, 2015.

B. Suman, Simulated annealing-based multiobjective algorithms and their application for system reliability, Engineering Optimization, vol.35, issue.4, p.44, 2003.
DOI : 10.1080/03052150310001597765

B. Suman and P. Kumar, A survey of simulated annealing as a tool for single and multiobjective optimization, Journal of the Operational Research Society, vol.57, issue.10, p.44, 2006.

A. Suppapitnarm, G. ;. Parks, J. M. Daida, A. E. Eiben, M. H. Garzon et al., Simulated annealing: an alternative approach to true multiobjective optimization, Genetic and Evolutionary Computation Conference, p.44, 1999.

R. K. Suresh and K. M. Mohanasundaram, Pareto archived simulated annealing for permutation flow shop scheduling with multiple objectives, IEEE Bibliography Conference on Cybernetics and Intelligent Systems, vol.2, p.44, 2004.
DOI : 10.1109/iccis.2004.1460675

R. S. Sutton and A. G. Barto, Reinforcement learning-an introduction. Adaptive computation and machine learning, 1998.

E. Taillard, Benchmarks for basic scheduling problems, European Journal of Operational Research, vol.64, issue.2, p.19, 1993.
DOI : 10.1016/0377-2217(93)90182-m

E. Talbi, M. Rahoual, M. H. Mabed, C. ;. Dhaenens, K. Deb et al., A hybrid evolutionary approach for multicriteria optimization problems: Application to the flow shop, Evolutionary Multi-Criterion Optimization-1st International Conference, EMO 2001. Proceedings, pp.416-428, 2001.
DOI : 10.1007/3-540-44719-9_29

M. Thathachar and P. S. Sastry, A new approach to the design of reinforcement schemes for learning automata, IEEE Transactions on Systems, Man, and Cybernetics, vol.15, issue.1, p.153, 1985.

D. Thierens, An adaptive pursuit strategy for allocating operator probabilities, Genetic and Evolutionary Computation Conference, pp.1539-1546, 2005.
DOI : 10.1145/1068009.1068251

C. Thornton, F. Hutter, H. H. Hoos, K. Leyton-brown, I. S. Dhillon et al., Autoweka: combined selection and hyperparameter optimization of classification algorithms, Knowledge Discovery and Data Mining-19th ACM SIGKDD International Conference, KDD 2013, pp.35-146, 2013.

H. Trautmann, G. Rudolph, K. Klamroth, O. Schütze, M. M. Wiecek et al., Evolutionary Multi-Criterion Optimization-9th International Conference, vol.10173, 2017.

F. Tricoire, Multi-directional local search, Computers & Operations Research, vol.39, issue.12, p.49, 2012.
DOI : 10.1016/j.cor.2012.03.010
URL : https://hal.archives-ouvertes.fr/hal-01517255

B. Ulungu, P. Fortemps, J. Teghem, J. Gu, and G. Chen, Heuristic for multi-objective combinatorial optimization problems by simulated annealing, 1995.

Q. Wei, W. , and S. , Sci-Tech. (citations on pages 14, vol.43, p.61, 1995.

B. Ulungu, J. Teghem, P. Fortemps, and D. Tuyttens, MOSA method: a tool for solving multiobjective combinatorial optimization problems, Journal of Multi-Criteria Decision Analysis, vol.8, issue.4, pp.43-53, 1999.

D. A. Van-veldhuizen and G. B. Lamont, Multiobjective evolutionary algorithms: Analyzing the state-of-the-art, Evolutionary Computation, vol.8, issue.2, p.14, 2000.

N. Veerapen and F. Saubion, Pareto autonomous local search, p.156, 2011.
DOI : 10.1007/978-3-642-25566-3_29

J. Vermorel, M. Mohri, J. Gama, R. Camacho, P. Brazdil et al., Multi-armed bandit algorithms and empirical evaluation, 16th European Conference on Machine Learning, ECML 2005. Proceedings, vol.3720, p.153, 2005.
DOI : 10.1007/11564096_42
URL : https://link.springer.com/content/pdf/10.1007%2F11564096_42.pdf

D. S. Vianna and J. E. Arroyo, A GRASP algorithm for the multiobjective knapsack problem, XXIV International Conference of the Chilean Computer Science Society, SCCC 2004. Proceedings, p.44, 2004.

S. Whiteson and P. Stone, On-line evolutionary computation for reinforcement learning in stochastic domains, Genetic and Evolutionary Computation Conference, p.155, 2006.

Y. Wong, K. Lee, K. Leung, and C. Ho, A novel approach in parameter adaptation and diversity maintenance for genetic algorithms, Soft Computing, vol.7, issue.8, p.155, 2003.

L. Xu, F. Hutter, H. H. Hoos, and K. Leyton-brown, Satzilla: Portfoliobased algorithm selection for SAT, Journal of Artificial Intelligence Research, vol.32, p.27, 2008.
DOI : 10.1613/jair.2490
URL : https://jair.org/index.php/jair/article/download/10556/25269

S. Q. Yahyaa, M. M. Drugan, and B. Manderick, Annealing-Pareto multiobjective multi-armed bandit algorithm, IEEE Symposium on Adaptive Dynamic Programming and Reinforcement Learning. ADPRL 2014, p.154, 2014.
DOI : 10.1109/adprl.2014.7010619

X. Yao, E. K. Burke, J. A. Lozano, J. Smith, J. J. Guervós et al., Parallel Problem Solving from Nature-8th International Conference, PPSN VIII. Proceedings, vol.3242, 2004.

Q. Zhang and H. Li, MOEA/D: A multiobjective evolutionary algorithm based on decomposition, IEEE Transactions on Evolutionary Computation, vol.11, issue.6, p.13, 2007.

T. Zhang, M. Georgiopoulos, A. , and G. C. , SPRINT multiobjective model racing, pp.1383-1390, 2015.
DOI : 10.1145/2739480.2754791
URL : http://www.eecs.ucf.edu/%7Ettzhang/GECCO2015.pdf

T. Zhang, M. Georgiopoulos, A. , and G. C. , Multi-objective model selection via racing, IEEE Transactions on Cybernetics, vol.46, issue.8, pp.1863-1876, 2016.
DOI : 10.1109/tcyb.2015.2456187

T. Zhang, M. Georgiopoulos, A. , and G. C. , Pareto-optimal model selection via SPRINT-Race, IEEE Transactions on Cybernetics, vol.48, issue.2, pp.596-610, 2018.
DOI : 10.1109/tcyb.2017.2647821

E. Zitzler and S. Künzli, Indicator-based selection in multiobjective search, p.13, 2004.
DOI : 10.1007/978-3-540-30217-9_84

E. Zitzler, M. Laumanns, T. , and L. , SPEA2: Improving the strength Pareto evolutionary algorithm, vol.103, p.13, 2001.

E. Zitzler, L. Thiele, A. E. Eiben, T. Bäck, M. Schoenauer et al., Multiobjective optimization using evolutionary algorithms-A comparative case study, Parallel Problem Solving from Nature-5th International Conference, PPSN V. Proceedings, vol.1498, p.15, 1998.

E. Zitzler and L. Thiele, Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach, IEEE Transactions on Evolutionary Computation, vol.3, issue.4, pp.257-271, 1999.

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