Di Tollo, G., Lardeux, F., Maturana, J., & Saubion, F. (2015). An experimental study of adaptive control for evolutionary algorithms. *Applied Soft Computing*, 35, 359–372.

Díaz-Manríquez, A., Toscano, G., & Coello, C. A. C. (2017). Comparison of metamodeling techniques in evolutionary algorithms. *Soft Computing*, 21(19), 5647–5663.

Díaz-Parra, O., Ruiz-Vanoye, J. A., & Zavala-Díaz, J. C. (2010). Population pre-selection operators used for generating a non-random initial population to solve vehicle routing problem with time windows. *Scientific Research and Essays*, 5(22), 3529–3537.

Dobslaw, F. (2010). A parameter tuning framework for metaheuristics based on design of experiments and artificial neural networks. In *International conference on computer mathematics and natural computing* (pp. 1–4). WASET.

Domanski, P. A., Yashar, D., Kaufman, K. A., & Michalski, R. S. (2004). An optimized design of finned-tube evaporators using the learnable evolution model. *Hvac&R Research*, 10(2), 201–211.

Dorigo, M., & Blum, C. (2005). Ant colony optimization theory: A survey. *Theoretical computer science*, 344(2–3), 243–278.

Drake, J. H., Kheiri, A., Özcan, E., & Burke, E. K. (2019). Recent advances in selection hyper-heuristics. *European Journal of Operational Research*, 285(2), 405–428.

Dueck, G. (1993). New optimization heuristics: The great deluge algorithm and the record-to-record travel. *Journal of Computational physics*, 104(1), 86–92.

Eiben, Á. E., Hinterding, R., & Michalewicz, Z. (1999). Parameter control in evolutionary algorithms. *IEEE Transactions on evolutionary computation*, 3(2), 124–141.

Emrouznejad, A. (2016). *Big data optimization: Recent developments and challenges*: 18. Springer.

Fairee, S., Khomtraporn, C., Prom-on, S., & Sirinaovakul, B. (2019). Combinatorial artificial bee colony optimization with reinforcement learning updating for travelling salesman problem. In *2019 16th international conference on electrical engineering/electronics, computer, telecommunications and information technology (ec-ti-con)* (pp. 93–96). IEEE.

Feo, T. A., & Resende, M. G. (1995). Greedy randomized adaptive search procedures. *Journal of global optimization*, 6(2), 109–133.

Fialho, Á. (2010). *Adaptive operator selection for optimization*. Université Paris Sud – Paris XI Ph.D. thesis.

Fialho, Á., Da Costa, L., Schoenauer, M., & Sebag, M. (2008). Extreme value based adaptive operator selection. In *International conference on parallel problem solving from nature* (pp. 175–184). Springer.

Francesca, G., Pellegrini, P., Stützle, T., & Birattari, M. (2011). Off-line and on-line tuning: a study on operator selection for a memetic algorithm applied to the gap. In *European conference on evolutionary computation in combinatorial optimization* (pp. 203–214). Springer.

Gagliolo, M., & Schmidhuber, J. (2010). Algorithm selection as a bandit problem with unbounded losses. In *International conference on learning and intelligent optimization* (pp. 82–96). Springer.

Gambella, C., Ghaddar, B., & Naoum-Sawaya, J. (2020). *Optimization problems for machine learning: A survey*. *European Journal of Operational Research*. https://doi.org/10.1016/j.ejor.2020.08.045.

Gao, S., Wang, Y., Cheng, J., Inazumi, Y., & Tang, Z. (2016). Ant colony optimization with clustering for solving the dynamic location routing problem. *Applied Mathematics and Computation*, 285, 149–173.

Geem, Z. W., Kim, J. H., & Loganathan, G. V. (2001). A new heuristic optimization algorithm: Harmony search. *simulation*, 76(2), 60–68.

(2010). In M. Gendreau, & J.-Y. Potvin (Eds.), *Handbook of metaheuristics*. Springer US.

Glover, F., & Laguna, M. (1998). Tabu search. In *Handbook of combinatorial optimization* (pp. 2093–2229). Springer.

Gocken, T., & Yaktubay, M. (2019). Comparison of different clustering algorithms via genetic algorithm for VRPTW. *International Journal of Simulation Modeling*, 18(4), 574–585.

González-Juárez, D., & Andrés-Pérez, E. (2019). Study of the influence of the initial a priori training dataset size in the efficiency and convergence of surrogate-based evolutionary optimization. In *Evolutionary and deterministic methods for design optimization and control with applications to industrial and societal problems* (pp. 181–194). Springer.

Gretsista, A., & Burke, E. K. (2017). An iterated local search framework with adaptive operator selection for nurse rostering. In *International conference on learning and intelligent optimization* (pp. 93–108). Springer.

Gunawan, A., Lau, H. C., & Lu, K. (2018). Adopt: Combining parameter tuning and adaptive operator ordering for solving a class of orienteering problems. *Computers & Industrial Engineering*, 121, 82–96.

Gutierrez-Rodríguez, A. E., Conant-Pablos, S. E., Ortiz-Bayliss, J. C., & Terashima-Marín, H. (2019). Selecting meta-heuristics for solving vehicle routing problems with time windows via meta-learning. *Expert Systems with Applications*, 118, 470–481.

