, RPD time (s) RPD time (s) RPD time (s) RPD time (s) RPD time (s) RPD time (s)

M. Kessaci,

, 34 years old) Married, p.1, 1985.

, Classe normale, échelon 5 (sept, UMR 9189 Team: ORKAD 2012-2013 Postdoctoral Researcher (ERCIM Alain Bensoussan Fellowship) Université Libre de Bruxelles (Belgique) Team: IRIDIA-CoDE 2011-2012 Research & Teaching Assistant Université Lille 1 -UFR Informatique, Electronique, Electrotechnique, Automatique Laboratoire d'Informatique Fondamentale de Lille (LIFL), UMR 8022 Team: DOLPHIN 2011-2012 Teaching Assistant, 2008.

, Local search and combinatorial optimization: from structural analysis of a problem to design efficient algorithms, Master in applied Mathematics Université Paris 6 Pierre et Marie Curie Specialization: Mathematical engineering Internship at Air Liquide R&D (team: Process Control and Logistics) Topic: Design of a model to forecast liquid consumption of bulk clients 2005-2006 Bachelor in Applied Mathematics Université François Rabelais, 2006.

?. Since, Weerapan Sae-dan -Automatic Design of Dynamic Local Search Algorithms, co-supervision (35%) with Nadarajen Veerapen and Laetitia Jourdan (HDR), Laurent Parmentier -Multi-objective automatic design of machine learning systems, co-supervision (50%) with Laetitia Jourdan (HDR). CIFRE with OVH company ? Since Oct, 2018.

, Aymeric Blot -Designing Autonomous Methods for Multiobjective Combinatorial Optimisation, co-supervision (50%) with Laetitia Jourdan (HDR), 2015.

, Topic: Landscape-based algorithm selection in combinatorial optimization Co-supervision of Lucas Marcondes Pavelski (PhD student), Publications: GECCO 2019, 2018.

, ) Topic: Initialization techniques for multiobjective combinatorial optimization Publication: PPSN 2018

L. Holger-hoos and L. University, Topic: Multi-objective automatic algorithm configuration. Design of MO-ParamILS Publications, ECJ, 2016.

C. Patrick-de, Topic: Design of adaptive multi-objective stochastic local search algorithms Publication, 2018.

, Japon) Topic: Neutrality in multiobjective optimization: definition, analysis, interests Publication: GECCO, 2016.

, Topic: Exploiting the factoradics representation to solve permutation problems Publication: LION, 2015.

, Scientific Animation and Administration Journal Reviewing ? COR -Computers and Operations Research ? EJOR -European Journal of Operational Research ? ITOR -Transactions in Operational Research ? OMEGA -The International Journal of Management Science ? CAIE -Computers & Industrial Engineering ? Swarm Intelligence Journal ? International Journal of Metaheuristics Program Committee Memberships ? Learning and Intelligent Optimisation

?. Genetic, Evolutionary Computation Conference GECCO, 2013.

?. Sls, , 2019.

, ? Special Session in CEC conference, 2018.

, ? Summer school ATOM, vol.2017

, Marrakech (Morocco) (100 participants) Member of Selection Committee for Associate Professor Recruitment ? Université Polytechniques des Hauts de France, ? International conference, vol.2014, p.3, 2015.

?. Bqr, Brazil) as participant: ? Interreg V France-Wallonie-Vlaanderen, p.6, 2017.

?. Phrci-, Nominated member of the pedagogical commission of Polytech Lille (3 times a year) 2014-2016 Pedagogical manager for the 3rd year (AE) of GIS department (about 15 apprentices) Role: Organization of apprenticeship, total budget: 50ke ? ANR ClinMine, 2013-2017 -total budget: 500ke Since, 2014.

A. Blot, M. Kessaci, L. Jourdan, and H. H. Hoos, Automatic Configuration of Multi-Objective Local Search Algorithms for Permutation Problems, Evolutionary Computation 27.1, pp.147-171, 2019.
URL : https://hal.archives-ouvertes.fr/hal-01927901

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

C. Dhaenens, J. Jacques, V. Vandewalle, M. Vandromme, E. Chazard et al., ClinMine: Optimizing the Management of Patients in Hospital, pp.83-92, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01692197

C. Dhaenens and L. Jourdan, 9th International Conference on Learning and Intelligent Optimization, vol.8994, 2015.

C. Pageau, A. Blot, H. Holger, M. Hoos, L. Kessaci et al., Configuration of a Dynamic MOLS Algorithm for Bi-objective Flowshop Scheduling, Proceedings of the 10th International Conference on Evolutionary Multi-Criterion Optimization, vol.11411, pp.565-577, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02078581

L. M. Pavelski, . Marie-eléonore, M. R. Kessaci, and . Delgado, Metalearning on Flowshop using Fitness Landscape Analysis, Proceedings of the Genetic and Evolutionary Computation Conference, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02278263

. Blot, . Aymeric, H. Holger, M. Hoos, L. Kessaci et al., Automatic Configuration of Bi-Objective Optimisation Algorithms: Impact of Correlation Between Objectives, Proceedings of the IEEE 30th International Conference on Tools with Artificial Intelligence, ICTAI, pp.571-578, 2018.

A. Blot, M. Kessaci, L. Jourdan, and P. Causmaecker, Adaptive Multi-objective Local Search Algorithms for the Permutation Flowshop Scheduling Problem, Proceedings of the 12th International Conference Learning and Intelligent Optimization, vol.11353, pp.241-256, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01868401

A. Blot, M. López-ibáñez, M. Kessaci, and L. Jourdan, New Initialisation Techniques for Multi-objective Local Search -Application to the Bi-objective Permutation Flowshop, Proceedings of the 15th International Conference Parallel Problem Solving from Nature, vol.11101, pp.323-334, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01928148

L. M. Pavelski, . Marie-eléonore, M. R. Kessaci, and . Delgado, Meta-Learning for Optimization: A Case Study on the Flowshop Problem Using Decision Trees, Proceedings of the IEEE Congress on Evolutionary Computation, pp.1-8, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01928031

L. M. Pavelski, . Marie-eléonore, M. R. Kessaci, and . Delgado, Recommending Meta-Heuristics and Configurations for the Flowshop Problem via Meta-Learning: Analysis and Design, pp.163-168, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01989270

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

