The DOI matches its Crossref record; 177 of the 177 references it cites were found in a registry or an index.
Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: A state-of-the-art
Open accessAbstract
In recent years, there has been a growing research interest in integrating machine learning techniques into meta-heuristics for solving combinatorial optimization problems. This integration aims to lead meta-heuristics toward an efficient, effective, and robust search and improve their performance in terms of solution quality, convergence rate, and robustness. Since various integration methods with different purposes have been developed, there is a need to review the recent advances in using machine learning techniques to improve meta-heuristics. To the best of our knowledge, the literature is deprived of having a comprehensive yet technical review. To fill this gap, this paper provides such a review on the use of machine learning techniques in the design of different elements of meta-heuristics for different purposes including algorithm selection, fitness evaluation, initialization, evolution, parameter setting, and cooperation. First, we describe the key concepts and preliminaries of each of these ways of integration. Then, the recent advances in each way of integration are reviewed and classified based on a proposed unified taxonomy. Finally, we provide a technical discussion on the advantages, limitations, requirements, and challenges of implementing each of these integration ways, followed by promising future research directions.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
1 retracted
Abdel‐Basset, M., Manogaran, G., Rashad, H. M. N., & Zaied, A. N. H. (2018) · Journal of Ambient Intelligence and Humanized Computing · doi:10.1007/s12652-018-0917-x · Cited by 63
RetractedHolland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
Equation of State Calculations by Fast Computing Machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · The Journal of Chemical Physics · doi:10.1063/1.1699114 · Cited by 37,192
Storn, R., & Price, K. (1997) · Journal of Global Optimization · doi:10.1023/a:1008202821328 · Cited by 29,569
Book Review: Pattern Recognition and Machine Learning
Nasrabadi, N. M. (2007) · Journal of Electronic Imaging · doi:10.1117/1.2819119 · Cited by 22,066
No free lunch theorems for optimization
Wolpert, D. H., & Macready, W. G. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585893 · Cited by 14,237
Advances in Neural Information Processing Systems 29
Teymur, O., Zygalakis, K., & Calderhead, B. (2016) · Cited by 13,887
Pattern Recognition and Machine Learning
(2006) · doi:10.1007/978-0-387-45528-0 · Cited by 9,824
A New Heuristic Optimization Algorithm: Harmony Search
Geem, Z. W., Kim, J. H., & Loganathan, G. V. (2001) · SIMULATION · doi:10.1177/003754970107600201 · Cited by 6,247
Finite-time Analysis of the Multiarmed Bandit Problem
Auer, P., Cesa-Bianchi, N., & Fischer, P. (2002) · Machine Learning · doi:10.1023/a:1013689704352 · Cited by 6,033
PAGE, E. S. (1954) · Biometrika · doi:10.1093/biomet/41.1-2.100 · Cited by 5,739
Glover, F., & Laguna, M. (1997) · Cited by 5,679
AN IDEA BASED ON HONEY BEE SWARM FOR NUMERICAL OPTIMIZATION
Karaboğa, D. (2005) · Cited by 5,466
Watkins, C. (1989) · OpenGrey (Institut de l'Information Scientifique et Technique) · doi:10.17863/cam.132164 · Cited by 5,297
Mladenović, N., & Hansen, P. (1997) · Computers & Operations Research · doi:10.1016/s0305-0548(97)00031-2 · Cited by 4,254
(2003) · International Series in Operations Research & Management Science · doi:10.1007/b101874 · Cited by 3,430
Metaheuristics in combinatorial optimization: Overview and conceptual comparison
Blum, C., & Roli, A. (2003) · ACM Computing Surveys · doi:10.1145/937503.937505 · Cited by 3,236
Generalizing from a Few Examples: A Survey on Few-shot Learning
Wang, Y., Yao, Q., Kwok, J. T., & Ni, L. M. (2021) · ACM Computing Surveys · doi:10.1145/3386252 · Cited by 3,165
Glover, F., & Laguna, M. (1997) · doi:10.1007/978-1-4615-6089-0 · Cited by 3,001
Greedy Randomized Adaptive Search Procedures
Feo, T. A., & Resende, M. G. C. (1995) · Journal of Global Optimization · doi:10.1007/bf01096763 · Cited by 2,778
Atashpaz-Gargari, E., & Lucas, C. (2007) · 2007 IEEE Congress on Evolutionary Computation · doi:10.1109/cec.2007.4425083 · Cited by 2,628
TSPLIB—A Traveling Salesman Problem Library
Reinelt, G. (1991) · ORSA Journal on Computing · doi:10.1287/ijoc.3.4.376 · Cited by 2,616
Metaheuristics : from desing to implementation
Talbi, E. (2009) · HAL · Cited by 2,494
Self-citationBenchmarks for basic scheduling problems
Taillard, É. D. (1993) · European Journal of Operational Research · doi:10.1016/0377-2217(93)90182-m · Cited by 2,489
Metaheuristics in Combinatorial Optimization
Gendreau, M., & Potvin, J.-Y. (2005) · Annals of Operations Research · doi:10.1007/s10479-005-3971-7 · Cited by 2,338
Greedy Randomized Adaptive Search Procedures
Resende, M. G. C., & Ribeiro, C. C. (2006) · International Series in Operations Research & Management Science · doi:10.1007/0-306-48056-5_8 · Cited by 2,310
Ant colony optimization theory: A survey
Dorigo, M., & Blum, C. (2005) · Theoretical Computer Science · doi:10.1016/j.tcs.2005.05.020 · Cited by 2,295
Parameter control in evolutionary algorithms
Eiben, A. E., Hinterding, R., & Michalewicz, Z. (1999) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.771166 · Cited by 1,980
A Survey on Evolutionary Computation Approaches to Feature Selection
Xue, B., Zhang, M., Browne, W. N., & Yao, X. (2016) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2015.2504420 · Cited by 1,841
Opposition-Based Differential Evolution
Rahnamayan, S., Tizhoosh, H. R., & Salama, M. M. A. (2008) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2007.894200 · Cited by 1,630
On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms
Moscato, P. (1989) · Cited by 1,516
Surrogate-assisted evolutionary computation: Recent advances and future challenges
Jin, Y. (2011) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2011.05.001 · Cited by 1,514
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems
Shaw, P. (1998) · Lecture Notes in Computer Science · doi:10.1007/3-540-49481-2_30 · Cited by 1,366
Hyper-heuristics: a survey of the state of the art
Burke, E. K., Gendreau, M., Hyde, M., Kendall, G., Ochoa, G., Özcan, E., & Qu, R. (2013) · Journal of the Operational Research Society · doi:10.1057/jors.2013.71 · Cited by 1,263
Knowles, J. (2006) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2005.851274 · Cited by 1,254
A comprehensive survey of fitness approximation in evolutionary computation
Jin, Y. (2005) · Soft Computing · doi:10.1007/s00500-003-0328-5 · Cited by 1,229
The Algorithm Selection Problem
Rice, J. R. (1976) · Advances in Computers · doi:10.1016/s0065-2458(08)60520-3 · Cited by 1,195
Lourenço, H. R., Martin, O. C., & Stützle, T. (2006) · International Series in Operations Research & Management Science · doi:10.1007/0-306-48056-5_11 · Cited by 1,164
Learning Combinatorial Optimization Algorithms over Graphs
Dai, H., Khalil, E. B., Zhang, Y., Dilkina, B., & Song, L. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1704.01665 · Cited by 1,007
Optimization for Machine Learning
(2011) · The MIT Press eBooks · doi:10.7551/mitpress/8996.001.0001 · Cited by 875
Dueck, G. (1993) · Journal of Computational Physics · doi:10.1006/jcph.1993.1010 · Cited by 765
Johnson, D. S., Papadimitriou, C. H., & Yannakakis, M. (1988) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(88)90046-3 · Cited by 705
(2019) · International Series in Operations Research & Management Science · doi:10.1007/978-3-319-91086-4 · Cited by 677
Metaheuristics: A bibliography
Osman, I. H., & Laporte, G. (1996) · Annals of Operations Research · doi:10.1007/bf02125421 · Cited by 672
The 2007 International Joint Conference on Neural Networks
(2007) · 2007 International Joint Conference on Neural Networks · doi:10.1109/ijcnn.2007.4370894 · Cited by 575
Water wave optimization: A new nature-inspired metaheuristic
Zheng, Y.-J. (2015) · Computers & Operations Research · doi:10.1016/j.cor.2014.10.008 · Cited by 568
2018 IEEE Congress on Evolutionary Computation (CEC)
(2018) · doi:10.1109/cec40672.2018 · Cited by 555
Chen, R., Yang, B., Li, S., & Wang, S. (2020) · Computers & Industrial Engineering · doi:10.1016/j.cie.2020.106778 · Cited by 548
Parameter Control in Evolutionary Algorithms: Trends and Challenges
Karafotias, G., Hoogendoorn, M., & Eiben, A. E. (2015) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2014.2308294 · Cited by 516
2019 IEEE Congress on Evolutionary Computation (CEC)
(2019) · doi:10.1109/cec44084.2019 · Cited by 504
The 2003 Genetic and Evolutionary Computation Conference
Foster, J. A., & Cantú‐Paz, E. (2003) · Defense Technical Information Center (DTIC) · doi:10.21236/ada419567 · Cited by 502
Parallel Metaheuristics: A New Class of Algorithms
Alba, E. (2005) · Cited by 468
Automated Algorithm Selection: Survey and Perspectives
Kerschke, P., Hoos, H. H., Neumann, F., & Trautmann, H. (2019) · Evolutionary Computation · doi:10.1162/evco_a_00242 · Cited by 435
Guided local search and its application to the traveling salesman problem
Voudouris, C., & Tsang, E. (1999) · European Journal of Operational Research · doi:10.1016/s0377-2217(98)00099-x · Cited by 409
Korte, B., & Vygen, J. (2000) · Algorithms and Combinatorics · doi:10.1007/978-3-662-21708-5 · Cited by 393
Zhalechian, M., Tavakkoli-Moghaddam, R. R., Zahiri, B., & Mohammadi, M. (2016) · Transportation Research Part E Logistics and Transportation Review · doi:10.1016/j.tre.2016.02.011 · Cited by 374
Self-citationA Survey of Automatic Parameter Tuning Methods for Metaheuristics
Huang, C., Li, Y., & Yao, X. (2020) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2019.2921598 · Cited by 371
A Survey of Mobile Device Virtualization: Taxonomy and State of the Art
Shuja, J., Gani, A., Bilal, K., Khan, A. U. R., Madani, S. A., Khan, S. U., & Zomaya, A. Y. (2017) · ACM Computing Surveys · doi:10.1145/2897164 · Cited by 370
Optimization problems for machine learning: A survey
Gambella, C., Ghaddar, B., & Naoum-Sawaya, J. (2021) · European Journal of Operational Research · doi:10.1016/j.ejor.2020.08.045 · Cited by 365
Recent advances in selection hyper-heuristics
Drake, J. H., Kheiri, A., Özcan, E., & Burke, E. K. (2020) · European Journal of Operational Research · doi:10.1016/j.ejor.2019.07.073 · Cited by 365
IEEE Congress on Evolutionary Computation
(2006) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2006.888276 · Cited by 360
Thirty years of heterogeneous vehicle routing
Koç, Ç., Bektaş, T., Jabali, O., & Gilbert Laporte, A. (2015) · European Journal of Operational Research · doi:10.1016/j.ejor.2015.07.020 · Cited by 339
2017 IEEE Congress on Evolutionary Computation (CEC)
(2017) · doi:10.1109/cec38257.2017 · Cited by 330
Proceedings of the Genetic and Evolutionary Computation Conference
(2019) · doi:10.1145/3321707 · Cited by 319
Objective Reduction in Many-Objective Optimization: Linear and Nonlinear Algorithms
Saxena, D. K., Duro, J. A., Tiwari, A., Deb, K., & Zhang, Q. (2013) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2012.2185847 · Cited by 302
Evolutionary Computation Meets Machine Learning: A Survey
Zhang, J., Zhan, Z.-H., Lin, Y., Chen, N., Gong, Y.-J., Zhong, J.-H., Chung, H. S. H., Li, Y., & Shi, Y.-H. (2011) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2011.942584 · Cited by 301
Handbook of Combinatorial Optimization: Volume1–3
(1998) · Springer eBooks · doi:10.1007/978-1-4613-0303-9 · Cited by 292
Algorithm Selection for Combinatorial Search Problems: A Survey
Kotthoff, L. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-50137-6_7 · Cited by 270
Oliveira, A. L. I., Braga, P. L., Lima, R. M. F., & Cornélio, M. L. (2010) · Information and Software Technology · doi:10.1016/j.infsof.2010.05.009 · Cited by 233
LEARNABLE EVOLUTION MODEL: Evolutionary Processes Guided by Machine Learning
Michalski, R. S. (2000) · Machine Learning · doi:10.1023/a:1007677805582 · Cited by 228
Computational Intelligence in Expensive Optimization Problems
Tenne, Y., & Goh, C.-K. (2010) · Adaptation, learning, and optimization · doi:10.1007/978-3-642-10701-6 · Cited by 224
Case-based heuristic selection for timetabling problems
Burke, E. K., Petrovic, S., & Qu, R. (2006) · Journal of Scheduling · doi:10.1007/s10951-006-6775-y · Cited by 223
2013 IEEE Congress on Evolutionary Computation
(2013) · doi:10.1109/cec20747.2013 · Cited by 220
An Improved Genetic Algorithm with Initial Population Strategy for Symmetric TSP
Deng, Y., Liu, Y., & Zhou, D. (2015) · Mathematical Problems in Engineering · doi:10.1155/2015/212794 · Cited by 213
Wang, H., & Jin, Y. (2020) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2018.2869674 · Cited by 212
Measuring instance difficulty for combinatorial optimization problems
Smith-Miles, K., & Lopes, L. (2012) · Computers & Operations Research · doi:10.1016/j.cor.2011.07.006 · Cited by 210
Ant colony optimization with clustering for solving the dynamic location routing problem
Gao, S., Wang, Y., Cheng, J., Inazumi, Y., & Tang, Z. (2016) · Applied Mathematics and Computation · doi:10.1016/j.amc.2016.03.035 · Cited by 208
Automated Algorithm Configuration and Parameter Tuning
Hoos, H. H. (2011) · Autonomous Search · doi:10.1007/978-3-642-21434-9_3 · Cited by 202
Machine learning for combinatorial optimization: A methodological tour d'horizon
Bengio, Y., Lodi, A., & Prouvost, A. (2021) · European Journal of Operational Research · doi:10.1016/j.ejor.2020.07.063 · Cited by 195
Towards objective measures of algorithm performance across instance space
Smith-Miles, K., Baatar, D., Wreford, B., & Lewis, R. (2014) · Computers & Operations Research · doi:10.1016/j.cor.2013.11.015 · Cited by 194
Model-based methods for continuous and discrete global optimization
Bartz–Beielstein, T., & Zaefferer, M. (2017) · Applied Soft Computing · doi:10.1016/j.asoc.2017.01.039 · Cited by 184
Zhao, F., Zhang, L., Cao, J., & Tang, J. (2021) · Computers & Industrial Engineering · doi:10.1016/j.cie.2020.107082 · Cited by 183
Calvet, L., Armas, J. D., Masip, D., & Juan, A. A. (2017) · Open Mathematics · doi:10.1515/math-2017-0029 · Cited by 176
A Learning-based Iterative Method for Solving Vehicle Routing Problems
Hao, L., Zhang, X., & Yang, S. (2020) · International Conference on Learning Representations · Cited by 175
Algorithm Selection for Combinatorial Search Problems: A Survey
Kotthoff, L. (2014) · AI Magazine · doi:10.1609/aimag.v35i3.2460 · Cited by 172
Handbook of Nature-Inspired and Innovative Computing
(2006) · Kluwer Academic Publishers eBooks · doi:10.1007/0-387-27705-6 · Cited by 171
The tabu search metaheuristic: How we used it
Hertz, A., & de Werra, D. (1990) · Annals of Mathematics and Artificial Intelligence · doi:10.1007/bf01531073 · Cited by 170
A Systematic Literature Review of Adaptive Parameter Control Methods for Evolutionary Algorithms
Aleti, A., & Moser, I. (2017) · ACM Computing Surveys · doi:10.1145/2996355 · Cited by 169
A Classification of Hyper-Heuristic Approaches: Revisited
Burke, E. K., Hyde, M. R., Kendall, G., Ochoa, G., Özcan, E., & Woodward, J. R. (2019) · International Series in Operations Research & Management Science · doi:10.1007/978-3-319-91086-4_14 · Cited by 168
Learning With Case-Injected Genetic Algorithms
Louis, S. J., & McDonnell, J. R. (2004) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2004.823466 · Cited by 166
Algorithm Selection and Scheduling
Kadıoğlu, S., Malitsky, Y., Sabharwal, A., Samulowitz, H., & Sellmann, M. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-23786-7_35 · Cited by 156
A Self-Organizing Multiobjective Evolutionary Algorithm
Zhang, H., Zhou, A., Song, S., Zhang, Q., Gao, X.-Z., & Zhang, J. (2016) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2016.2521868 · Cited by 156
2009 IEEE Congress on Evolutionary Computation
(2009) · doi:10.1109/cec14127.2009 · Cited by 156
Multidimensional Particle Swarm Optimization for Machine Learning and Pattern Recognition
Serkan Kiranyaz, B., İnce, T., & Gabbouj, M. (2013) · Adaptation, learning, and optimization · doi:10.1007/978-3-642-37846-1 · Cited by 150
Combining metaheuristics with mathematical programming, constraint programming and machine learning
Talbi, E. (2015) · Annals of Operations Research · doi:10.1007/s10479-015-2034-y · Cited by 150
Self-citationObjective reduction using a feature selection technique
Jáimes, A. L., Coello, C. A. C., & Chakraborty, D. (2008) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1389095.1389228 · Cited by 145
Automatic design of hyper-heuristic based on reinforcement learning
Choong, S. S., Wong, L., & Lim, C. P. (2018) · Information Sciences · doi:10.1016/j.ins.2018.01.005 · Cited by 142
Voudouris, C., Tsang, E. P. K., & Alsheddy, A. (2006) · Springer eBooks · doi:10.1007/978-3-032-00385-0_2 · Cited by 141
Discovering Dispatching Rules Using Data Mining
Li, X., & Ólafsson, S. (2005) · Journal of Scheduling · doi:10.1007/s10951-005-4781-0 · Cited by 138
Qian, B., Su, J., Wen, Z., Jha, D. N., Li, Y., Guan, Y., Puthal, D., James, P., Yang, R., Zomaya, A. Y., et al. (2021) · ACM Computing Surveys · doi:10.1145/3398020 · Cited by 132
Silva, M. A. L., de Souza, S. R., Souza, M. J. F., & Bazzan, A. L. C. (2019) · Expert Systems with Applications · doi:10.1016/j.eswa.2019.04.056 · Cited by 132
What makes a VRP solution good? The generation of problem-specific knowledge for heuristics
Arnold, F., & Sörensen, K. (2018) · Computers & Operations Research · doi:10.1016/j.cor.2018.02.007 · Cited by 125
Alipour, M. M., Razavi, S. N., Feizi‐Derakhshi, M., & Balafar, M. A. (2017) · Neural Computing and Applications · doi:10.1007/s00521-017-2880-4 · Cited by 123
GPU Computing for Parallel Local Search Metaheuristic Algorithms
Luong, T. V., Melab, N., & Talbi, E. (2011) · IEEE Transactions on Computers · doi:10.1109/tc.2011.206 · Cited by 120
Self-citationTurkeš, R., Sörensen, K., & Hvattum, L. M. (2020) · European Journal of Operational Research · doi:10.1016/j.ejor.2020.10.045 · Cited by 116
A novel design of differential evolution for solving discrete traveling salesman problems
Ali, I. M., Essam, D., & Kasmarik, K. (2019) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2019.100607 · Cited by 114
Extreme Value Based Adaptive Operator Selection
Fialho, A. R. S., Costa, L. D., Schoenauer, M., & Sébag, M. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-87700-4_18 · Cited by 113
Mersmann, O., Bischl, B., Trautmann, H., Wagner, M., Bossek, J., & Neumann, F. (2013) · Annals of Mathematics and Artificial Intelligence · doi:10.1007/s10472-013-9341-2 · Cited by 108
Evolution of Appropriate Crossover and Mutation Operators in a Genetic Process
Hong, T., Wang, H.-S., Lin, W.-Y., & Lee, W. (2002) · Applied Intelligence · doi:10.1023/a:1012815625611 · Cited by 106
Comparison of metamodeling techniques in evolutionary algorithms
Diaz-Manríquez, A., Toscano‐Pulido, G., & Coello, C. A. C. (2016) · Soft Computing · doi:10.1007/s00500-016-2140-z · Cited by 102
A review on the self and dual interactions between machine learning and optimisation
Song, H., Triguero, I., & Özcan, E. (2019) · Progress in Artificial Intelligence · doi:10.1007/s13748-019-00185-z · Cited by 101
A mono surrogate for multiobjective optimization
Loshchilov, I., Schoenauer, M., & Sébag, M. (2010) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1830483.1830571 · Cited by 100
HeuristicLab: A Generic and Extensible Optimization Environment
Wagner, Ş., & Affenzeller, M. (2005) · Springer eBooks · doi:10.1007/3-211-27389-1_130 · Cited by 99
Corne, D., Dhaenens, C., & Jourdan, L. (2012) · European Journal of Operational Research · doi:10.1016/j.ejor.2012.03.039 · Cited by 99
Lughofer, E. D. (2017) · Information Sciences · doi:10.1016/j.ins.2017.06.038 · Cited by 99
Mangialavori, M., Pompei, L., Nardecchia, F., Bisegna, F., Fichera, A., Rizzo, G., Tronchin, L., & Schibuola, L. (2020) · doi:10.1109/ecti-con49241.2020 · Cited by 92
A multi-agent based cooperative approach to scheduling and routing
Martin, S. P., Ouelhadj, D., Beullens, P., Özcan, E., Juan, A. A., & Burke, E. K. (2016) · European Journal of Operational Research · doi:10.1016/j.ejor.2016.02.045 · Cited by 89
Silva, M. A. L., de Souza, S. R., Souza, M. J. F., & Filho, M. F. D. F. (2018) · Applied Soft Computing · doi:10.1016/j.asoc.2018.06.050 · Cited by 87
A Machine Learning-based system for berth scheduling at bulk terminals
de León, A. D., Lalla‐Ruiz, E., Melián-Batista, B., & Moreno-Vega, J. M. (2017) · Expert Systems with Applications · doi:10.1016/j.eswa.2017.06.010 · Cited by 83
Talbi, E. (2012) · Studies in computational intelligence · doi:10.1007/978-3-642-30671-6 · Cited by 81
Self-citationHybridization of GRASP Metaheuristic with Data Mining Techniques
Ribeiro, M. H. F., Plastino, A., & Martins, S. L. (2005) · Journal of Mathematical Modelling and Algorithms · doi:10.1007/s10852-005-9030-1 · Cited by 75
Messelis, T., & Causmaecker, P. D. (2013) · European Journal of Operational Research · doi:10.1016/j.ejor.2013.08.021 · Cited by 70
Kanda, J. Y., de Carvalho, A. C. P. L. F., Hruschka, E. R., Soares, C., & Brazdil, P. (2016) · Neurocomputing · doi:10.1016/j.neucom.2016.04.027 · Cited by 70
A Compass to Guide Genetic Algorithms
Maturana, J., & Saubion, F. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-87700-4_26 · Cited by 68
Innovations and Advances in Computer Sciences and Engineering
Nabende, P., Tiedemann, J., Nerbonne, J., & Sobh, T. (2010) · Springer eBooks · doi:10.1007/978-90-481-3658-2 · Cited by 65
Meignan, D., Koukam, A., & Créput, J.-C. (2009) · Journal of Heuristics · doi:10.1007/s10732-009-9121-7 · Cited by 65
Using Datamining Techniques to Help Metaheuristics: A Short Survey
Jourdan, L., Dhaenens, C., & Talbi, E. (2006) · Lecture notes in computer science · doi:10.1007/11890584_5 · Cited by 64
Self-citationPower economic dispatch using a hybrid genetic algorithm
Yalçinöz, T., & Altun, H. (2001) · IEEE Power Engineering Review · doi:10.1109/39.911360 · Cited by 63
Extreme compass and Dynamic Multi-Armed Bandits for Adaptive Operator Selection
Maturana, J., Fialho, A. R. S., Saubion, F., Schoenauer, M., & Sébag, M. (2009) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2009.4982970 · Cited by 61
A systematic study on meta-heuristic approaches for solving the graph coloring problem
Mostafaie, T., Khiyabani, F. M., & Navimipour, N. J. (2019) · Computers & Operations Research · doi:10.1016/j.cor.2019.104850 · Cited by 61
A survey of dynamic parameter setting methods for nature-inspired swarm intelligence algorithms
Phan, H. D., Ellis, K., Barca, J. C., & Dorin, A. (2019) · Neural Computing and Applications · doi:10.1007/s00521-019-04229-2 · Cited by 59
Evolving Combinatorial Problem Instances That Are Difficult to Solve
Hemert, J. I. V. (2006) · Evolutionary Computation · doi:10.1162/evco.2006.14.4.433 · Cited by 54
A hybrid method of 2-TSP and novel learning-based GA for job sequencing and tool switching problem
Ahmadi, E., Goldengorin, B. I., Süer, G. A., & Mosadegh, H. (2018) · Applied Soft Computing · doi:10.1016/j.asoc.2017.12.045 · Cited by 53
Moradi, B. (2019) · Soft Computing · doi:10.1007/s00500-019-04312-9 · Cited by 53
Xiang, X., Tian, Y., Xiao, J., & Zhang, X. (2019) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2019.2962137 · Cited by 53
A new learning-based adaptive multi-objective evolutionary algorithm
Sun, J., Zhang, H., Zhou, A., Zhang, Q., & Zhang, K. (2018) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2018.04.009 · Cited by 52
Combining an evolutionary algorithm with data mining to solve a single-vehicle routing problem
Santos, H. G., Ochi, L. S., Marinho, E. H., & Drummond, L. M. A. (2006) · Neurocomputing · doi:10.1016/j.neucom.2006.07.008 · Cited by 48
Jourdan, L., Corne, D., Savic, D. A., & Walters, G. A. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-31880-4_58 · Cited by 45
Algorithm Selection as a Bandit Problem with Unbounded Losses
Gagliolo, M., & Schmidhuber, J. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-13800-3_7 · Cited by 42
A Memetic Algorithm for the Green Vehicle Routing Problem
Peng, B., Zhang, Y., Gajpal, Y., & Chen, X. (2019) · Sustainability · doi:10.3390/su11216055 · Cited by 42
Adaptive recommendation model using meta-learning for population-based algorithms
Chu, X., Cai, F., Cui, C., Hu, M., Li, L., & Qin, Q. (2018) · Information Sciences · doi:10.1016/j.ins.2018.10.013 · Cited by 41
Applying Deep Learning and Reinforcement Learning to Traveling Salesman Problem
Miki, S., Yamamoto, D., & Ebara, H. (2018) · International Conference on Computing, Electronics & Communications Engineering (iCCECE) · doi:10.1109/iccecome.2018.8659266 · Cited by 41
Karimi-Mamaghan, M., Mohammadi, M., Jula, P., Pirayesh, A., & Ahmadi, H. (2020) · European Journal of Operational Research · doi:10.1016/j.ejor.2020.01.061 · Cited by 39
Self-citationA hybrid data mining GRASP with path-relinking
Barbalho, H., Rosseti, I., Martins, S. L., & Plastino, A. (2012) · Computers & Operations Research · doi:10.1016/j.cor.2012.02.022 · Cited by 38
Lodi, A., Mossina, L., & Rachelson, E. (2020) · EURO Journal on Transportation and Logistics · doi:10.1016/j.ejtl.2020.100023 · Cited by 37
Pons‐Prats, J., Martí Coma Company, Bertran, J., Roca, X., & Bugeda, G. (2018) · Computational methods in applied sciences · doi:10.1007/978-3-319-89890-2 · Cited by 37
Meta-modeling using generalized regression neural network and particle swarm optimization
Park, J., & Kim, K.-Y. J. (2016) · Applied Soft Computing · doi:10.1016/j.asoc.2016.11.029 · Cited by 36
Machine learning into metaheuristics: A survey and taxonomy of data-driven metaheuristicsPreprint
Talbi, E. (2020) · HAL (Le Centre pour la Communication Scientifique Directe) · Cited by 31
Self-citationA data mining approach for population-based methods to solve the JSSP
Nasiri, M. M., Salesi, S., Rahbari, A., Salmanzadeh-Meydani, N., & Abdollai, M. (2018) · Soft Computing · doi:10.1007/s00500-018-3663-2 · Cited by 26
Dantas, A., & Pozo, A. (2019) · Theoretical Computer Science · doi:10.1016/j.tcs.2019.10.033 · Cited by 25
A hybrid breakout local search and reinforcement learning approach to the vertex separator problem
Benlic, U., Epitropakis, M. G., & Burke, E. K. (2017) · European Journal of Operational Research · doi:10.1016/j.ejor.2017.01.023 · Cited by 24
Gunawan, A., Lau, H. C., & Lu, K. Y. (2018) · Computers & Industrial Engineering · doi:10.1016/j.cie.2018.05.016 · Cited by 21
An experimental study of adaptive control for evolutionary algorithms
di Tollo, G., Lardeux, F., Maturana, J., & Saubion, F. (2015) · Applied Soft Computing · doi:10.1016/j.asoc.2015.06.016 · Cited by 20
Hao, J., Liu, M., Lin, J., & Wu, C. (2015) · Computers & Operations Research · doi:10.1016/j.cor.2015.08.005 · Cited by 19
Kanda, J. Y., Soares, C., Hruschka, E. R., & de Carvalho, A. C. P. L. F. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-34487-9_59 · Cited by 18
Analysis on Topological Properties of Dalian Hazardous Materials Road Transportation Network
Chong, P., Shuai, B., Deng, S., Yang, J., & Hui, Y. (2015) · Mathematical Problems in Engineering · doi:10.1155/2015/340780 · Cited by 17
Portfolio-Based Algorithm Selection for Circuit QBFs
Hoos, H. H., Peitl, T., Slivovsky, F., & Szeider, S. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-98334-9_13 · Cited by 17
Francesca, G., Pellegrini, P., Stützle, T., & Birattari, M. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-20364-0_18 · Cited by 16
Meta-Learning for Optimization: A Case Study on the Flowshop Problem Using Decision Trees
Pavelski, L. M., Delgado, M., & Kessaci, M. (2018) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2018.8477664 · Cited by 12
Algorithm selection for solving educational timetabling problems
de la Rosa-Rivera, F., Nunez-Varela, J. I., Ortíz-Bayliss, J. C., & Terashima‐Marín, H. (2021) · Expert Systems with Applications · doi:10.1016/j.eswa.2021.114694 · Cited by 12
A tournament-based competitive-cooperative multiagent architecture for real parameter optimization
Lotfi, N., & Acan, A. (2015) · Soft Computing · doi:10.1007/s00500-015-1768-4 · Cited by 11
Synchronous vs. Asynchronous Cooperative Approach to Solving the Vehicle Routing Problem
Barbucha, D. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-16693-8_42 · Cited by 8
Haghighi, M., Zahedi, M. H., & Ghazizadeh, M. (2009) · Springer eBooks · doi:10.1007/978-90-481-3658-2_57 · Cited by 7
Cooperative Solution to the Vehicle Routing Problem
Barbucha, D. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-13541-5_19 · Cited by 7
Chang, Y.-C. (2017) · Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics · doi:10.1109/smc.2017.8122633 · Cited by 7
Applying Algorithm Selection – a Case Study for the Generalised Assignment Problem
Degroote, H., González–Velarde, J. L., & Causmaecker, P. D. (2018) · Electronic Notes in Discrete Mathematics · doi:10.1016/j.endm.2018.07.027 · Cited by 7
Pavelski, L. M., Kessaci, M., & Delgado, M. (2018) · Brazilian Conference on Intelligent Systems · doi:10.1109/bracis.2018.00036 · Cited by 5
Cited by
Particle Swarm Optimization: A Comprehensive Survey
Shami, T. M., El-Saleh, A. A., Alswaitti, M., Al-Tashi, Q., Summakieh, M. A., & Mirjalili, S. (2022) · IEEE Access · doi:10.1109/access.2022.3142859 · Cited by 1,584
Strielkowski, W., Vlasov, A., Selivanov, K., Muraviev, K., & Shakhnov, V. (2023) · Energies · doi:10.3390/en16104025 · Cited by 237
Sustainable energies and machine learning: An organized review of recent applications and challenges
Ifaei, P., Nazari-Heris, M., Tayerani Charmchi, A. S., Asadi, S., & Yoo, C. (2023) · Energy · doi:10.1016/j.energy.2022.126432 · Cited by 79
Metadata
- Authors
- Karimi-Mamaghan, M., Mohammadi, M., Meyer, P., Karimi-Mamaghan, A. M., & Talbi, E.-G.
- Venue
- European Journal of Operational Research
- Publisher
- Elsevier BV
- Published
- 2022-01
- Volume
- 296
- Issue
- 2
- Pages
- 393-422
- ISSN
- 0377-2217 (ISSN-L)
- OpenAlex
- W3159134414
- Cited by
- 462
- References
- 177
- FWCI
- 24.35
- Type
- journal article
- Language
- en
- Open access
- hybrid
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.