Haghighi, M. M. S., Zahedi, M. H., & Ghazizadeh, M. (2010). A multi level priority clustering ga based approach for solving heterogeneous vehicle routing problem (pcgvrp). In *Innovations and advances in computer sciences and engineering* (pp. 331–335). Springer.

Handoko, S. D., Nguyen, D. T., Yuan, Z., & Lau, H. C. (2014). Reinforcement learning for adaptive operator selection in memetic search applied to quadratic assignment problem. In *Proceedings of the companion publication of the 2014 annual conference on genetic and evolutionary computation* (pp. 193–194).

Hao, J.-h., & Liu, M. (2014). A surrogate modelling approach combined with differential evolution for solving bottleneck stage scheduling problems. In *2014 world automation congress (WAC)* (pp. 120–124). IEEE.

Hao, J.-h., Liu, M., Lin, J.-h., & Wu, C. (2016). A hybrid differential evolution approach

based on surrogate modelling for scheduling bottleneck stages. *Computers & Operations Research*, 66, 215–224.

Hassanat, A. B., Prasath, V., Abbadi, M. A., Abu-Qdari, S. A., & Faris, H. (2018). An improved genetic algorithm with a new initialization mechanism based on regression techniques. *Information*, 9(7), 167.

van Hemert, J. I. (2006). Evolving combinatorial problem instances that are difficult to solve. *Evolutionary Computation*, 14(4), 433–462.

Hertz, A., & de Werra, D. (1990). The tabu search metaheuristic: How we used it. *Annals of Mathematics and Artificial Intelligence*, 1(1–4), 111–121.

Holland, J. H., et al. (1992). *Adaptation in natural and artificial systems: An introduc-tory analysis with applications to biology, control, and artificial intelligence*. MIT press.

Hong, T.-P., Wang, H.-S., Lin, W.-Y., & Lee, W.-Y. (2002). Evolution of appropriate crossover and mutation operators in a genetic process. *Applied Intelligence*, 16(1), 7–17.

Hoos, H. H. (2011). Automated algorithm configuration and parameter tuning. In *Autonomous search* (pp. 37–71). Springer.

Hoos, H. H., Peitl, T., Slivovsky, F., & Szeider, S. (2018). Portfolio-based algorithm selection for circuit QBFS. In *International conference on principles and practice of constraint programming* (pp. 195–209). Springer.

Horng, S.-C., Lin, S.-Y., Lee, L. H., & Chen, C.-H. (2013). Memetic algorithm for real-time combinatorial stochastic simulation optimization problems with performance analysis. *IEEE Transactions on Cybernetics*, 43(5), 1495–1509.

Huang, C., Li, Y., & Yao, X. (2019). A survey of automatic parameter tuning methods for metaheuristics. *IEEE Transactions on Evolutionary Computation*, 24(2), 201–216.

Hutter, F., Hamadi, Y., Hoos, H. H., & Leyton-Brown, K. (2006). Performance prediction and automated tuning of randomized and parametric algorithms. In *International conference on principles and practice of constraint programming* (pp. 213–228). Springer.

Jin, Y. (2005). A comprehensive survey of fitness approximation in evolutionary computation. *Soft Computing*, 9(1), 3–12.

Jin, Y. (2011). Surrogate-assisted evolutionary computation: Recent advances and future challenges. *Swarm and Evolutionary Computation*, 1(2), 61–70.

Jin, Y., & Sendhoff, B. (2004). Reducing fitness evaluations using clustering techniques and neural network ensembles. In *Genetic and evolutionary computation conference* (pp. 688–699). Springer.

Johnson, D. S., Papadimitriou, C. H., & Yannakakis, M. (1988). How easy is local search? *Journal of Computer and System Sciences*, 37(1), 79–100.

Jourdan, L., Corne, D., Savic, D., & Walters, G. (2005). Preliminary investigation of the 'learnable evolution model' for faster/better multiobjective water systems design. In *International conference on evolutionary multi-criterion optimization* (pp. 841–855). Springer.

Jourdan, L., Dhaenens, C., & Talbi, E.-G. (2006). Using datamining techniques to help metaheuristics: A short survey. In *International workshop on hybrid metaheuristics* (pp. 57–69). Springer.

Jung, D., Kang, D., & Kim, J. H. (2018). Development of a hybrid harmony search for water distribution system design. *KSCE Journal of Civil Engineering*, 22(4), 1506–1514.

Kadioglu, S., Malitsky, Y., Sabharwal, A., Samulowitz, H., & Sellmann, M. (2011). Algorithm selection and scheduling. In *International conference on principles and practice of constraint programming* (pp. 454–469). Springer.

Kanda, J., Carvalho, A., Hruschka, E., & Soares, C. (2011a). Selection of algorithms to solve traveling salesman problems using meta-learning. In *International Journal of Hybrid Intelligent Systems*, 8(3), 117–128.

Kanda, J., de Carvalho, A., Hruschka, E., Soares, C., & Brazdil, P. (2016). Meta-learning to select the best meta-heuristic for the traveling salesman problem: A comparison of meta-features. *Neurocomputing*, 205, 393–406.

Kanda, J., Soares, C., Hruschka, E., & De Carvalho, A. (2012). A meta-learning approach to select meta-heuristics for the traveling salesman problem using MLP-based label ranking. In *International conference on neural information processing* (pp. 488–495). Springer.