A. Blot, A. Pernet, L. Jourdan, M. Kessaci-marmion, and H. H. Hoos, Automatically Configuring Multi-objective Local Search Using Multi-objective Optimisation, Proceedings of the 9th International Conference on Evolutionary Multi-Criterion Optimization, vol.10173, pp.61-76, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01559690

. Kessaci-marmion, C. Marie-eléonore, J. Dhaenens, and . Humeau, Neutral Neighbors in Bi-objective Optimization: Distribution of the Most Promising for Permutation Problems, Proceedings of the 9th International Conference on Evolutionary Multi-Criterion Optimization, vol.10173, pp.344-358, 2017.

L. Mousin, M. Kessaci, and C. Dhaenens, A New Constructive Heuristic for the No-Wait Flowshop Scheduling Problem, Proceedings of the 11th International Conference Learning and Intelligent Optimization, vol.10556, pp.196-209, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01579775

. Blot, . Aymeric, H. Holger, L. Hoos, M. Jourdan et al., MO-ParamILS: A Multi-objective Automatic Algorithm Configuration Framework, Proceedings of the 10th International Conference on Learning and Intelligent Optimization, vol.10079, pp.32-47, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01370392

M. Marmion, H. E. Aguirre, C. Dhaenens, L. Jourdan, and K. Tanaka, Multi-objective Neutral Neighbors': What could be the definition(s)?, " In: Proceedings of the Genetic and Evolutionary Computation Conference, pp.349-356, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01420900

L. Mousin, L. Jourdan, M. Kessaci-marmion, and C. Dhaenens, Proceedings of the 10th International Conference on Learning and Intelligent Optimization, vol.10079, pp.141-156, 2016.

. Blot, H. E. Aymeric, C. Aguirre, L. Dhaenens, M. Jourdan et al., Neutral but a Winner! How Neutrality Helps Multiobjective Local Search Algorithms, Proceedings of the 8th International Conference on Evolutionary Multi-Criterion Optimization, vol.9018, pp.34-47, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01216485

M. Marmion and O. Regnier-coudert, Fitness Landscape of the Factoradic Representation on the Permutation Flowshop Scheduling Problem, Proceedings of the 9th International Conference on Learning and Intelligent Optimization, vol.8994, pp.151-164, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01252317

. López-ibáñez, F. Manuel, M. Mascia, T. Marmion, and . Stützle, A template for designing single-solution hybrid metaheuristics, Companion Material Proceedings of the Genetic and Evolutionary Computation Conference, pp.1423-1426, 2014.

. Mascia, M. Franco, J. López-ibáñez, M. Dubois-lacoste, T. Marmion et al., Algorithm Comparison by Automatically Configurable Stochastic Local Search Frameworks: A Case Study Using Flow-Shop Scheduling Problems, Proceedings of the 9th International Workshop Hybrid Metaheuristics, HM, vol.8457, pp.30-44, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01094683

. López-ibáñez, F. Manuel, M. Mascia, T. Marmion, and . Stützle, Automatic Design of a Hybrid Iterated Local Search for the Multi-Mode Resource-Constrained Multi-Project Scheduling Problem, Proceedings of the 6th Multidisciplinary International Conference on Scheduling : Theory and Applications, pp.820-825, 2013.

M. Marmion, A. Blot, L. Jourdan, and C. Dhaenens, Neutrality in the Graph Coloring Problem, Proceedings of the 7th International Conference on Learning and Intelligent Optimization, vol.7997, pp.125-130, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00919750

M. Marmion, F. Mascia, M. López-ibáñez, and T. Stützle, Automatic Design of Hybrid Stochastic Local Search Algorithms, Proceedings of the 8th International Workshop Hybrid Metaheuristics, HM, vol.7919, pp.144-158, 2013.

C. Pageau, A. Blot, H. Holger, M. Hoos, L. Kessaci et al., A Dynamic Algorithm Framework to Automatically Design a Multi-Objective Local Search, 20ème Conférence ROADEF de la Société Française de Recherche Opérationnelle et d'Aide à la, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02082123

A. Blot, M. Kessaci-marmion, and L. Jourdan, AMH: a new Framework to Design Adaptive Metaheuristics, 12th Metaheuristics International Conference, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01559687

A. Blot, M. Kessaci-marmion, and L. Jourdan, AMH: une plate-forme pour le design et le contrôle automatique de métaheuristiques multiobjectif, 18ème Conférence ROADEF de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, ROADEF, 2017.

L. Mousin, M. Kessaci-marmion, and C. Dhaenens, An Iterated Greedy-based Approach Exploiting Promising Sub-Sequences of Jobs to solve the No-Wait Flowshop Scheduling Problem, 12th Metaheuristics International Conference, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01579768

L. Mousin, M. Kessaci-marmion, and C. Dhaenens, De nouvelles meilleures solutions pour le problème d'ordonnancement No-Wait Flowshop, 18ème Conférence ROADEF de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, ROADEF, 2017.

M. Marmion, F. Mascia, M. López-ibáñez, and T. Stützle, Towards the Automatic Design of Metaheuristics". In: 10th Metaheuristics International Conference, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01094692

M. Abbasi, L. Paquete, and F. B. Pereira, Local Search for Multiobjective Multiple Sequence Alignment, Bioinformatics and Biomedical Engineering -Third International Conference, vol.9044, pp.175-182, 2015.

H. Aguirre and K. Tanaka, Random bit climbers on multiobjective MNK-landscapes: effects of memory and population climbing, IEICE Transactions on Fundamentals of Electronics, vol.88, pp.42-43, 2005.

T. Aldowaisan and A. Allahverdi, New heuristics for no-wait flowshops to minimize makespan, Computers & Operations Research, vol.30, issue.8, pp.1219-1231, 2003.

E. Angel, E. Bampis, and L. Gourvés, Approximating the Pareto curve with local search for the bicriteria TSP (1, 2) problem", In: Theoretical Computer Science, vol.310, issue.1-3, pp.42-43, 2004.

C. Ansótegui, Y. Malitsky, H. Samulowitz, M. Sellmann, and K. Tierney, Model-Based Genetic Algorithms for Algorithm Configuration, Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, pp.733-739, 2015.

C. Ansótegui, M. Sellmann, and K. Tierney, A Gender-Based Genetic Algorithm for the Automatic Configuration of Algorithms, 15th International Conference, vol.5732, pp.142-157, 2009.

