, A variable neighborhood search algorithm with reinforcement learning for a real-life periodic vehicle routing problem with time windows and open route

B. Adenso, -. Diaz, and M. Laguna, Fine-tuning of algorithms using fractional experimental designs and local search, Operations research, vol.54, issue.1, pp.99-114, 2006.

M. Adibi and J. Shahrabi, A clustering-based modified variable neighborhood search algorithm for a dynamic job shop scheduling problem, The International Journal of Advanced Manufacturing Technology, vol.70, 2014.

A. Afanasyeva and M. Buzdalov, Choosing best fitness function with reinforcement learning, 10th International Conference on Machine Learning and Applications and Workshops, vol.2, pp.354-357, 2011.

A. Morteza-alinia, Opposition-based learning in the shuffled bidirectional differential evolution algorithm, Swarm and Evolutionary Computation, vol.26, pp.64-85, 2016.

O. Aichholzer, F. Aurenhammer, T. Brandstatter, H. Ebner, C. Krasser et al., Evolution strategy and hierarchical clustering, IEEE transactions on magnetics, vol.38, pp.1041-1044, 2002.

M. Ali, M. Pant, and A. Abraham, Unconventional initialization methods for differential evolution, Appl. Math. Comput, vol.219, pp.4474-4494, 2013.

E. Alpaydin, Introduction to machine learning, 2014.

H. Ben-amor and A. Rettinger, Intelligent exploration for genetic algorithms: using self-organizing maps in evolutionary computation, Proceedings of the 7th annual conference on Genetic and evolutionary computation, pp.1531-1538, 2005.

S. Asta, E. Özcan, A. Parkes, and A. Etaner-uyar, Generalizing hyper-heuristics via apprenticeship learning, European Conference on Evolutionary Computation in Combinatorial Optimization, pp.169-178, 2013.

S. Baluja, Population-based incremental learning. a method for integrating genetic search based function optimization and competitive learning, 1994.

S. Baluja, S. Davies, and ;. Science, Using Optimal Dependency-Trees for Combinatorial Optimization: Learning the Structure of the Search Space, 1997.

T. Bartz-beielstein, B. Filipi?, P. Koro?ec, and E. Talbi, High-Performance Simulation-Based Optimization, 2020.
URL : https://hal.archives-ouvertes.fr/hal-02304686

T. Bartz-beielstein and S. Markon, tuning search algorithms for real-life applications: regression tree based approach, CEC'2004 Congress on Evolutionary Computation, pp.1111-1118, 2004.

T. Bartz-beielstein, E. Konstantinos, M. N. Parsopoulos, and . Vrahatis, Design and analysis of optimization algorithms using computational statistics, Applied Numerical Analysis & Computational Mathematics, vol.1, pp.413-433, 2004.

T. Bartz-beielstein and M. Preuß, Experimental analysis of optimization algorithms: Tuning and beyond, Theory and Principled Methods for the Design of Metaheuristics, pp.205-245, 2014.

M. H. Bassett, J. F. Pekny, and G. V. Reklaitis, Decomposition techniques for the solution of large-scale scheduling problems, AIChE Journal, vol.42, pp.3373-3387, 1996.

. Basu, Quasi-oppositional differential evolution for optimal reactive power dispatch, International Journal of Electrical Power & Energy Systems, vol.78, pp.29-40, 2016.

I. Bello, H. Pham, V. Quoc, M. Le, S. Norouzi et al., Neural combinatorial optimization with reinforcement learning, 2016.

K. P. Bennett and E. Parrado-hernández, The interplay of optimization and machine learning research, Journal of Machine Learning Research, vol.7, pp.1265-1281, 2006.

M. Birattari, Tuning metaheuristics: A machine learning perspective, 2009.

B. Bischl, P. Kerschke, L. Kotthoff, M. Lindauer, Y. Malitsky et al., Aslib: A benchmark library for algorithm selection, Artificial Intelligence, vol.237, pp.41-58, 2016.

B. Bischl, O. Mersmann, H. Trautmann, and M. Preuß, Algorithm selection based on exploratory landscape analysis and cost-sensitive learning, Proceedings of the 14th annual conference on Genetic and evolutionary computation, pp.313-320, 2012.

L. Bottou, E. Frank, J. Curtis, and . Nocedal, Optimization methods for large-scale machine learning, Siam Review, vol.60, pp.223-311, 2018.

J. Boyan and A. W. Moore, Learning evaluation functions to improve optimization by local search, Journal of Machine Learning Research, vol.1, pp.77-112, 2000.

P. Brazdil, C. Giraud-carrier, C. Soares, and R. Vilalta, Metalearning: Applications to Data Mining, 2008.

E. Mihaela, A. Breaban, and . Iftene, Dynamic Objective Sampling in Many-objective Optimization, 178 -187. Knowledge-Based and Intelligent Information & Engineering Systems 19th Annual Conference, vol.60, 2015.

D. Buche, N. Nicol, P. Schraudolph, and . Koumoutsakos, Accelerating evolutionary algorithms with Gaussian process fitness function models, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews, vol.35, pp.183-194, 2005.

T. Lam, . Bui, A. Hussein, D. Abbass, and . Essam, Fitness inheritance for noisy evolutionary multi-objective optimization, Proceedings of the 7th annual conference on Genetic and evolutionary computation, pp.779-785, 2005.

E. Burke, M. Gendreau, M. 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, pp.1695-1724, 2013.

E. Burke, G. Kendall, and E. Soubeiga, A tabu-search hyperheuristic for timetabling and rostering, Journal of heuristics, vol.9, pp.451-470, 2003.

K. Edmund, M. Burke, G. Hyde, J. Kendall, and . Woodward, A genetic programming hyperheuristic approach for evolving 2-D strip packing heuristics, IEEE Transactions on Evolutionary Computation, vol.14, pp.942-958, 2010.