Kanda, J. Y., de Carvalho, A. C., Hruschka, E. R., & Soares, C. (2011b). Using meta-learning to recommend meta-heuristics for the traveling salesman problem. In *2011 10th international conference on machine learning and applications and workshops: 1* (pp. 346–351). IEEE.

Karaboga, D. (2005). An idea based on honey bee swarm for numerical optimization. *Technical Report*, Citeseer.

Karafotias, G., Hoogendoorn, M., & Eiben, Á. E. (2014). Parameter control in evolutionary algorithms: Trends and challenges. *IEEE Transactions on Evolutionary Computation*, 19(2), 167–187.

Karimi-Mamaghan, M., Mohammadi, M., Jula, P., Pirayesh, A., & Ahmadi, H. (2020a). A learning-based metaheuristic for a multi-objective agile inspection planning model under uncertainty. *European Journal of Operational Research*, 285(2), 513–537.

Karimi-Mamaghan, M., Mohammadi, M., Pirayesh, A., Karimi-Mamaghan, A. M., & Irani, H. (2020b). Hub-and-spoke network design under congestion: A learning based metaheuristic. *Transportation Research Part E: Logistics and Transportation Review*, 142, 102069.

Kaufman, K. A., & Michalski, R. S. (2000). Applying learnable evolution model to heat exchanger design. In *AAAI/IAAI* (pp. 1014–1019).

Kennedy, J. (2006). Swarm intelligence. In *Handbook of nature-inspired computing* (pp. 187–219). Springer.

Kerschke, P., Hoos, H. H., Neumann, F., & Trautmann, H. (2019). Automated algorithm selection: Survey and perspectives. *Evolutionary Computation*, 27(1), 3–45.

Khalil, E., Dai, H., Zhang, Y., Dilkina, B., & Song, L. (2017). Learning combinatorial op-
timization algorithms over graphs. In *Advances in neural information processing systems* (pp. 6348–6358).

Kiranyaz, S., Ince, T., & Gabbouj, M. (2014). *Multidimensional particle swarm optimization for machine learning and pattern recognition*. Springer Berlin Heidelberg.
https://doi.org/10.1007/978-3-642-37846-1.

Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983). Optimization by simulated annealing. *Science*, 220(4598), 671–680.

Knowles, J. (2006). Parego: A hybrid algorithm with on-line landscape approximation for expensive multiobjective optimization problems. *IEEE Transactions on Evolutionary Computation*, 10(1), 50–66.

Koç, Ç., Bektaş, T., Jabali, O., & Laporte, G. (2016). Thirty years of heterogeneous vehicle routing. *European Journal of Operational Research*, 249(1), 1–21.

Korte, B., Vygen, J., Korte, B., & Vygen, J. (2012). *Combinatorial optimization: 2*. Springer.

Kotthoff, L. (2014). Algorithm selection for combinatorial search problems: A survey. *AI Magazine*, 35(3), 48–60.

Kotthoff, L. (2016). Algorithm selection for combinatorial search problems: A survey. In *Data mining and constraint programming* (pp. 149–190). Springer.

Le Bouthillier, A., Crainic, T. G., & Kropf, P. (2005). A guided cooperative search for the vehicle routing problem with time windows. *IEEE Intelligent Systems*, 20(4), 36–42.

de León, A. D., Lalla-Ruiz, E., Melián-Batista, B., & Moreno-Vega, J. M. (2017a). A machine learning-based system for berth scheduling at bulk terminals. *Expert Systems with Applications*, 87, 170–182.

de León, A. D., Lalla-Ruiz, E., Melián-Batista, B., & Moreno-Vega, J. M. (2017b). Meta-learning-based system for solving logistic optimization problems. In *International conference on computer aided systems theory* (pp. 339–346). Springer.

Lessmann, S., Caserta, M., & Arango, I. M. (2011). Tuning metaheuristics: A data mining based approach for particle swarm optimization. *Expert Systems with Applications*, 38(10), 12826–12838.

Li, C., Chu, X., Chen, Y., & Xing, L. (2016). A knowledge-based technique for initializing a genetic algorithm. *Journal of Intelligent and Fuzzy Systems*, 31(2), 1145–1152.

Li, J., Palardos, P. M., Sun, H., Pei, J., & Zhang, Y. (2015). Iterated local search embedded adaptive neighborhood selection approach for the multi-depot vehicle routing problem with simultaneous deliveries and pickups. *Expert Systems with Applications*, 42(7), 3551–3561.

Li, K., & Tian, H. (2016). A two-level self-adaptive variable neighborhood search algorithm for the prize-collecting vehicle routing problem. *Applied Soft Computing*, 43, 469–479.

Li, X., & Olafsson, S. (2005). Discovering dispatching rules using data mining. *Journal of Scheduling*, 8(6), 515–527.

Liao, X.-L., & Ting, C.-K. (2012). Evolutionary algorithms using adaptive mutation for the selective pickup and delivery problem. In *2012 IEEE congress on evolutionary computation* (pp. 1–8). IEEE.

de Lima Junior, F. C., de Melo, J. D., & Neto, A. D. D. (2007). Using q-learning algorithm for initialization of the grasp metaheuristic and genetic algorithm. In *2007 international joint conference on neural networks* (pp. 1243–1248). IEEE.