F. Arnold and K. Sörensen, Knowledge-guided local search for the vehicle routing problem, Computers & OR 105, p.141, 2019.

F. Arnold and K. Sörensen, What makes a VRP solution good? The generation of problem-specific knowledge for heuristics, Computers & OR, vol.106, p.141, 2019.

J. E. Arroyo, R. Claudio, S. Ottoni, A. De-paiva, and . Oliveira, Multi-objective Variable Neighborhood Search Algorithms for a Single Machine Scheduling Problem with Distinct due Windows, Electr. Notes Theor. Comput. Sci, vol.281, pp.5-19, 2011.

S. Bandyopadhyay, S. Saha, U. Maulik, and K. Deb, A simulated annealing-based multiobjective optimization algorithm: AMOSA, IEEE Transactions on Evolutionary Computation, vol.12, pp.269-283, 2008.

. Barba-gonzález, J. Cristóbal, A. J. Garc?a-nieto, J. A. Nebro, J. J. Cordero et al., jMet-alSP: A framework for dynamic multi-objective big data optimization, Appl. Soft Comput, vol.69, p.47, 2018.

M. Basseur and E. K. Burke, Indicator-based multi-objective local search, Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2007, pp.3100-3107, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00609252

M. Basseur and A. Goëffon, Climbing combinatorial fitness landscapes, Appl. Soft Comput, vol.30, pp.688-704, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01392214

M. Basseur, R. Zeng, and J. Hao, Hypervolume-based multiobjective local search, Neural Computing and Applications 21, vol.8, p.31, 2012.

A. Baykasoglu, S. Owen, and N. Gindy, A taboo search based approach to find the Pareto optimal set in multiple objective optimization, pp.731-748, 1999.

R. P. Beausoleil, Multiple Criteria Scatter Search, Metaheuristics International Conference 4th, pp.534-539, 2001.

E. Bertolissi, Heuristic algorithm for scheduling in the no-wait flow-shop, Journal of Materials Processing Technology, vol.107, issue.1-3, pp.459-465, 2000.

L. C. Bezerra, M. López-ibáñez, and T. Stützle, Automatic Component-Wise Design of Multiobjective Evolutionary Algorithms, IEEE Trans. Evolutionary Computation, vol.20, p.53, 2016.

L. Bianco, P. Dell'olmo, and S. Giordani, Flow Shop No-Wait Scheduling With Sequence Dependent Setup Times And Release Dates, INFOR: Information Systems and Operational Research, vol.37, pp.3-19, 1999.

. Blot, H. E. Aymeric, C. Aguirre, L. Dhaenens, M. Jourdan et al., Neutral but a Winner! How Neutrality Helps Multiobjective Local Search Algorithms, Proceedings of the 8th International Conference on Evolutionary Multi-Criterion Optimization, vol.9018, pp.88-89, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01216485

. Blot, . Aymeric, H. Holger, L. Hoos, M. Jourdan et al., MO-ParamILS: A Multi-objective Automatic Algorithm Configuration Framework, Proceedings of the 10th International Conference on Learning and Intelligent Optimization, vol.10079, pp.50-54, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01370392

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

A. Blot, M. Kessaci-marmion, and L. Jourdan, AMH: a new Framework to Design Adaptive Metaheuristics, 12th Metaheuristics International Conference, p.47, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01559687

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

A. Blot, M. Kessaci, L. Jourdan, and P. Causmaecker, Adaptive Multi-objective Local Search Algorithms for the Permutation Flowshop Scheduling Problem, Proceedings of the 12th International Conference Learning and Intelligent Optimization, vol.11353, pp.46-144, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01868401

A. Blot, M. Kessaci, L. Jourdan, and H. H. Hoos, Automatic Configuration of Multi-Objective Local Search Algorithms for Permutation Problems, Evolutionary Computation 27.1, pp.41-49, 2019.
URL : https://hal.archives-ouvertes.fr/hal-01927901

A. Blot, A. Pernet, L. Jourdan, M. Kessaci-marmion, and H. H. Hoos, Automatically Configuring Multi-objective Local Search Using Multi-objective Optimisation, Proceedings of the 9th International Conference on Evolutionary Multi-Criterion Optimization, vol.10173, pp.49-53, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01559690

J. Branke and J. Asem-elomari, Meta-optimization for parameter tuning with a flexible computing budget, Genetic and Evolutionary Computation Conference, GECCO '12, p.50, 2012.

D. Brockhoff, A Bug in the Multiobjective Optimizer IBEA: Salutary Lessons for Code Release and a Performance Re-Assessment". In: Evolutionary Multi-Criterion Optimization -EMO, p.96, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01161943

E. K. Burke, M. Gendreau, M. R. Hyde, G. Kendall, G. Ochoa et al., Hyper-heuristics: a survey of the state of the art, JORS 64, vol.12, pp.1695-1724, 2013.

E. K. Burke, R. Matthew, G. Hyde, and . Kendall, Grammatical Evolution of Local Search Heuristics, IEEE Trans. Evolutionary Computation, vol.16, issue.3, p.17, 2012.

L. Cáceres, T. Pérez, and . Stützle, Exploring variable neighborhood search for automatic algorithm configuration, Electronic Notes in Discrete Mathematics, vol.58, p.82, 2017.

S. Cahon, N. Melab, and E. Talbi, ParadisEO: A Framework for the Reusable Design of Parallel and Distributed Metaheuristics, J. Heuristics, vol.10, p.46, 2004.

D. Cai, C. Zhang, and X. He, Unsupervised feature selection for multi-cluster data, Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, pp.333-342, 2010.

V. Calhoun, MLSP 2014 Schizophrenia Classification Challenge, 2014.

L. Cervante, B. Xue, M. Zhang, and L. Shang, Binary particle swarm optimisation for feature selection: A filter based approach, Evolutionary Computation (CEC), pp.1-8, 2012.

F. Chicano, F. Daolio, G. Ochoa, S. Vérel, M. Tomassini et al., Local Optima Networks, Landscape Autocorrelation and Heuristic Search Performance, Parallel Problem Solving from Nature -PPSN XII -12th International Conference, vol.7492, pp.337-347, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00741842

W. Conover and . Jay, Practical Nonparametric Statistics. Wiley & Sons Cited on, p.22, 1999.