L. Calvet, D. Jésica-de-armas, . Masip, and . Juan, Learnheuristics: hybridizing metaheuristics with machine learning for optimization with dynamic inputs, Open Mathematics, vol.15, pp.261-280, 2017.

M. Caserta, E. , and Q. Rico, A cross entropy-Lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times, Computers and Operations Research, vol.36, issue.2, pp.530-548, 2009.

D. Catteeuw, M. Drugan, B. Manderick, and . Ljubljana, Guided Restarts Hill-Climbing, PPSN'14 Parallel ProblemSolving from Nature, pp.313-320, 2014.

D. Chafekar, L. Shi, K. Rasheed, and J. Xuan, Multiobjective GA Optimization Using Reduced Models. Systems, Man, and Cybernetics, Part C: Applications and Reviews, IEEE Transactions on, vol.35, pp.261-265, 2005.

G. Chandrashekar and F. Sahin, A survey on feature selection methods, Computers & Electrical Engineering, vol.40, pp.16-28, 2014.

Y. Chen, P. Cowling, F. Polack, and P. Mourdjis, A multi-arm bandit neighbourhood search for routing and scheduling problems, 2016.

T. Chugh, K. Sindhya, J. Hakanen, and K. Miettinen, A survey on handling computationally expensive multiobjective optimization problems with evolutionary algorithms, Soft Computing, vol.23, pp.3137-3166, 2019.

E. M. Cochrane and . Beasley, The co-adaptive neural network approach to the Euclidean travelling salesman problem, Neural Networks, vol.16, pp.1499-1525, 2003.

D. J. Cook and R. C. Varnell, Maximizing the benefits of parallel search using machine learning, AAAI/IAAI, pp.559-564, 1997.

D. Corne, C. Dhaenens, and L. Jourdan, Synergies between operations research and data mining: The emerging use of multi-objective approaches, European Journal of Operational Research, vol.221, pp.469-479, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00731073

P. Steven, . Coy, L. Bruce, . Golden, C. George et al., Using experimental design to find effective parameter settings for heuristics, Journal of Heuristics, vol.7, pp.77-97, 2001.

T. Gabriel-crainic, M. Hewitt, and W. Rei, Scenario grouping in a progressive hedging-based meta-heuristic for stochastic network design, Computers & Operations Research, vol.43, pp.90-99, 2014.

J. Créput and A. Koukam, The memetic self-organizing map approach to the vehicle routing problem, Soft Computing, vol.12, pp.1125-1141, 2008.