Lodi, A., Mossina, L., & Rachelson, E. (2020). Learning to handle parameter perturbations in combinatorial optimization: An application to facility location. *EURO Journal on Transportation and Logistics*, 100023.

López Jaimes, A., Coello Coello, C. A., & Chakraborty, D. (2008). Objective reduction using a feature selection technique. In *Proceedings of the 10th annual conference on genetic and evolutionary computation* (pp. 673–680).

López-Santana, E., Rodríguez-Vásquez, W., & Méndez-Giraldo, G. (2018). A hybrid expert system, clustering and ant colony optimization approach for scheduling and routing problem in courier services. *International Journal of Industrial Engineering Computations*, 9(3), 369–396.

Loshchilov, I., Schoenauer, M., & Sebag, M. (2010). A mono surrogate for multiobjective optimization. In *Proceedings of the 12th annual conference on genetic and evolutionary computation* (pp. 471–478).

Lotfi, N., & Acan, A. (2016). A tournament-based competitive-cooperative multiagent architecture for real parameter optimization. *Soft Computing*, 20(11), 4597–4617.

Louis, S. J., & McDonnell, J. (2004). Learning with case-injected genetic algorithms. *IEEE Transactions on Evolutionary Computation*, 8(4), 316–328.

Lourenço, H. R., Martin, O. C., & Stützle, T. (2003). Iterated local search. In *Handbook of metheuristics* (pp. 320–353). Springer.

Lu, H., Zhang, X., & Yang, S. (2019). A learning-based iterative method for solving vehicle routing problems. In *International conference on learning representations*.

Lucas, F., Billot, R., Sevaux, M., & Sörensen, K. (2020). Reducing space search in combinatorial optimization using machine learning tools. In *International conference on learning and intelligent optimization* (pp. 143–150). Springer.

Lughofer, E. (2017). On-line active learning: A new paradigm to improve practical usability of data stream modeling methods. *Information Sciences*, 415, 356–376.

Martin, S., Ouelhadj, D., Beullens, P., & Ozcan, E. (2011). A generic agent-based framework for cooperative search using pattern matching and reinforcement learning. *Technical Report*.

Martin, S., Ouelhadj, D., Beullens, P., Ozcan, E., Juan, A. A., & Burke, E. K. (2016). A multi-agent based cooperative approach to scheduling and routing. *European Journal of Operational Research*, 254(1), 169–178.

Maturana, J., Fialho, A., Saubion, F., Schoenauer, M., Lardeux, F., & Sebag, M. (2011). Adaptive operator selection and management in evolutionary algorithms. In *Autonomous search* (pp. 161–189). Springer.

Maturana, J., Fialho, A., Saubion, F., Schoenauer, M., & Sebag, M. (2009). Extreme compass and dynamic multi-armed bandits for adaptive operator selection. In *2009 ieee congress on evolutionary computation* (pp. 365–372). IEEE.

Maturana, J., & Riff, M.-C. (2007). Solving the short-term electrical generation

scheduling problem by an adaptive evolutionary approach. *European Journal of Operational Research*, 179(3), 677–691.

Maturana, J., & Saubion, F. (2008). A compass to guide genetic algorithms. In *International conference on parallel problem solving from nature* (pp. 256–265). Springer.

Meignan, D., Créput, J.-C., & Koukam, A. (2008). A coalition-based metaheuristic for the vehicle routing problem. In *2008 IEEE congress on evolutionary computation (IEEE world congress on computational intelligence)* (pp. 1176–1182). IEEE.

Meignan, D., Créput, J.-C., & Koukam, A. (2009). A cooperative and self-adaptive metaheuristic for the facility location problem. In *Proceedings of the 11th annual conference on genetic and evolutionary computation* (pp. 317–324).

Meignan, D., Koukam, A., & Créput, J.-C. (2010). Coalition-based metaheuristic: A self-adaptive metaheuristic using reinforcement learning and mimetism. *Journal of Heuristics*, 16(6), 859–879.

Mersmann, O., Bischl, B., Trautmann, H., Wagner, M., Bossek, J., & Neumann, F. (2013). A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem. *Annals of Mathematics and Artificial Intelligence*, 69(2), 151–182.

Messelis, T., & De Causmaeker, P. (2014). An automatic algorithm selection approach for the multi-mode resource-constrained project scheduling problem. *European Journal of Operational Research*, 233(3), 511–528.

Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953). Equation of state calculations by fast computing machines. *The journal of chemical physics*, 21(6), 1087–1092.

Michalski, R. S. (2000). Learnable evolution model: Evolutionary processes guided by machine learning. *Machine Learning*, 38(1–2), 9–40.

Miki, S., Yamamoto, D., & Ebara, H. (2018). Applying deep learning and reinforce ment learning to traveling salesman problem. In *2018 international conference on computing, electronics & communications engineering (ICCECE)* (pp. 65–70). IEEE.

Min, J., Jin, C., & Lu, L. (2019). Maximum-minimum distance clustering method for split-delivery vehicle-routing problem: Case studies and performance comparisons. *Advances in Production Engineering & Management*, 14(1), 125–135.