P. A. Consoli, Y. Mei, L. L. Minku, and X. Yao, Dynamic selection of evolutionary operators based on online learning and fitness landscape analysis, Soft Comput. 20.10, pp.3889-3914, 2016.

P. Czyzak and A. Jaszkiewicz, A multiobjective metaheuristic approach to the location of petrol stations by the capital budgeting model, Control and Cybernetics 25.1, vol.34, pp.42-43, 1996.

P. Czyzak and A. Jaszkiewicz, Pareto simulated annealing -a metaheuristic technique for multiple-objective combinatorial optimization, Journal of Multi-Criteria Decision Analysis, pp.28-36, 1998.

F. Daolio, A. Liefooghe, S. Vérel, H. E. Aguirre, and K. Tanaka, Problem Features versus Algorithm Performance on Rugged Multiobjective Combinatorial Fitness Landscapes, Evolutionary Computation, vol.25, 2017.

F. Daolio, S. Vérel, G. Ochoa, and M. Tomassini, Local optima networks and the performance of iterated local search, Genetic and Evolutionary Computation Conference, GECCO '12, pp.369-376, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00741725

K. Deb, Multi-objective optimization using evolutionary algorithms, vol.16, p.37, 2001.

K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan, A fast and elitist multiobjective genetic algorithm: NSGA-II, IEEE Trans. Evolutionary Computation, vol.6, p.53, 2002.

P. Desport, M. Basseur, A. Goëffon, F. Lardeux, and F. Saubion, Empirical Analysis of Operators for Permutation Based Problems, Learning and Intelligent Optimization -9th International Conference, LION 9, vol.8994, pp.137-150, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01891521

J. Ding, S. Song, N. D. Jatinder, R. Gupta, R. Zhang et al., An improved iterated greedy algorithm with a Tabu-based reconstruction strategy for the no-wait flowshop scheduling problem, Applied Soft Computing, vol.30, pp.604-613, 2015.

B. Doerr and C. Doerr, Theory of Parameter Control for Discrete Black-Box Optimization: Provable Performance Gains Through Dynamic Parameter Choices, CoRR abs/1804.05650 Cited on pages 5, vol.46, pp.113-144, 2018.
URL : https://hal.archives-ouvertes.fr/hal-02436293

M. Dorigo and M. Birattari, Ant Colony Optimization, Encyclopedia of Machine Learning, pp.36-39, 2010.

M. Dorigo, V. Maniezzo, and A. Colorni, Ant system: optimization by a colony of cooperating agents, IEEE Trans. Systems, Man, and Cybernetics, vol.26, pp.29-41, 1996.

J. Dréo, Using performance fronts for parameter setting of stochastic metaheuristics, Genetic and Evolutionary Computation Conference, p.50, 2009.

M. M. Drugan and D. Thierens, Path-Guided Mutation for Stochastic Pareto Local Search Algorithms". In: Parallel Problem Solving from Nature -PPSN XI, 11th International Conference, vol.6238, pp.485-495, 2010.

M. M. Drugan and D. Thierens, Stochastic Pareto local search: Pareto neighbourhood exploration and perturbation strategies, J. Heuristics, vol.18, p.43, 2012.

J. Du and J. Leung, Minimizing Total Tardiness on One Machine is NP-Hard", In: Math. Oper. Res, vol.15, issue.3, pp.483-495, 1990.

J. Dubois-lacoste, M. López-ibáñez, and T. Stützle, Effective Hybrid Stochastic Local Search Algorithms for Biobjective Permutation Flowshop Scheduling, Hybrid Metaheuristics, 6th International Workshop, vol.5818, pp.100-114, 2009.

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 38, vol.8, p.31, 2011.

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

J. Dubois-lacoste, M. López-ibáñez, and T. Stützle, Anytime pareto local search, European Journal of Operational Research, vol.243, pp.369-385, 2015.

J. Durillo, A. J. José, and . Nebro, jMetal: A Java framework for multiobjective optimization, Advances in Engineering Software 42, vol.10, p.47, 2011.

B. Duval, J. Hao, and J. Hernandez, A memetic algorithm for gene selection and molecular classification of cancer, Genetic and Evolutionary Computation Conference, pp.201-208, 2009.

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

C. Emmanouilidis, A. Hunter, and J. Macintyre, A multiobjective evolutionary setting for feature selection and a commonality-based crossover operator, Evolutionary Computation, vol.1, pp.309-316, 2000.

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

T. A. Feo, G. C. Mauricio, and . Resende, Greedy Randomized Adaptive Search Procedures, J. Global Optimization, vol.6, pp.109-133, 1995.

T. A. Feo, G. C. Mauricio, S. H. Resende, and . Smith, A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set, Operations Research, vol.42, issue.5, pp.860-878, 1994.

Á. Fialho, L. D. Costa, M. Schoenauer, and M. Sebag, Dynamic multi-armed bandits and extreme value-based rewards for adaptive operator selection in evolutionary algorithms, International Conference on Learning and Intelligent Optimization, p.74, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00377401

P. Fortemps, J. Teghem, and B. Ulungu, Heuristics for multiobjective combinatorial optimization by simulated annealing, XIth International Conference on MCDM, vol.34, pp.42-43, 1994.

A. Franzin, L. P. Cáceres, and T. Stützle, Effect of transformations of numerical parameters in automatic algorithm configuration, Optimization Letters 12, vol.8, pp.1741-1753, 2018.

A. Franzin and T. Stützle, Revisiting simulated annealing: A componentbased analysis, Computers & OR, vol.104, pp.191-206, 2019.

. Galván-lópez, R. Edgar, A. Poli, . Kattan, O. Michael et al., Neutrality in evolutionary algorithms, pp.145-163, 2011.

R. Gangadharan and C. Rajendran, Heuristic algorithms for scheduling in the no-wait flowshop, International Journal of Production Economics, vol.32, pp.285-290, 1993.

D. Garrett, Plateau Connection Structure and multiobjective metaheuristic performance, Proceedings of the IEEE Congress on Evolutionary Computation, pp.1281-1288, 2009.

D. Garrett and D. Dasgupta, Multiobjective Landscape Analysis and the Generalized Assignment Problem, Learning and Intelligent Optimization, vol.5313, pp.110-124, 2007.