C. Cummins, P. Petoumenos, Z. Wang, and H. Leather, End-to-end deep learning of optimization heuristics, 26th International Conference on Parallel Architectures and Compilation Techniques (PACT, pp.219-232, 2017.

L. Dacosta, A. Fialho, M. Schoenauer, and M. Sebag, Adaptive operator selection with dynamic multi-armed bandits, Proceedings of the 10th annual conference on Genetic and evolutionary computation, pp.913-920, 2008.

. Fl-dalboni, L. Ochi, and . Drummond, On improving evolutionary algorithms by using data mining for the oil collector vehicle routing problem, International Network Optimization Conference, pp.182-188, 2003.

M. R. De-holanda, A. Plastino, and U. Souza, MineReduce for the minimum weight vertex cover problem, OLA'2020 Int. conf. on Optimization and Learning, 2020.

J. Kenneth-de, Parameter setting in EAs: a 30 year perspective, Parameter setting in evolutionary algorithms, pp.1-18, 2007.

C. Dhaenens and L. Jourdan, Metaheuristics for big data, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01418464

F. Dobslaw, A parameter tuning framework for metaheuristics based on design of experiments and artificial neural networks, International Conference on Computer Mathematics and Natural Computing, 2010.

X. Dong, S. Yu, Z. Wu, and Z. Chen, A hybrid parallel evolutionary algorithm based on elite-subspace strategy and space transformation search, High Performance Computing and Applications, pp.139-145, 2010.

M. Dorigo and L. M. Gambardella, Ant colony system: a cooperative learning approach to the traveling salesman problem, IEEE Transactions on evolutionary computation, vol.1, pp.53-66, 1997.

J. Santos, J. D. De-melo, A. Neto, and D. Aloise, Reactive search strategies using reinforcement learning, local search algorithms and variable neighborhood search, Expert Systems with Applications, vol.41, pp.4939-4949, 2014.

M. Drugan, Reinforcement learning versus evolutionary computation: A survey on hybrid algorithms, Swarm and evolutionary computation, vol.44, pp.228-246, 2019.

M. Drugan and E. Talbi, Adaptive Multi-operator MetaHeuristics for quadratic assignment problems, EVOLVE-A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation V, pp.149-163, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01249509

G. Duflo, G. Danoy, E. Talbi, and P. Bouvry, Automated Design of Efficient Swarming Behaviours:a Q-Learning Hyper-Heuristic Approach, OLA'2020 Int. conf. on Optimization and Learning, 2020.

M. Ae-eiben, W. Horvath, . Kowalczyk, C. Martijn, and . Schut, Reinforcement learning for online control of evolutionary algorithms, International Workshop on Engineering Self-Organising Applications, pp.151-160, 2006.

A. E. Eiben and S. K. Smit, Parameter tuning for configuring and analyzing evolutionary algorithms, Swarm and Evolutionary Computation, vol.1, pp.19-31, 2011.

R. S. Engelmore and A. Morgan, Blackboard Systems, 1988.

S. Erdo?an and E. Miller-hooks, A green vehicle routing problem, Transportation Research Part E: Logistics and Transportation Review, vol.48, pp.100-114, 2012.

L. Eriksson, E. Johansson, N. Kettaneh-wold, C. Wikström, and S. Wold, Design of experiments, Principles and Applications, Learn ways AB, 2000.

A. Fahad, N. Alshatri, Z. Tari, A. Alamri, I. Khalil et al., A survey of clustering algorithms for big data: Taxonomy and empirical analysis, IEEE Transactions on Emerging Topics in Computing, vol.2, pp.267-279, 2014.
URL : https://hal.archives-ouvertes.fr/hal-02009335

C. Fan, B. Hou, J. Zheng, L. Xiao, and L. Yi, A surrogate-assisted particle swarm optimization using ensemble learning for expensive problems with small sample datasets, Applied Soft Computing, pp.106-142, 2020.

L. Feng, Y. Ong, M. Lim, and I. W. Tsang, Memetic Search With Interdomain Learning: A Realization Between CVRP and CARP, IEEE Transactions on Evolutionary Computation, vol.19, pp.644-658, 2015.

P. Fournier-viger, J. Chun-wei-lin, B. Vo, T. Truong-chi, J. Zhang et al., A survey of itemset mining, Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery, vol.7, p.1207, 2017.

S. Gao, Y. Wang, J. Cheng, Y. Inazumi, and Z. Tang, Ant colony optimization with clustering for solving the dynamic location routing problem, Appl. Math. Comput, vol.285, pp.149-173, 2016.

S. Wei-feng-gao, L. Liu, and . Huang, Particle swarm optimization with chaotic opposition-based population initialization and stochastic search technique, Communications in Nonlinear Science and Numerical Simulation, vol.17, pp.4316-4327, 2012.

A. Gaspar, -. Cunha, and A. Vieira, A Hybrid Multi-Objective Evolutionary Algorithm Using an Inverse Neural Network, Hybrid Metaheuristics, pp.25-30, 2004.

C. Gebruers, A. Guerri, B. Hnich, and M. Milano, Making choices using structure at the instance level within a case based reasoning framework, International Conference on Integration of Artificial Intelligence (AI) and Operations Research (OR) Techniques in Constraint Programming, pp.380-386, 2004.

S. Geetha, G. Poonthalir, and P. Vanathi, Improved k-means algorithm for capacitated clustering problem, INFOCOMP, vol.8, pp.52-59, 2009.

T. Goel, T. Raphael, W. Haftka, N. V. Shyy, and . Queipo, Ensemble of surrogates. Structural and Multidisciplinary Optimization, vol.33, pp.199-216, 2007.

T. Goel, R. Vaidyanathan, T. Raphael, W. Haftka, . Shyy et al., Response surface approximation of Pareto optimal front in multi-objective optimization, Computer methods in applied mechanics and engineering, vol.196, pp.879-893, 2007.

P. Goyal, H. Malik, and R. Sharma, Application of evolutionary reinforcement learning (erl) approach in control domain: A review, Smart Innovations in Communication and Computational Sciences, pp.273-288, 2019.

A. Gunawan, E. Hoong-chuin-lau, and . Wong, Real-world parameter tuning using factorial design with parameter decomposition, Advances in Metaheuristics, pp.37-59, 2013.

J. Gupta, R. Sexton, and E. Tunc, Selecting scheduling heuristics using neural networks, INFORMS Journal on Computing, vol.12, pp.150-162, 2000.

H. Haipeng and . Guo, Algorithm selection for sorting and probabilistic inference: a machine learning-based approach, 2003.

L. Han and X. He, A novel opposition-based particle swarm optimization for noisy problems, Third IEEE International Conference on Natural Computation (ICNC 2007), vol.3, pp.624-629, 2007.

M. He, P. Kalmbach, A. Blenk, W. Kellerer, and S. Schmid, Algorithm-data driven optimization of adaptive communication networks, 2017 IEEE 25th International Conference on Network Protocols (ICNP, pp.1-6, 2017.

A. Hebbal, L. Brevault, M. Balesdent, . El-ghazali, N. Talbi et al., Bayesian Optimization using Deep Gaussian Processes, 2019.

T. Hong, H. Wang, and W. Chen, Simultaneous applying multiple mutation operators in genetic algorithm, Journal of Heuristics, vol.6, pp.439-455, 2000.

Y. Hong, H. Lee, and M. Tahk, Acceleration of the convergence speed of evolutionary algorithms using multi-layer neural networks, Engineering Optimization, vol.35, pp.91-102, 2003.

P. D. Hough and P. J. Williams, Modern Machine Learning for Automatic Optimization Algorithm Selection, 2006.

X. Hu, F. He, W. Chen, and J. Zhang, Cooperation coevolution with fast interdependency identification for large scale optimization, Information Sciences, vol.381, pp.142-160, 2017.

J. Hunger and G. Huttner, Optimization and analysis of force field parameters by combination of genetic algorithms and neural networks, Journal of Computational Chemistry, vol.20, pp.455-471

F. Hutter, Y. Hamadi, H. Hoos, and K. Leyton-brown, Performance prediction and automated tuning of randomized and parametric algorithms, International Conference on Principles and Practice of Constraint Programming, pp.213-228, 2006.

F. Hutter, H. Holger, K. Hoos, and . Leyton-brown, Sequential model-based optimization for general algorithm configuration, International Conference on Learning and Intelligent Optimization, pp.507-523, 2011.

F. Hutter, H. Holger, K. Hoos, T. Leyton-brown, and . Stützle, ParamILS: an automatic algorithm configuration framework, Journal of Artificial Intelligence Research, vol.36, pp.267-306, 2009.

F. Hutter, L. Xu, H. Holger, K. Hoos, and . Leyton-brown, Algorithm runtime prediction: Methods & evaluation, Artificial Intelligence, vol.206, pp.79-111, 2014.

M. Jiang, Z. Huang, L. Qiu, W. Huang, and G. G. Yen, Transfer Learning-Based Dynamic Multiobjective Optimization Algorithms, IEEE Transactions on Evolutionary Computation, vol.22, pp.501-514, 2018.

X. Jiang, D. Chafekar, and K. Rasheed, Constrained multi-objective ga optimization using reduced models, Genetic and Evolutionary Computation Conference. Workshop Program, pp.174-177, 2003.

X. Jin and R. Reynolds, Using knowledge-based evolutionary computation to solve nonlinear constraint optimization problems: a cultural algorithm approach, Proceedings of the 1999 congress on evolutionary computation-CEC'1999, vol.3, pp.1672-1678, 1999.

Y. Jin, A comprehensive survey of fitness approximation in evolutionary computation, Soft Computing, vol.9, pp.3-12, 2005.

Y. Jin, Surrogate-assisted evolutionary computation: Recent advances and future challenges, Swarm and Evolutionary Computation, vol.1, pp.61-70, 2011.

Y. Jin, M. Olhofer, and B. Sendhoff, A framework for evolutionary optimization with approximate fitness functions, IEEE Transactions on evolutionary computation, vol.6, pp.481-494, 2002.

Y. Jin and B. Sendhoff, Reducing fitness evaluations using clustering techniques and neural network ensembles, Genetic and Evolutionary Computation GECCO'2004, pp.688-699, 2004.

M. Donald-r-jones, W. J. Schonlau, and . Welch, Efficient global optimization of expensive black-box functions, Journal of Global optimization, vol.13, pp.455-492, 1998.

L. Jourdan, D. Corne, D. Savic, and G. Walters, Preliminary investigation of the learnable evolution model for faster/better multiobjective water systems design, International Conference on Evolutionary Multi-Criterion Optimization, pp.841-855, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00001170

L. Jourdan, C. Dhaenens, and E. Talbi, Using data mining techniques to help metaheuristics: A short survey, Hybrid Metaheuristics (HM'2006), vol.4030, pp.57-69, 2006.

M. Kalakrishnan, P. Pastor, L. Righetti, and S. Schaal, Learning objective functions for manipulation, 2013 IEEE International Conference on Robotics and Automation, pp.1331-1336, 2013.

B. Kazimipour, X. Li, and A. Qin, A review of population initialization techniques for evolutionary algorithms, Evolutionary Computation (CEC), pp.2585-2592, 2014.

H. Khadilkar, A Scalable Reinforcement Learning Algorithm for Scheduling Railway Lines, IEEE Transactions on Intelligent Transportation Systems, vol.99, pp.1-11, 2018.

E. Khalil, H. Dai, Y. Zhang, B. Dilkina, and L. Song, Learning combinatorial optimization algorithms over graphs, Advances in Neural Information Processing Systems, pp.6348-6358, 2017.

E. Kieffer, G. Danoy, M. Brust, P. Bouvry, and A. Nagih, Tackling large-scale and combinatorial bi-level problems with a genetic programming hyper-heuristic, IEEE Transactions on Evolutionary Computation, 2019.

H. Kim and S. Cho, An efficient genetic algorithm with less fitness evaluation by clustering, Congress on Evolutionary Computation CEC'01, pp.887-894, 2001.

J. Knowles, ParEGO: a hybrid algorithm with on-line landscape approximation for expensive multiobjective optimization problems, IEEE Transactions on Evolutionary Computation, vol.10, issue.1, pp.50-66, 2006.

L. Kotthoff, Algorithm selection for combinatorial search problems: A survey, Data Mining and Constraint Programming, pp.149-190, 2016.

P. Laborie and D. Godard, Self-adapting large neighborhood search: Application to single-mode scheduling problems, Proceedings MISTA-07, vol.8, 2007.

W. Laesanklang and D. Landa-silva, Decomposition techniques with mixed integer programming and heuristics for home healthcare planning, Annals of operations research, vol.256, pp.93-127, 2017.

L. Hoong-chuin and F. Xiao, Enhancing the speed and accuracy of automated parameter tuning in heuristic design, 2009.

S. Lessmann, M. Caserta, and I. Montalvo-arango, Tuning metaheuristics: A data mining based approach for particle swarm optimization, Expert Systems with Applications, vol.38, pp.12826-12838, 2011.

X. Shing-wa-leung, . Zhang, and . Shiu-yin-yuen, Multiobjective differential evolution algorithm with oppositionbased parameter control, IEEE Congress on Evolutionary Computation, pp.1-8, 2012.

Y. Leung and Y. Wang, An orthogonal genetic algorithm with quantization for global numerical optimization, IEEE Transactions on Evolutionary computation, vol.5, pp.41-53, 2001.

K. Leyton-brown, E. Nudelman, and Y. Shoham, Learning the empirical hardness of optimization problems: The case of combinatorial auctions, International Conference on Principles and Practice of Constraint Programming, pp.556-572, 2002.

K. Leyton-brown, E. Nudelman, and Y. Shoham, Empirical hardness models: Methodology and a case study on combinatorial auctions, Journal of the ACM (JACM), vol.56, pp.1-52, 2009.

X. Li and S. Olafsson, Discovering dispatching rules using data mining, Journal of Scheduling, vol.8, pp.515-527, 2005.

L. Liu and M. Dessouky, A decomposition based hybrid heuristic algorithm for the joint passenger and freight train scheduling problem, Computers & Operations Research, vol.87, pp.165-182, 2017.

Z. Liu and F. Forouzanfar, Ensemble clustering for efficient robust optimization of naturally fractured reservoirs, Computational Geosciences, vol.22, pp.283-296, 2018.

I. Loshchilov, M. Schoenauer, and M. Sebag, Self-adaptive surrogate-assisted covariance matrix adaptation evolution strategy, Proceedings of the 14th annual conference on Genetic and evolutionary computation, pp.321-328, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00686570

S. Louis and J. Mcdonnell, Learning with case-injected genetic algorithms, IEEE Transactions on Evolutionary Computation, vol.8, pp.316-328, 2004.

X. Ma, F. Liu, Y. Qi, M. Gong, M. Yin et al., MOEA/D with opposition-based learning for multiobjective optimization problem, Neurocomputing, vol.146, pp.48-64, 2014.

S. Mahdavi, S. Rahnamayan, and M. E. Shiri, Incremental cooperative coevolution for large-scale global optimization, Soft Computing, vol.22, pp.2045-2064, 2018.

R. Mallipeddi and P. N. Suganthan, Ensemble of constraint handling techniques, IEEE Transactions on Evolutionary Computation, vol.14, pp.561-579, 2010.

H. Mao, M. Alizadeh, I. Menache, and S. Kandula, Resource management with deep reinforcement learning, Proceedings of the 15th ACM Workshop on Hot Topics in Networks, pp.50-56, 2016.

S. Meisel and D. C. Mattfeld, Synergies of data mining and operations research, System Sciences, 2007. HICSS 2007. 40th Annual Hawaii International Conference on, pp.56-56, 2007.

O. Mersmann, B. Bischl, H. Trautmann, M. Preuss, C. Weihs et al., Exploratory landscape analysis, Proceedings of the 13th annual conference on Genetic and evolutionary computation, pp.829-836, 2011.

R. S. Michalski, Learnable evolution model: Evolutionary processes guided by machine learning, Machine Learning, vol.38, pp.9-40, 2000.

S. Miki, D. Yamamoto, and H. Ebara, Applying Deep Learning and Reinforcement Learning to Traveling Salesman Problem, 2018 International Conference on Computing, Electronics & Communications Engineering (iCCECE, pp.65-70, 2018.

M. M?s?r, S. Handoko, and H. C. Lau, OSCAR: Online selection of algorithm portfolios with case study on memetic algorithms, International Conference on Learning and Intelligent Optimization, pp.59-73, 2015.

A. Modares, S. Somhom, and T. Enkawa, A self-organizing neural network approach for multiple traveling salesman and vehicle routing problems, International Transactions in Operational Research, vol.6, pp.591-606, 1999.

J. Mueller and J. Woodbury, GOSAC: global optimization with surrogate approimation of constraints, Journal of Global Optimization, vol.69, 2017.

A. Nareyek, Choosing search heuristics by non-stationary reinforcement learning, Metaheuristics: Computer decision-making, pp.523-544, 2003.

M. M. Nasiri, S. Salesi, A. Rahbari, N. S. Meydani, and M. Abdollai, A data mining approach for population-based methods to solve the JSSP

M. Nazari, A. Oroojlooy, L. Snyder, and M. Takác, Reinforcement learning for solving the vehicle routing problem, Advances in Neural Information Processing Systems, pp.9839-9849, 2018.

R. S. Niculescu, T. Mitchell, and R. B. Rao, Bayesian network learning with parameter constraints, Journal of machine learning research, vol.7, pp.1357-1383, 2006.

J. Ortiz-bayliss, H. Terashima-marín, and S. Conant-pablos, A supervised learning approach to construct hyper-heuristics for constraint satisfaction, Mexican Conference on Pattern Recognition, pp.284-293, 2013.

J. Ortiz-bayliss, H. Terashima-marín, and S. Conant-pablos, Using learning classifier systems to design selective hyper-heuristics for constraint satisfaction problems, Evolutionary Computation (CEC), pp.2618-2625, 2013.

J. Ortiz-bayliss, H. Terashima-marín, P. Ross, and S. Conant-pablos, Evolution of neural networks topologies and learning parameters to produce hyper-heuristics for constraint satisfaction problems, Proceedings of the 13th annual conference companion on Genetic and evolutionary computation, pp.261-262, 2011.

A. Ostertag, K. Doerner, and R. Hartl, A variable neighborhood search integrated in the POPMUSIC framework for solving large scale vehicle routing problems, International Workshop on Hybrid Metaheuristics, pp.29-42, 2008.

E. Özcan, M. Misir, G. Ochoa, and E. Burke, A Reinforcement Learning: Great-Deluge Hyper-Heuristic for Examination Timetabling, Modeling, Analysis, and Applications in Metaheuristic Computing: Advancements and Trends, pp.34-55, 2012.

M. Pal, S. Saha, and S. Bandyopadhyay, DECOR: Differential Evolution using Clustering based Objective Reduction for many-objective optimization, Information Sciences, vol.423, pp.200-218, 2018.

M. Pant, M. Ali, P. Ved, and . Singh, Differential evolution using quadratic interpolation for initializing the population, 2009 IEEE International Advance Computing Conference, pp.375-380, 2009.

S. Park and J. Lee, Improvement of a multi-objective differential evolution using clustering algorithm, 2009 IEEE International Symposium on Industrial Electronics. IEEE, pp.1213-1217, 2009.

J. M. Parr, C. M. Holden, A. I. Forrester, and A. J. Keane, Review of efficient surrogate infill sampling criteria with constraint handling, 2010.

R. Patterson, E. Rolland, and H. Pirkul, A memory adaptive reasoning technique for solving the capacitated minimum spanning tree problem, Journal of Heuristics, vol.5, pp.159-180, 1999.

R. Pavon, F. Diaz, R. Laza, and V. Luzon, Automatic parameter tuning with a Bayesian case-based reasoning system. A case of study, Expert Systems with Applications, vol.36, pp.3407-3420, 2009.

M. Pelikan, D. Goldberg, and F. Lobo, A survey of optimization by building and using probabilistic models, Computational optimization and applications, vol.21, pp.5-20, 2002.

M. Pelikan and K. Sastry, Fitness inheritance in the Bayesian optimization algorithm, Genetic and Evolutionary Computation Conference, pp.48-59, 2004.

M. Pelikan, K. Sastry, and D. Goldberg, Multiobjective hBOA, Clustering, and Scalability. GECCO 2005 -Genetic and Evolutionary Computation Conference, 2005.

J. Pena, J. Lozano, and P. Larranaga, Globally Multimodal Problem Optimization Via an Estimation of Distribution Algorithm Based on Unsupervised Learning of Bayesian Networks, Evolutionary Computation, vol.13, pp.43-66, 2005.

J. Peña, J. Lozano, and P. Larrañaga, Globally multimodal problem optimization via an estimation of distribution algorithm based on unsupervised learning of Bayesian networks, Evolutionary Computation, vol.13, pp.43-66, 2005.

J. Daniel-cosmin-porumbel, P. Hao, and . Kuntz, A search space cartography for guiding graph coloring heuristics, Computers and Operations Research, vol.37, pp.769-778, 2010.

J. Potvin and S. R. Thangiah, Vehicle Routing through Simulation, Fusion of Neural Networks, Fuzzy Systems and Genetic Algorithms: Industrial Applications, 2020.

B. Warren and . Powell, Approximate Dynamic Programming: Solving the curses of dimensionality, vol.703, 2007.

R. Priem, N. Bartoli, and Y. Diouane, On the Use of Upper Trust Bounds in Constrained Bayesian Optimization Infill Criteria, AIAA Aviation, 2019.

P. Priore, D. De-la-fuente, J. Puente, and J. Parreño, A comparison of machine-learning algorithms for dynamic scheduling of flexible manufacturing systems, Engineering Applications of Artificial Intelligence, vol.19, issue.3, pp.247-255, 2006.

T. El-ghazali,

L. Pulina and A. Tacchella, A multi-engine solver for quantified boolean formulas, International Conference on Principles and Practice of Constraint Programming, pp.574-589, 2007.

S. Rahnamayan, H. Tizhoosh, and M. Salama, Opposition-based differential evolution, IEEE Transactions on Evolutionary computation, vol.12, pp.64-79, 2008.

C. O. Iloneide, M. C. Ramos, E. G. Goldbarg, A. Goldbarg, and . Neto, Logistic regression for parameter tuning on an evolutionary algorithm, IEEE Congress on Evolutionary Computation, vol.2, pp.1061-1068, 2005.

K. Rasheed and H. Hirsh, Informed operators: Speeding up genetic-algorithm-based design optimization using reduced models, Proceedings of the 2nd Annual Conference on Genetic and Evolutionary Computation, pp.628-635, 2000.

K. Rasheed, S. Vattam, and X. Ni, Comparison of methods for developing dynamic reduced models for design optimization, CEC'2002 Congress on Evolutionary Computation, pp.390-395, 2002.

J. Rasku, T. Kärkkäinen, and N. Musliu, Feature extractors for describing vehicle routing problem instances, OASICS, vol.50, 2016.

G. Rommel and . Regis, Constrained optimization by radial basis function interpolation for high-dimensional expensive black-box problems with infeasible initial points, Engineering Optimization, vol.46, pp.218-243, 2014.

G. Rommel and . Regis, Evolutionary programming for high-dimensional constrained expensive black-box optimization using radial basis functions, IEEE Transactions on Evolutionary Computation, vol.18, pp.326-347, 2014.

G. Rommel, C. A. Regis, and . Shoemaker, Local function approximation in evolutionary algorithms for the optimization of costly functions, IEEE transactions on evolutionary computation, vol.8, pp.490-505, 2004.

M. Reimann, K. Doerner, and R. Hartl, D-ants: Savings Based Ants Divide and Conquer the Vehicle Routing Problem, vol.31, pp.563-591, 2004.

R. G. Reynolds, Z. Michalewicz, and B. Peng, Cultural algorithms: Computational modeling of how cultures learn to solve problems-an engineering example, Cybernetics and Systems, vol.36, pp.753-771, 2005.

M. H. Ribeiro, A. Plastino, and S. Martins, Hybridization of GRASP metaheuristic with data mining techniques, Journal of Mathematical Modelling and Algorithms, vol.5, issue.1, pp.23-41, 2006.

M. H. Ribeiro, V. Trindade, A. Plastino, and S. L. Martins, Hybridization of GRASP Metaheuristics with Data Mining Techniques, Hybrid Metaheuristics, 2004.

J. R. Rice, The algorithm selection problem, Advances in Computers, vol.15, pp.65-118, 1976.

N. Rojas-morales, M. Rojas, and E. M. Ureta, A survey and classification of opposition-based metaheuristics, Computers & Industrial Engineering, vol.110, pp.424-435, 2017.

T. Philip-runarsson, Learning heuristic policies-a reinforcement learning problem, International Conference on Learning and Intelligent Optimization, pp.423-432, 2011.

N. Sabar, M. Ayob, G. Kendall, and R. Qu, Automatic design of a hyper-heuristic framework with gene expression programming for combinatorial optimization problems, IEEE Trans. Evolutionary Computation, vol.19, pp.309-325, 2015.

G. Haroldo, L. Santos, . Satoru-ochi, L. Euler-horta-marinho, and . Drummond, Combining an evolutionary algorithm with data mining to solve a single-vehicle routing problem, Neurocomputing, vol.70, pp.70-77, 2006.

K. Sastry and D. E. Goldberg, Designing Competent Mutation Operators Via Probabilistic Model Building of Neighborhoods, Genetic and Evolutionary Computation -GECCO 2004, Kalyanmoy Deb, pp.114-125, 2004.

K. Sastry, D. E. Goldberg, and M. Pelikan, Don't evaluate, inherit, Proceedings of the 3rd Annual Conference on Genetic and Evolutionary Computation, pp.551-558, 2001.

A. Dhish-kumar-saxena, A. Duro, K. Tiwari, Q. Deb, and . Zhang, Objective Reduction in Many-Objective Optimization: Linear and Nonlinear Algorithms, Trans. Evol. Comp, vol.17, pp.77-99, 2013.

M. Sebag, M. Schoenauer, and C. Ravise, Inductive Learning of Mutation Step-Size in Evolutionary Parameter Optimization, Evolutionary Programming, 1997.
URL : https://hal.archives-ouvertes.fr/hal-00116479

A. Shahzad and N. Mebarki, Data mining based job dispatching using hybrid simulation-optimization approach for shop scheduling problem, Engineering Applications of Artificial Intelligence, vol.25, pp.1173-1181, 2012.

S. Shakya and J. Mccall, Optimization by estimation of distribution with DEUM framework based on Markov random fields, International Journal of Automation and Computing, vol.4, pp.262-272, 2007.

C. Shang and F. You, A data-driven robust optimization approach to scenario-based stochastic model predictive control, Journal of Process Control, vol.75, pp.24-39, 2019.

G. Shankar and V. Mukherjee, Quasi oppositional harmony search algorithm based controller tuning for load frequency control of multi-source multi-area power system, International Journal of Electrical Power & Energy Systems, vol.75, pp.289-302, 2016.

L. Shi and K. Rasheed, ASAGA: an adaptive surrogate-assisted genetic algorithm, Proceedings of the 10th annual conference on Genetic and evolutionary computation, pp.1049-1056, 2008.

G. Chandan-kumar-shiva, V. Shankar, and . Mukherjee, Automatic generation control of power system using a novel quasi-oppositional harmony search algorithm, International Journal of Electrical Power & Energy Systems, vol.73, pp.787-804, 2015.

Y. Shiyou, Q. Liu, J. Lu, S. L. Ho, G. Ni et al., Application of Support Vector Machines to Accelerate the Solution Speed of Metaheuristic Algorithms. Magnetics, IEEE Transactions on, vol.45, pp.1502-1505, 2009.

T. Si, A. De, and A. Bhattacharjee, Particle swarm optimization with generalized opposition based learning in particle's pbest position, 2014 International Conference on Circuits, Power and Computing Technologies, pp.1662-1667, 2014.

E. Robert, . Smith, A. Bruce, S. A. Dike, and . Stegmann, Fitness inheritance in genetic algorithms, Proceedings of the 1995 ACM symposium on Applied computing, pp.345-350, 1995.

K. Smith-miles and J. Van-hemert, Discovering the suitability of optimisation algorithms by learning from evolved instances, Annals of Mathematics and Artificial Intelligence, vol.61, pp.87-104, 2011.

K. A. Smith-miles, Cross-disciplinary perspectives on meta-learning for algorithm selection, ACM Computing Surveys (CSUR), vol.41, pp.1-25, 2009.

C. Soza, R. L. Becerra, M. Cristina-riff, and C. Coello, Solving timetabling problems using a cultural algorithm, Applied Soft Computing, vol.11, pp.337-344, 2011.

S. Sra, S. Nowozin, and S. Wright, Optimization for machine learning, 2012.

S. Srivastava, B. Pathak, and K. Srivastava, Neural network embedded multiobjective genetic algorithm to solve non-linear time-cost tradeoff problems of project scheduling, Journal of scientific and industrial research, vol.67, p.124, 2008.

S. Richard, A. G. Sutton, and . Barto, Introduction to reinforcement learning, vol.135, 1998.

E. Talbi, Metaheuristics: from design to implementation, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00750681

. El-ghazali and . Talbi, Combining metaheuristics with mathematical programming, constraint programming and machine learning, Annals of Operations Research, vol.240, pp.171-215, 2016.

H. Kay-chen-tan, S. Tang, and . Sam-ge, On parameter settings of Hopfield networks applied to traveling salesman problems, IEEE Transactions on Circuits and Systems I: Regular Papers, vol.52, pp.994-1002, 2005.

Y. Tenne and C. Goh, Computational intelligence in expensive optimization problems, vol.2, 2010.

S. Thevenin and N. Zufferey, Learning Variable Neighborhood Search for a scheduling problem with time windows and rejections, Discrete Applied Mathematics, vol.261, pp.344-353, 2019.

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

D. Thierens, A. N. Peter, and . Bosman, Learning the Neighborhood with the Linkage Tree Genetic Algorithm, Learning and Intelligent Optimization, pp.491-496, 2012.

M. Hamid-r-tizhoosh, S. Ventresca, and . Rahnamayan, Opposition-based computing, Oppositional Concepts in Computational Intelligence, pp.11-28, 2008.

A. Tuson and P. Ross, Adapting operator settings in genetic algorithms, Evolutionary Computation, vol.6, pp.161-184, 1998.

D. Tuzun, M. A. Magent, and L. I. Burke, Selection of vehicle routing heuristic using neural networks, International Transactions in Operational Research, vol.4, pp.211-221, 1997.

R. Tyasnurita, E. Özcan, and R. John, Learning heuristic selection using a time delay neural network for open vehicle routing, IEEE Congress on Evolutionary Computation (CEC, pp.1474-1481, 2017.

H. Ulmer, F. Streichert, and A. Zell, Evolution strategies assisted by Gaussian processes with improved preselection criterion, The 2003 Congress on Evolutionary Computation, 2003. CEC'03, vol.1, pp.692-699, 2003.

F. Vanderbeck, A. Laurence, and . Wolsey, Reformulation and decomposition of integer programs, 50 Years of Integer Programming, pp.431-502, 1958.
URL : https://hal.archives-ouvertes.fr/inria-00392254

J. Vermorel and M. Mohri, Multi-armed bandit algorithms and empirical evaluation, European conference on machine learning, pp.437-448, 2005.

O. Vinyals, M. Fortunato, and N. Jaitly, Pointer networks, Advances in Neural Information Processing Systems, pp.2692-2700, 2015.

C. Voudouris, P. K. Edward, and . Tsang, Guided local search, Handbook of metaheuristics, pp.185-218, 2003.

G. Wang and S. Shan, Review of metamodeling techniques in support of engineering design optimization, Journal of Mechanical design, vol.129, pp.370-380, 2007.

H. Wang, H. Li, Y. Liu, C. Li, and S. Zeng, Opposition-based particle swarm algorithm with Cauchy mutation, IEEE Congress on Evolutionary Computation, pp.4750-4756, 2007.

T. El-ghazali,

H. Wang, Z. Wu, S. Rahnamayan, Y. Liu, and M. Ventresca, Enhancing particle swarm optimization using generalized opposition-based learning, Information Sciences, vol.181, pp.4699-4714, 2011.

J. Wang, Enhanced differential evolution with generalised opposition-based learning and orientation neighbourhood mining, International Journal of Computing Science and Mathematics, vol.6, pp.49-58, 2015.

B. Waschneck, A. Reichstaller, L. Belzner, T. Altenmüller, T. Bauernhansl et al., Optimization of global production scheduling with deep reinforcement learning, Procedia CIRP, vol.72, pp.1264-1269, 2018.

J. Christopher, P. Watkins, and . Dayan, Q-learning, Machine learning, vol.8, pp.279-292, 1992.

J. William, M. Welch, and . Schonlau, Computer experiments and global optimization, 1997.

U. Wen, K. Lan, and H. Shih, A review of Hopfield neural networks for solving mathematical programming problems, European Journal of Operational Research, vol.198, pp.675-687, 2009.

M. Wistuba, N. Schilling, and L. Schmidt-thieme, Scalable gaussian process-based transfer surrogates for hyperparameter optimization, Machine Learning, vol.107, pp.43-78, 2018.

D. Wolpert and W. Macready, No free lunch theorems for optimization, IEEE transactions on evolutionary computation, vol.1, pp.67-82, 1997.

L. Xu, F. Hutter, H. Hoos, and K. Leyton-brown, SATzilla: portfolio-based algorithm selection for SAT, Journal of artificial intelligence research, vol.32, pp.565-606, 2008.

Y. Xu, D. Stern, and H. Samulowitz, Learning adaptation to solve constraint satisfaction problems, Proceedings of Learning and Intelligent Optimization, 2009.

T. Yalcinoz, B. J. Cory, and M. J. Short, Hopfield neural network approaches to economic dispatch problems, pp.435-442, 2001.

S. Yazdani and J. Shanbehzadeh, Balanced Cartesian Genetic Programming via migration and opposition-based learning: application to symbolic regression. Genetic Programming and Evolvable Machines, vol.16, pp.133-150, 2015.

E. Yolcu and B. Poczos, Learning Local Search Heuristics for Boolean Satisfiability, Advances in Neural Information Processing Systems, pp.7990-8001, 2019.

S. Yoo and S. Cho, Partially evaluated genetic algorithm based on fuzzy c-means algorithm, International Conference on Parallel Problem Solving from Nature, pp.440-449, 2004.

S. Yu, A. Aleti, J. C. Barca, and A. Song, Hyper-heuristic online learning for self-assembling swarm robots, International Conference on Computational Science, pp.167-180, 2018.

C. K. Shiu-yin-yuen and . Chow, A genetic algorithm that adaptively mutates and never revisits, IEEE transactions on evolutionary computation, vol.13, pp.454-472, 2009.

M. Zennaki and A. Ech-cherif, A new machine learning based approach for tuning metaheuristics for the solution of hard combinatorial optimization problems, Journal of Applied Sciences(Faisalabad), vol.10, pp.1991-2000, 2010.

D. Zhan and Y. Cheng, Expected improvement matrix-based infill criteria for expensive multiobjective optimization, IEEE Transactions on Evolutionary Computation, vol.21, pp.956-975, 2017.

H. Zhang and J. Lu, Adaptive evolutionary programming based on reinforcement learning, Information Sciences, vol.178, issue.4, pp.971-984, 2008.

J. Zhang, H. Chung, and W. Lo, Clustering-based adaptive crossover and mutation probabilities for genetic algorithms, IEEE Transactions on Evolutionary Computation, vol.11, pp.326-335, 2007.

J. Zhang, Y. Yim, and J. Yang, Intelligent selection of instances for prediction functions in lazy learning algorithms, Lazy learning, pp.175-191, 1997.

J. Zhang, Y. Zhi-hui-zhan, N. Lin, Y. Chen, J. Gong et al., Evolutionary computation meets machine learning: A survey, IEEE Computational Intelligence Magazine, vol.6, pp.68-75, 2011.

K. Zhang, Z. Han, Z. Gao, and Y. Wang, Constraint aggregation for large number of constraints in wing surrogate-based optimization. Structural and Multidisciplinary Optimization, vol.59, pp.421-438, 2019.

W. Zhang, G. Thomas, and . Dietterich, A reinforcement learning approach to job-shop scheduling, In IJCAI, vol.95, pp.1114-1120, 1995.

Z. Zhou, Y. Ong, M. H. Nguyen, and D. Lim, A study on polynomial regression and Gaussian Process global surrogate model in hierarchical surrogate-assisted evolutionary algorithm, IEEE Congress on Evolutionary Computation, vol.3, pp.2832-2839, 2005.