Miranda, E. S., Fabris, F., Nascimento, C. G., Freitas, A. A., & Oliveira, A. C. (2018). Meta-learning for recommending metaheuristics for the maxsat problem. In *2018 7th Brazilian conference on intelligent systems (BRACIS)* (pp. 169–174). IEEE.

Mladenović, N., & Hansen, P. (1997). Variable neighborhood search. *Computers & Operations Research*, 24(11), 1097–1100.

Mohammadi, M., Julia, P., & Tavakkoli-Moghaddam, R. (2019). Reliable single-allocation hub location problem with disruptions. *Transportation Research Part E: Logistics and Transportation Review*, 123, 90–120.

Mohammadi, M., Tavakkoli-Moghaddam, R., Siadat, A., & Dantan, J.-Y. (2016). Design of a reliable logistics network with hub disruption under uncertainty. *Applied Mathematical Modelling*, 40(9-10), 5621–5642.

Moradi, B. (2019). The new optimization algorithm for the vehicle routing problem with time windows using multi-objective discrete learnable evolution model. *Soft Computing*, 1–29.

Moraglio, A., Kim, Y.-H., & Yoon, Y. (2011). Geometric surrogate-based optimisation for permutation-based problems. In *Proceedings of the 13th annual conference companion on genetic and evolutionary computation* (pp. 133–134).

Mosadegh, H., Ghomi, S. F., & Süer, G. (2020). Stochastic mixed-model assembly line sequencing problem: Mathematical modeling and q-learning based simulated annealing hyper-heuristics. *European Journal of Operational Research*, 282(2), 530–544.

Moscato, P., et al. (1989). On evolution, search, optimization, genetic algorithms and martial arts: Towards memetic algorithms. *Caltech concurrent computation program, C3P Report*.

Mostafaie, T., Khiyabani, F. M., & Navimipour, N. J. (2020). A systematic study on meta-heuristic approaches for solving the graph coloring problem. *Computers & Operations Research*, 120, 104850.

Nasiri, M. M., Salesi, S., Rahbari, A., Meydani, N. S., & Abdollai, M. (2019). A data mining approach for population-based methods to solve the JSSP. *Soft Computing*, 23(21), 11107–11122.

Nguyen, S., Zhang, M., Johnston, M., & Tan, K. C. (2014). Selection schemes in surrogate-assisted genetic programming for job shop scheduling. In *Asia-pacific conference on simulated evolution and learning* (pp. 656–667). Springer.

Ochoa, G., & Burke, E. K. (2014). Hyperils: An effective iterated local search hyperheuristic for combinatorial optimisation. In *International conference on the practice and theory of automated timetabling, (august)* (pp. 26–29).

Oliveira, A. L., Braga, P. L., Lima, R. M., & Cornélio, M. L. (2010). Ga-based method for feature selection and parameters optimization for machine learning regression applied to software effort estimation. *Information and Software Technology*, 52(11), 1155–1166.

Osman, I. H., & Laporte, G. (1996). Metaheuristics: A bibliography. *Annals of Operations Research*, 63(5), 511–623.

Öztop, H., Tasgetiren, M. F., Kandiller, L., & Pan, Q.-K. (2020). A novel general variable neighborhood search through q-learning for no-idle flowshop scheduling. In *2020 iee congress on evolutionary computation (CEC)* (pp. 1–8). IEEE.

Page, E. S. (1954). Continuous inspection schemes. *Biometrika*, 41(1/2), 100–115.

Park, J., & Kim, K.-Y. (2017). Meta-modeling using generalized regression neural network and particle swarm optimization. *Applied Soft Computing*, 51, 354–369.

Pathak, B. K., Srivastava, S., & Srivastava, K. (2008). Neural network embedded multiobjective genetic algorithm to solve non-linear time-cost tradeoff problems of project scheduling. *Journal of Scientific and Industrial Research*, 67(2), 124–131.

Pavelski, L., Delgado, M., & Kessaci, M.-E. (2018a). Meta-learning for optimization: A case study on the flowshop problem using decision trees. In *2018 IEEE congress on evolutionary computation (CEC)* (pp. 1–8). IEEE.
Pavelski, L. M., Kessaci, M.-É., & Delgado, M. R. (2018b). Recommending meta-heuristics and configurations for the flowshop problem via meta-learning: analysis and design. In *2018 7th Brazilian conference on intelligent systems (BRACIS)* (pp. 163–168). IEEE.

Pelamatti, J., Brevault, L., Balesdent, M., Talbi, E.-G., & Guerin, Y. (2020). Overview and comparison of gaussian process-based surrogate models for mixed continuous and discrete variables: Application on aerospace design problems. In *High-performance simulation-based optimization* (pp. 189–224). Springer.

Peng, B., Zhang, Y., Gajpal, Y., & Chen, X. (2019). A memetic algorithm for the green vehicle routing problem. *Sustainability*, 11(21), 6055.

Pettinger, J. E., & Everson, R. M. (2002). Controlling genetic algorithms with reinforcement learning. In *Proceedings of the 4th annual conference on genetic and evolutionary computation* (p. 692).

Phan, H. D., Ellis, K., Barca, J. C., & Dorin, A. (2019). A survey of dynamic parameter setting methods for nature-inspired swarm intelligence algorithms. *Neural Computing and Applications*, 1–22.