M. Geiger and . Josef, Randomised Variable Neighbourhood Search for Multi Objective Optimisation, vol.34, pp.42-43, 2008.

M. Gendreau and J. Potvin, Handbook of metaheuristics, vol.2, 2010.

I. A. Gheyas and L. S. Smith, Feature subset selection in large dimensionality domains, Pattern Recognition 43.1, p.130, 2010.

P. C. Gilmore and R. E. Gomory, Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem, Operations Research, vol.12, issue.5, pp.655-679, 1964.

F. Glover, M. Laguna, D. Taillard, and . De-werra, Tabu search, Baltzer Basel Cited, p.29, 1993.
URL : https://hal.archives-ouvertes.fr/hal-02309983

J. Grabowski and J. Pempera, Some local search algorithms for no-wait flow-shop problem with makespan criterion, Computers & Operations Research, vol.32, pp.2197-2212, 2005.

C. Guerra-salcedo and D. Whitley, Genetic Approach to Feature Selection for Ensemble Creation, Proceedings of the Genetic and Evolutionary Computation Conference, p.136, 1999.

. Guizzo, S. R. Giovani, A. T. Vergilio, G. M. Pozo, and . Fritsche, A multi-objective and evolutionary hyper-heuristic applied to the Integration and Test Order Problem, Appl. Soft Comput, vol.56, pp.331-344, 2017.