Pitzer, E., Beham, A., & Affenzeller, M. (2013). Automatic algorithm selection for the quadratic assignment problem using fitness landscape analysis. In *European conference on evolutionary computation in combinatorial optimization* (pp. 109–120). Springer.

Qasem, S. N., Shamsuddin, S. M., Hashim, S. Z. M., Darus, M., & Al-Shammari, E. (2013). Memetic multiobjective particle swarm optimization-based radial basis function network for classification problems. *Information Sciences*, 239, 165–190.

Rahnamayan, S., Tizhoosh, H. R., & Salama, M. M. (2008). Opposition-based differential evolution. *IEEE Transactions on Evolutionary computation*, 12(1), 64–79.

Ramos, I. C., Goldbarg, M. C., Goldbarg, E. G., & Neto, A. D. D. (2005). Logistic regression for parameter tuning on an evolutionary algorithm. In *2005 IEEE congress on evolutionary computation: 2* (pp. 1061–1068). IEEE.

Reinelt, G. (1991). Tsplib'a traveling salesman problem library. *ORSA Journal on Computing*, 3(4), 376–384.

Ribeiro, M. H., Plastino, A., & Martins, S. L. (2006). Hybridization of grasp metaheuristic with data mining techniques. *Journal of Mathematical Modelling and Algorithms*, 5(1), 23–41.

Rice, J. R., et al. (1976). The algorithm selection problem. *Advances in Computers*, 15(65–118), 5.

de la Rosa-Rivera, F., Nunez-Varela, J. I., Ortiz-Bayliss, J. C., & Terashima-Marín, H. (2021). Algorithm selection for solving educational timetabling problems. *Expert Systems with Applications*, 174, 114694.

Sadeg, S., Hamdad, L., Haouas, M., Abderrahmane, K., Benatchba, K., & Habbas, Z. (2019). Unsupervised learning bee swarm optimization metaheuristic. In *International work-conference on artificial neural networks* (pp. 773–784). Springer.

Sadeg, S., Hamdad, L., Kada, O., Benatchba, K., & Habbas, Z. (2020). Meta-learning to select the best metaheuristic for the maxsat problem. In *International symposium on modelling and implementation of complex systems* (pp. 122–135). Springer.

Sakurai, Y., Takada, K., Kawabe, T., & Tsuruta, S. (2010). A method to control parameters of evolutionary algorithms by using reinforcement learning. In *2010 sixth international conference on signal-image technology and internet based systems* (pp. 74–79). IEEE.

Sakurai, Y., & Tsuruta, S. (2012). A population based rewarding for reinforcement learning to control genetic algorithms. In *2012 eighth international conference on signal image technology and internet based systems* (pp. 686–691). IEEE.

Santos, H. G., Ochi, L. S., Marinho, E. H., & Drummond, L. M. d. A. (2006). Combining an evolutionary algorithm with data mining to solve a single-vehicle routing problem. *Neurocomputing*, 70(1–3), 70–77.

dos Santos, J. P. Q., de Lima Júnior, F. C., Magalhães, R. M., de Melo, J. D., & Neto, A. D. D. (2010). A parallel hybrid implementation using genetic algorithms, grasp and reinforcement learning for the salesman traveling problem. In *Computational intelligence in expensive optimization problems* (pp. 345–369). Springer.

dos Santos, J. P. Q., de Melo, J. D., Neto, A. D. D., & Aloise, D. (2014). Reactive search strategies using reinforcement learning, local search algorithms and variable neighborhood search. *Expert Systems with Applications*, 41(10), 4939–4949.

Saxena, D. K., Duro, J. A., Tiwari, A., Deb, K., & Zhang, Q. (2012). Objective reduction in many-objective optimization: Linear and nonlinear algorithms. *IEEE Transactions on Evolutionary Computation*, 17(1), 77–99.

Segredo, E., Paechter, B., Hart, E., & González-Vila, C. I. (2016). Hybrid parameter control approach applied to a diversity-based multi-objective memetic algorithm for frequency assignment problems. In *2016 IEEE congress on evolutionary computation (CEC)* (pp. 1517–1524). IEEE.

Sghir, I., Hao, J.-K., Jaafar, I. B., & Ghédira, K. (2015). A multi-agent based optimization method applied to the quadratic assignment problem. *Expert Systems with Applications*, 42(23), 9252–9262.

Sghir, I., Jaafar, I. B., & Ghédira, K. (2018). A multi-agent based optimization method for combinatorial optimization problems. *International Journal on Artificial Intelligence Tools*, 27(05), 1850021.

Shaw, P. (1998). Using constraint programming and local search methods to solve vehicle routing problems. In *International conference on principles and practice of constraint programming* (pp. 417–431). Springer.

Shi, L., & Rasheed, K. (2010). A survey of fitness approximation methods applied in evolutionary algorithms. In *Computational intelligence in expensive optimization problems* (pp. 3–28). Springer.

da Silva, A. M. L., Freire, M. R., & Honório, L. M. (2016). Transmission expansion planning optimization by adaptive multi-operator evolutionary algorithms. *Electric Power Systems Research*, 133, 173–181.

Silva, M. A. L., de Souza, S. R., Souza, M. J. F., & Bazzan, A. L. C. (2019). A reinforcement learning-based multi-agent framework applied for solving routing and scheduling problems. *Expert systems with applications*, 131, 148–171.

Silva, M. A. L., de Souza, S. R., Souza, M. J. F., & de Franca Filho, M. F. (2018). Hybrid metaheuristics and multi-agent systems for solving optimization problems: A review of frameworks and a comparative analysis. *Applied soft computing*, 71, 433–459.

Silva, M. A. L., de Souza, S. R., Souza, M. J. F., & de Oliveira, S. M. (2015). A multi-agent metaheuristic optimization framework with cooperation. In *2015 Brazilian conference on intelligent systems (BRACIS)* (pp. 104–109). IEEE.

Singh, H. K., Ray, T., & Smith, W. (2010). Surrogate assisted simulated annealing (sasa) for constrained multi-objective optimization. In *IEEE congress on evolutionary computation* (pp. 1–8). IEEE.

Smith-Miles, K., Baatar, D., Wreford, B., & Lewis, R. (2014). Towards objective measures of algorithm performance across instance space. *Computers & Operations Research*, 45, 12–24.

Smith-Miles, K., van Hemert, J., & Lim, X. Y. (2010). Understanding TSP difficulty by learning from evolved instances. In *International conference on learning and intelligent optimization* (pp. 266–280). Springer.

Smith-Miles, K., & Lopes, L. (2012). Measuring instance difficulty for combinatorial optimization problems. *Computers & Operations Research*, 39(5), 875–889.

Smith-Miles, K. A. (2008). Towards insightful algorithm selection for optimisation using meta-learning concepts. In *2008 IEEE international joint conference on neural networks (IEEE world congress on computational intelligence)* (pp. 4118–4124). IEEE.

Song, H., Triguero, I., & Özcan, E. (2019). A review on the self and dual interactions between machine learning and optimisation. *Progress in Artificial Intelligence*, 8(2), 143–165.

Sra, S., Nowozin, S., & Wright, S. J. (2012). *Optimization for machine learning*. Mit Press.

Storn, R., & Price, K. (1997). Differential evolution—a simple and efficient heuristic for global optimization over continuous spaces. *Journal of global optimization*, 11(4), 341–359.

Sun, J., Zhang, H., Zhou, A., Zhang, Q., & Zhang, K. (2019). A new learning-based adaptive multi-objective evolutionary algorithm. *Swarm and evolutionary computation*, 44, 304–319.

Taillard, E. (1993). *Benchmarks for basic scheduling problems*. *European journal of Operational Research*, 64(2), 278–285.

Talbi, E.-G. (2002). A taxonomy of hybrid metaheuristics. *Journal of Heuristics*, 8(5), 541–564.

Talbi, E.-G. (2009). *Metaheuristics: From design to implementation*. John Wiley & Sons, Inc.

Talbi, E.-G. (2016). Combining metaheuristics with mathematical programming, constraint programming and machine learning. *Annals of Operations Research*, 240(1), 171–215.

Talbi, E.-G. (2020). Machine learning into metaheuristics: A survey and taxonomy of data-driven metaheuristics. *Working paper*.

Thevenin, S., & Zufferey, N. (2019). Learning variable neighborhood search for a scheduling problem with time windows and rejections. *Discrete Applied Mathematics*, 261, 344–353.

Turkeš, R., Sórensen, K., & Hvattum, L. M. (2020). *Meta-analysis of metaheuristics: Quantifying the effect of adaptiveness in adaptive large neighborhood search*. *European Journal of Operational Research*. https://doi.org/10.1016/j.ejor.2020.10.045.

Luong, T., Melab, N., & Talbi, E.-G. (2011). Gpu computing for parallel local search metaheuristic algorithms. *IEEE Transactions on Computers*, 62(1), 173–185.

Voudouris, C., & Tsang, E. (1999). Guided local search and its application to the traveling salesman problem. *European Journal of Operational Research*, 113(2), 469–499.

Voudouris, C., & Tsang, E. P. (2003). Guided local search. In *Handbook of metaheuristics* (pp. 185–218). Springer.

Wagner, S., & Affenzeller, M. (2005). *Heuristiclab: A generic and extensible optimization environment*. In *Adaptive and natural computing algorithms* (pp. 538–541). Springer.

Walker, J. D., Ochoa, G., Gendreau, M., & Burke, E. K. (2012). Vehicle routing and adaptive iterated local search within the hyflex hyper-heuristic framework. In *International conference on learning and intelligent optimization* (pp. 265–276). Springer.

Wang, H., & Jin, Y. (2018). A random forest-assisted evolutionary algorithm for data-driven constrained multiobjective combinatorial optimization of trauma systems. *IEEE Transactions on Cybernetics*, 50(2), 536–549.

Wang, X., & Tang, L. (2017). A machine-learning based memetic algorithm for the multi-objective permutation flowshop scheduling problem. *Computers & Operations Research*, 79, 60–77.

Wang, Y., Pan, S., Li, C., & Yin, M. (2020a). A local search algorithm with reinforcement learning based repair procedure for minimum weight independent dominating set. *Information Sciences*, 512, 533–548.

Wang, Y., Yao, Q., Kwok, J. T., & Ni, L. M. (2020b). Generalizing from a few examples: A survey on few-shot learning. *ACM Computing Surveys (CSUR)*, 53(3), 1–34.