I. Guyon, S. R. Gunn, A. Ben-hur, and G. Dror, Result Analysis of the NIPS 2003 Feature Selection Challenge, Advances in Neural Information Processing Systems 17 [Neural Information Processing Systems, p.136, 2004.

I. Guyon, S. Gunn, M. Nikravesh, and L. Zadeh, Feature extraction: foundations and applications, vol.207, p.136, 2008.

T. M. Hamdani, J. Won, A. M. Alimi, and F. Karray, Multiobjective Feature Selection with NSGA II, Adaptive and Natural Computing Algorithms, 8th International Conference, pp.240-247, 2007.

M. Hansen and . Pilegaard, Tabu search for multiobjective optimization: MOTS, Proceedings of the 13th International Conference on Multiple Criteria Decision Making, vol.29, pp.42-43, 1997.

L. Hernando, F. Daolio, N. Veerapen, and G. Ochoa, Local Optima Networks of the Permutation Flowshop Scheduling Problem: Makespan vs. total flow time, Congress on Evolutionary Computation, pp.1964-1971, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01874059

S. Herrmann, G. Ochoa, and F. Rothlauf, Communities of Local Optima as Funnels in Fitness Landscapes, Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, pp.325-331, 2016.

J. H. Holland, Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence, 1992.

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

D. Horn, K. Schork, and T. Wagner, Multi-objective Selection of Algorithm Portfolios: Experimental Validation, Parallel Problem Solving from Nature -PPSN XIV -14th International Conference, vol.9921, pp.421-430, 2016.

J. Humeau, A. Liefooghe, . El-ghazali, S. Talbi, and . Vérel, ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms, pp.17-46, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00832029

. Hutter, . Frank, H. Holger, K. Hoos, and . Leyton-brown, Sequential Model-Based Optimization for General Algorithm Configuration, Learning and Intelligent Optimization -5th International Conference, LION 5, vol.6683, p.50, 2011.

. Hutter, . Frank, H. Holger, K. Hoos, T. Leyton-brown et al., ParamILS: An Automatic Algorithm Configuration Framework, J. Artif. Intell. Res, vol.36, pp.267-306, 2009.

M. Inja, C. Kooijman, D. M. Maarten-de-waard, S. Roijers, and . Whiteson, Queued Pareto Local Search for Multi-Objective Optimization, Parallel Problem Solving from Nature -PPSN XIII -13th International Conference, vol.8672, pp.589-599, 2014.

H. Ishibuchi and T. Murata, Multi-Objective Genetic Local Search Algorithm, Proceedings of 1996 IEEE International Conference on Evolutionary Computation, vol.30, pp.42-43, 1996.

H. Ishibuchi, N. Tsukamoto, and Y. Nojima, Evolutionary manyobjective optimization: A short review, Proceedings of the IEEE Congress on Evolutionary Computation, pp.2419-2426, 2008.

D. Jaeggi, C. Asselin-miller, G. T. Parks, T. Kipouros, T. Bell et al., Multi-objective Parallel Tabu Search, Parallel Problem Solving from Nature -PPSN VIII, 8th International Conference, vol.3242, pp.732-741, 2004.

D. Jaeggi, G. T. Parks, T. Kipouros, and P. Clarkson, The development of a multi-objective Tabu Search algorithm for continuous optimisation problems, European Journal of Operational Research, vol.185, pp.1192-1212, 2008.

B. Jarboui, M. Eddaly, and P. Siarry, A hybrid genetic algorithm for solving no-wait flowshop scheduling problems, The International Journal of Advanced Manufacturing Technology, vol.54, pp.1129-1143, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00916819

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

T. Jones, Evolutionary algorithms, fitness landscapes and search, 1995.

T. Jones and S. Forrest, Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms, Proceedings of the 6th International Conference on Genetic Algorithms, pp.184-192, 1995.

S. Kadioglu, Y. Malitsky, M. Sellmann, and K. Tierney, ISAC -Instance-Specific Algorithm Configuration, ECAI 2010 -19th European Conference on Artificial Intelligence, vol.215, pp.751-756, 2010.

G. Karafotias, M. Hoogendoorn, and Á. E. Eiben, Parameter Control in Evolutionary Algorithms: Trends and Challenges, IEEE Transactions on Evolutionary Computation, vol.19, pp.167-187, 2015.

S. Kauffman, The Origins of Order : Self-Organization and Selection in Evolution, 1993.

. Kerschke, . Pascal, H. Holger, F. Hoos, H. Neumann et al., Automated Algorithm Selection: Survey and Perspectives, Evolutionary Computation 27.1, pp.3-45, 2019.

P. Kerschke and H. Trautmann, Automated Algorithm Selection on Continuous Black-Box Problems by Combining Exploratory Landscape Analysis and Machine Learning, Evolutionary Computation 27.1, pp.112-145, 2019.

S. Kirkpatrick, M. P. Daniel-gelatt, and . Vecchi, Optimization by simulated annealing, Science 220, vol.4598, pp.671-680, 1983.

J. Knowles and D. Corne, The pareto archived evolution strategy: A new baseline algorithm for pareto multiobjective optimisation, CEC 99. Proceedings of the 1999 Congress on, vol.1, pp.98-105, 1999.

J. Knowles and D. Corne, Approximating the nondominated front using the Pareto archived evolution strategy, Evolutionary Computation, vol.8, issue.2, pp.42-43, 2000.

J. Knowles and D. Corne, M-PAES: A memetic algorithm for multiobjective optimization, Proceedings of the 2000 Congress on, vol.1, p.30, 2000.

J. Knowles and D. Corne, On metrics for comparing nondominated sets, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02, vol.1, pp.711-716, 2002.

J. Knowles and D. Corne, Instance Generators and Test Suites for the Multiobjective Quadratic Assignment Problem, Evolutionary Multi-Criterion Optimization, Second International Conference, vol.2632, p.56, 2003.

G. A. Kochenberger, F. W. Glover, B. Alidaee, and C. Rego, A unified modeling and solution framework for combinatorial optimization problems, OR Spectrum, vol.26, pp.237-250, 2004.

R. Kohavi and G. H. John, Wrappers for Feature Subset Selection, Artif. Intell, issue.2, pp.273-324, 1997.

L. Kotthoff, Algorithm Selection for Combinatorial Search Problems: A Survey, pp.48-60, 2014.

D. Laha and U. K. Chakraborty, A constructive heuristic for minimizing makespan in no-wait flow shop scheduling, The International Journal of Advanced Manufacturing Technology, vol.41, issue.2, pp.97-109, 2008.

W. Li, E. Ozcan, and R. John, A Learning Automata-Based Multiobjective Hyper-Heuristic, IEEE Trans. Evolutionary Computation, vol.23, issue.1, pp.59-73, 2019.

A. Liefooghe, B. Derbel, S. Vérel, H. E. Aguirre, and K. Tanaka, A Fitness Landscape Analysis of Pareto Local Search on Bi-objective Permutation Flowshop Scheduling Problems, Evolutionary Multi-Criterion Optimization -9th International Conference, vol.10173, pp.422-437, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01496357

A. Liefooghe, B. Derbel, S. Vérel, H. E. Aguirre, and K. Tanaka, Towards Landscape-Aware Automatic Algorithm Configuration: Preliminary Experiments on Neutral and Rugged Landscapes, Evolutionary Computation in Combinatorial Optimization -17th European Conference, vol.10197, pp.215-232, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01496347

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 18, vol.2, pp.317-352, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00628215

A. Liefooghe, L. Jourdan, and E. Talbi, A software framework based on a conceptual unified model for evolutionary multiobjective optimization: ParadisEO-MOEO, European Journal of Operational Research, vol.209, p.46, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00522612

S. Lin and K. Ying, Optimization of makespan for no-wait flowshop scheduling problems using efficient matheuristics, Omega, vol.64, pp.115-125, 2016.

M. Lindauer, . Thomas, H. Holger, F. Hoos, T. Hutter et al., AutoFolio: An Automatically Configured Algorithm Selector, J. Artif. Intell. Res, vol.53, pp.745-778, 2015.

M. Lindauer, R. Bergdoll, and F. Hutter, An Empirical Study of Per-instance Algorithm Scheduling, Learning and Intelligent Optimization -10th International Conference, vol.10, p.77, 2016.

N. Long, D. Gianola, and G. J. Rosa, Machine learning classification procedure for selecting SNPs in genomic selection: application to early mortality in broilers, Journal of animal breeding and genetics 124, vol.6, pp.377-389, 2007.

M. López-ibáñez and C. Blum, Beam-ACO for the travelling salesman problem with time windows, Computers & OR, vol.37, pp.1570-1583, 2010.

. López-ibáñez, J. Manuel, L. P. Dubois-lacoste, T. Cáceres, M. Stützle et al., The irace package: Iterated Racing for Automatic Algorithm Configuration, Operations Research Perspectives, vol.3, p.50, 2016.

. López-ibáñez, J. Manuel, T. Dubois-lacoste, M. Stützle, and . Birattari, The irace package, Iterated Race for Automatic Algorithm Configuration, 2011.

H. Lourenço, O. Martin, and T. Stützle, Iterated Local Search: Framework and Applications, Handbook of Metaheuristics, vol.2, pp.363-397, 2010.

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

. Manderick, M. K. Bernard, P. De-weger, and . Spiessens, The Genetic Algorithm and the Structure of the Fitness Landscape, Proceedings of the 4th International Conference on Genetic Algorithms, pp.143-150, 1991.

M. Marmion, H. E. Aguirre, C. Dhaenens, L. Jourdan, and K. Tanaka, Multi-objective Neutral Neighbors': What could be the definition(s)?, " In: Proceedings of the Genetic and Evolutionary Computation Conference, p.87, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01420900

M. Marmion, C. Dhaenens, L. Jourdan, A. Liefooghe, and S. Verel, NILS: A Neutrality-Based Iterated Local Search and Its Application to Flowshop Scheduling, Proceedings of the 11th European Conference on Evolutionary Computation in Combinatorial Optimization, vol.6622, pp.191-202, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00563459

M. Marmion, C. Dhaenens, L. Jourdan, A. Liefooghe, and S. Verel, On the Neutrality of Flowshop Scheduling Fitness Landscapes, Proceedings of the 5th International Conference on Learning and Intelligent Optimization, vol.6683, p.97, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00550356

M. Marmion, J. Humeau, L. Jourdan, and C. Dhaenens, Fitness Landscape Analysis and Metaheuristics Efficiency". In: J. Math. Model. Algorithms, vol.12, pp.3-26, 2013.

R. Martí, V. Campos, M. G. Resende, and A. Duarte, Multiobjective GRASP with Path Relinking, European Journal of Operational Research, vol.240, pp.54-71, 2015.

. Mascia, M. Franco, J. López-ibáñez, T. Dubois-lacoste, and . Stützle, From Grammars to Parameters: Automatic Iterated Greedy Design for the Permutation Flow-Shop Problem with Weighted Tardiness, Learning and Intelligent Optimization -7th International Conference, vol.7997, pp.321-334, 2013.

R. I. Mckay, . Nguyen-xuan, P. A. Hoai, Y. Whigham, M. Shan et al., Grammar-based Genetic Programming: a survey, Genetic Programming and Evolvable Machines, vol.11, pp.16-17, 2010.

P. Merz, Advanced Fitness Landscape Analysis and the Performance of Memetic Algorithms, Evolutionary Computation, vol.12, pp.303-325, 2004.

G. Minella, R. Ruiz, and M. Ciavotta, A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem, INFORMS Journal on Computing, vol.20, pp.451-471, 2008.

N. Mladenovi? and P. Hansen, Variable neighborhood search, Computers & operations research 24.11, pp.1097-1100, 1997.

L. Moalic, A. Caminada, and S. Lamrous, A fast local search approach for multiobjective problems, International Conference on Learning and Intelligent Optimization, vol.34, pp.42-43, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00926403

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, pp.91-100, 2005.

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, p.31, 2011.

L. Mousin and L. Jourdan, Proceedings of the 10th International Conference on Learning and Intelligent Optimization, vol.10079, p.113, 2016.

L. Mousin, M. Kessaci, and C. Dhaenens, A New Constructive Heuristic for the No-Wait Flowshop Scheduling Problem, Proceedings of the 11th International Conference Learning and Intelligent Optimization, vol.10556, p.120, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01579775

L. Mousin, M. Kessaci, and C. Dhaenens, Exploiting Promising Sub-Sequences of Jobs to solve the No-Wait Flowshop Scheduling Problem, CoRR abs/1903.09035 Cited on pages 7 and 113, 2019.
URL : https://hal.archives-ouvertes.fr/hal-01579768

T. Murata, H. Ishibuchi, and M. Gen, Cellular genetic local search for multi-objective optimization, Proceedings of the 2nd Annual Conference on Genetic and Evolutionary Computation, p.30, 2000.

M. Nawaz, I. Emory-enscore, and . Ham, A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem, Omega 11.1, p.115, 1983.

A. J. Nebro, M. Juan-josé-durillo, and . Vergne, Redesigning the jMetal Multi-Objective Optimization Framework, Genetic and Evolutionary Computation Conference, p.47, 2015.

G. Ochoa, M. Tomassini, S. Vérel, and C. Darabos, A study of NK landscapes' basins and local optima networks, Genetic and Evolutionary Computation Conference, pp.555-562, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00331868

G. Ochoa and N. Veerapen, Deconstructing the Big Valley Search Space Hypothesis, Evolutionary Computation in Combinatorial Optimization -16th European Conference, pp.6-7, 2016.

G. Ochoa, N. Veerapen, D. Whitley, and E. K. Burke, The Multi-Funnel Structure of TSP Fitness Landscapes: A Visual Exploration, Artificial Evolution -12th International Conference, vol.9554, p.141, 2015.

T. Okabe, Y. Jin, and B. Sendhoff, A critical survey of performance indices for multi-objective optimisation, The 2003 Congress on Evolutionary Computation, 2003. CEC '03, vol.2, pp.878-885, 2003.

L. S. Oliveira, M. Morita, and R. Sabourin, Feature selection for ensembles using the multi-objective optimization approach, Multi-Objective Machine Learning, pp.49-74, 2006.

C. Pageau, A. Blot, H. Holger, M. Hoos, L. Kessaci et al., Configuration of a Dynamic MOLS Algorithm for Bi-objective Flowshop Scheduling, Proceedings of the 10th International Conference on Evolutionary Multi-Criterion Optimization, vol.11411, pp.41-49, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02078581

F. Pagnozzi and T. Stützle, Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems, European Journal of Operational Research, vol.276, pp.409-421, 2019.

. Pan, M. Quan-ke, Y. Fatih-tasgetiren, and . Liang, A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem, Computers & Operations Research, vol.35, pp.2807-2839, 2008.

C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, p.14, 1982.

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, vol.34, pp.42-43, 2004.

L. Paquete and T. Stützle, A two-phase local search for the biobjective traveling salesman problem". In: Evolutionary Multi-Criterion Optimization, p.31, 2003.

L. M. Pavelski, . Marie-eléonore, M. R. Kessaci, and . Delgado, Metalearning on Flowshop using Fitness Landscape Analysis, Proceedings of the Genetic and Evolutionary Computation Conference, pp.112-145, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02278263

Y. Pushak and H. H. Hoos, Algorithm Configuration Landscapes: -More Benign Than Expected?, In: Parallel Problem Solving from Nature -PPSN XV -15th International Conference, vol.11102, p.143, 2018.

B. Qian, L. Wang, R. Hu, D. X. Huang, and X. Wang, A DE-based approach to no-wait flow-shop scheduling, Computers & Industrial Engineering, vol.57, pp.787-805, 2009.

C. Rajendran, A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan, Journal of the Operational Research Society, vol.45, pp.472-478, 1994.

J. R. Rice, The Algorithm Selection Problem, Advances in Computers 15, pp.65-118, 1976.

N. Riquelme, C. Von-lücken, and B. Barán, Performance metrics in multi-objective optimization, Proceedings of the 2015 Latin American Computing Conference, p.53, 2015.

H. Röck, The Three-Machine No-Wait Flow Shop is NP-Complete, Journal of the ACM 31, vol.2, pp.336-345, 1984.

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, pp.2033-2049, 2007.

H. Samarghandi and T. Y. Elmekkawy, A meta-heuristic approach for solving the no-wait flow-shop problem, International Journal of Production Research, vol.50, pp.7313-7326, 2012.

D. Schindl and N. Zufferey, Solution Methods for Fuel Supply of Trains, INFOR: Information Systems and Operational Research, vol.51, pp.131-132, 2013.

B. Schölkopf and A. Smola, Support Vector Machines, Encyclopedia of Biostatistics Cited on pages 130 and 135, 1998.

P. Serafini, Simulated annealing for multi objective optimization problems, Multiple Criteria Decision Making, vol.34, pp.42-43, 1994.

B. Suman, Simulated annealing-based multiobjective algorithms and their application for system reliability, pp.391-416, 2003.

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, pp.1143-1160, 2006.

A. Suppapitnarm and G. Parks, Simulated annealing: an alternative approach to true multiobjective optimization, Proceedings of the Genetic and Evolutionary Computation Conference, pp.406-407, 1999.

R. K. Suresh and K. M. Mohanasundaram, Pareto archived simulated annealing for permutation flow shop scheduling with multiple objectives, Cybernetics and Intelligent Systems, vol.2, pp.712-717, 2004.

E. Taillard, Benchmarks for basic scheduling problems, European Journal of Operational Research, vol.64, p.55, 1993.

. Talbi, M. El-ghazali, and . Rahoual, A hybrid evolutionary approach for multicriteria optimization problems: Application to the flow shop, International Conference on Evolutionary Multi-Criterion Optimization, pp.416-428, 2001.

C. Tan, C. Jun, Y. Peng-lim, and . Cheah, A multi-objective evolutionary algorithm-based ensemble optimizer for feature selection and classification with neural network models, Neurocomputing 125, pp.217-228, 2014.

S. Tari, M. Basseur, and A. Goëffon, Sampled Walk and Binary Fitness Landscapes Exploration, Artificial Evolution -13th International Conference, Évolution Artificielle, vol.10764, pp.47-57, 2017.

S. Tari, M. Basseur, and A. Goëffon, Worst Improvement Based Iterated Local Search, Evolutionary Computation in Combinatorial Optimization -18th European Conference, vol.10782, pp.50-66, 2018.

D. Thierens, An adaptive pursuit strategy for allocating operator probabilities, Proceedings of the 7th annual conference on Genetic and evolutionary computation, p.74, 2005.

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

F. Tricoire, Multi-directional local search, Computers & Operations Research 39, vol.12, p.32, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01925330

B. Ulungu, J. Teghem, and P. Fortemps, Heuristic for multiobjective combinatorial optimization problems by simulated annealing, MCDM: Theory and Applications Cited on, p.28, 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, pp.28-36, 1999.

V. K. Vassilev, C. Terence, J. F. Fogarty, and . Miller, Information Characteristics and the Structure of Landscapes, Evolutionary Computation 8.1, pp.31-60, 2000.

N. Veerapen, J. Maturana, and F. Saubion, An explorationexploitation compromise-based adaptive operator selection for local search, Genetic and Evolutionary Computation Conference, GECCO '12, pp.1277-1284, 2012.

N. Veerapen and G. Ochoa, Visualising the global structure of search landscapes: genetic improvement as a case study, Genetic Programming and Evolvable Machines, vol.19, p.141, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01869822

S. Vérel, P. Collard, and M. Clergue, Scuba search: when selection meets innovation, Proceedings of the IEEE Congress on Evolutionary Computation, CEC, pp.88-111, 2004.

S. Vérel, F. Daolio, G. Ochoa, and M. Tomassini, Sampling Local Optima Networks of Large Combinatorial Search Spaces: The QAP Case, Parallel Problem Solving from Nature -PPSN XV -15th International Conference, vol.11102, pp.257-268, 2018.

S. Vérel, A. Liefooghe, L. Jourdan, and C. Dhaenens, On the structure of multiobjective combinatorial search space: MNK-landscapes with correlated objectives, European Journal of Operational Research, vol.227, pp.331-342, 2013.

D. Vianna, J. Soares, and . Arroyo, A GRASP Algorithm for the Multi-Objective Knapsack Problem, XXIV International Conference of the Chilean Computer Science Society, pp.69-75, 2004.

E. D. Weinberger, Correlated and uncorrelated fitness landscapes and how to tell the difference, Biological Cybernetics, vol.63, pp.325-336, 1990.

D. A. Wismer, Solution of the Flowshop-Scheduling Problem with No Intermediate Queues, Operations Research, vol.20, issue.3, pp.689-697, 1972.

S. Wright, The roles of mutation, inbreeding, crossbreeding and selection in evolution, Proceedings of the Sixth International Congress on Genetics, vol.1, p.6, 1932.

L. Xu, F. Hutter, H. Holger, K. Hoos, and . Leyton-brown, SATzilla: Portfolio-based Algorithm Selection for SAT, J. Artif. Intell. Res, vol.32, pp.565-606, 2008.

B. Xue, M. Zhang, and . Browne, Particle swarm optimization for feature selection in classification: A multi-objective approach, Cybernetics, IEEE Transactions on 43, vol.6, pp.1656-1671, 2013.

J. Yang and V. Honavar, Feature subset selection using a genetic algorithm". In: Feature extraction, construction and selection, p.130, 1998.

T. Zhang, M. Georgiopoulos, and G. C. Anagnostopoulos, S-Race: a multi-objective racing algorithm, Genetic and Evolutionary Computation Conference, GECCO '13, pp.1565-1572, 2013.

T. Zhang, M. Georgiopoulos, and G. C. Anagnostopoulos, SPRINT Multi-Objective Model Racing, Proceedings of the Genetic and Evolutionary Computation Conference, pp.1383-50, 2015.

Z. Zhu, Y. Ong, and M. Dash, Markov blanket-embedded genetic algorithm for gene selection, Pattern Recognition 40, vol.11, p.136, 2007.

E. Zitzler and L. Thiele, Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach, IEEE Trans. Evolutionary Computation, vol.3, pp.32-52, 1999.

E. Zitzler, L. Thiele, M. Laumanns, C. M. Fonseca, and V. Fonseca, Performance assessment of multiobjective optimizers: an analysis and review, IEEE Trans. Evolutionary Computation, issue.2, p.52, 2003.

, Résumé Les métaheuristiques sont des algorithmes génériques et flexibles capables de s'adapter à tout type de problème d'optimisation grâce à la variété des stratégies algorithmiques et leurs propres valeurs de paramètres

, Premièrement, la généricité de la conception peut aussi être complétée par des mécanismes ou des heuristiques dépendant du problème. Deuxièmement, bien qu'il soit largement admis qu'aucun algorithme ne domine tous les autres sur toutes les instances du problème, une métaheuristique doit être finement paramétrée pour bien fonctionner. Par conséquent

T. Dans-nos, nous nous intéressons à deux façons différentes d'aborder la conception basée sur la connaissance : la configuration automatique d'algorithmes et l'analyse de paysage. La première partie traite de la configuration automatique des algorithmes de recherche locale mono-objectif et multi-objectif et la seconde traite de la caractérisation des paysages multi-objectifs

, Ces deux sujets, apparemment indépendants, ont, très récemment, commencé à se rejoindre et diverses perspectives seront données dans ce sens