Watkins, C. J. C. H. (1989). *Learning from delayed rewards*. King's College, Cambridge Ph.D. thesis.

Wauters, T., Verbeek, K., De Causmaeker, P., & Berghe, G. V. (2013). Boosting metaheuristic search using reinforcement learning. In *Hybrid metaheuristics* (pp. 433–452). Springer.

Wawrzyniak, J., Drozdowski, M., & Sanlaville, É. (2020). Selecting algorithms for
large berth allocation problems. *European Journal of Operational Research*, 283(3), 844-862.

Wojtusiak, J., Warden, T., & Herzog, O. (2011). Agent-based pickup and delivery planning: the learnable evolution model approach. In *2011 international conference on complex, intelligent, and software intensive systems* (pp. 1-8). IEEE.

Wojtusiak, J., Warden, T., & Herzog, O. (2012). The learnable evolution model in agent-based delivery optimization. *Memetic Computing*, 4(3), 165-181.

Wolpert, D. H., & Macready, W. G. (1997). No free lunch theorems for optimization. *IEEE transactions on evolutionary computation*, 1(1), 67-82.

Wu, W., & Tseng, S.-P. (2017). An improved learnable evolution model for discrete optimization problem. In *Advances in intelligent information hiding and multime- dia signal processing* (pp. 333-340). Springer.

Xiang, T., & Pan, D. (2016). Clustering algorithm for split delivery vehicle routing problem. *Journal of Computer Applications*, 36(11), 3141-3145.

Xiang, X., Tian, Y., Xiao, J., & Zhang, X. (2020). A clustering-based surrogate-assisted multi-objective evolutionary algorithm for shelter location under uncertainty of road networks. *IEEE Transactions on Industrial Informatics*, 16(12), 7544-7555.

Xue, B., Zhang, M., Browne, W. N., & Yao, X. (2015). A survey on evolutionary com- putation approaches to feature selection. *IEEE Transactions on Evolutionary Com- putation*, 20(4), 606-626.

Yalcinoz, T., & Altun, H. (2001). Power economic dispatch using a hybrid genetic algorithm. *IEEE power engineering review*, 21(3), 59-60.

Yu, H., Tan, Y., Sun, C., & Zeng, J. (2017). Clustering-based evolution control for sur- rogate-assisted particle swarm optimization. In *2017 IEEE congress on evolution- ary computation (CEC)* (pp. 503-508). IEEE.

Yuan, Z., Handoko, S. D., Nguyen, D. T., & Lau, H. C. (2014). An empirical study of of- f-line configuration and on-line adaptation in operator selection. In *International conference on learning and intelligent optimization* (pp. 62-76). Springer.

Zennaki, M., & Ech-Cherif, A. (2010). A new machine learning based approach for tuning metaheuristics for the solution of hard combinatorial optimization prob- lems. *Journal of Applied Sciences(Faisalabad)*, 10(18), 1991-2000.

Zhalechian, M., Tavakkoli-Moghaddam, R., Zahiri, B., & Mohammadi, M. (2016). Sus- tainable design of a closed-loop location-routing-inventory supply chain net- work under mixed uncertainty. *Transportation Research Part E: Logistics and Transportation Review*, 89, 182-214.

Zhang, H., Zhou, A., Song, S., Zhang, Q., Gao, X.-Z., & Zhang, J. (2016). A self-orga- nizing multiobjective evolutionary algorithm. *IEEE Transactions on Evolutionary Computation*, 20(5), 792-806.

Zhang, J. (2017). An efficient density-based clustering algorithm for the capacitated vehicle routing problem. In *2017 international conference on computer network, electronic and automation (ICCNEA)* (pp. 465-469). IEEE.

Zhang, J., Zhan, Z.-h., Lin, Y., Chen, N., Gong, Y.-j., Zhong, J.-h., ... Shi, Y.-h. (2011). Evolutionary computation meets machine learning: A survey. *IEEE Computa- tional Intelligence Magazine*, 6(4), 68-75.

Zhao, F., Zhang, L., Cao, J., & Tang, J. (2021). A cooperative water wave optimiza- tion algorithm with reinforcement learning for the distributed assembly no-idle flowshop scheduling problem. *Computers & Industrial Engineering*, 153, 107082.

Zheng, Y., Fu, X., & Xuan, Y. (2019). Data-driven optimization based on random for- est surrogate. In *2019 6th international conference on systems and informatics (IC- SAI)* (pp. 487-491). IEEE.

Zheng, Y.-J. (2015). Water wave optimization: A new nature-inspired metaheuristic. *Computers & Operations Research*, 55, 1-11.

Zhou, Y., Hao, J.-K., & Duval, B. (2016). Reinforcement learning based local search for grouping problems: A case study on graph coloring. *Expert Systems with Appli- cations*, 64, 412-422.

Zhou, Y., Hao, J.-K., & Duval, B. (2020). Frequent pattern-based search: A case study on the quadratic assignment problem. *IEEE Transactions on Systems, Man, and Cybernetics: Systems*.

Zhou, Z., Ong, Y. S., Nguyen, M. H., & Lim, D. (2005). A study on polynomial regres- sion and gaussian process global surrogate model in hierarchical surrogate-as- sisted evolutionary algorithm. In *2005 IEEE congress on evolutionary computa- tion: 3* (pp. 2832-2839). IEEE.