Abstract
Tabu Search is among one of the metaheuristic algorithms that are widely recognized as efficient approaches to solve many combinatorial problems. Studies to improve the performance of metaheuristics have increasingly relied on the use of various methods, either combining different metaheuristics or originating outside of the metaheuristic field. This paper presents a learning algorithm to improve the performance of tabu search by reducing its search space and the evaluation effort. We study its performance using classification methods in an attempt to select moves through the search space more intelligently. The experimental results demonstrate the benefit of using a learning mechanism under deterministic environment and with uncertainty conditions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Glover, F.: Heuristics for integer programming using surrogate constraints. Decis. Sci. 8(1), 156–166 (1977)
Niroumandrad, N., Lahrichi, N.: A stochastic tabu search algorithm to align physician schedule with patient flow. Health Care Manag. Sci. 21(2), 244–258 (2018)
Battiti, R., Brunato, M.: The lion way. Machine Learning plus Intelligent Optimization. LIONlab, University of Trento, Italy, 94 (2014)
Hafiz, F., Abdennour, A.: Particle swarm algorithm variants for the quadratic assignment problems-a probabilistic learning approach. Expert Syst. Appl. 44, 413–431 (2016)
Boyan, J., Moore, A.W.: Learning evaluation functions to improve optimization by local search. J. Mach. Learn. Res. 1, 77–112 (2000)
Baluja, S., et al.: Statistical machine learning for large-scale optimization (2000)
Boyan, J., Moore, A.W.: Learning evaluation functions for global optimization and Boolean satisfiability. In: AAAI/IAAI, pp. 3–10 (1998)
Bongiovanni, C., Kaspi, M., Cordeau, J.-F., Geroliminis, N.: A predictive large neighborhood search for the dynamic electric autonomous dial-a-ride problem. Technical report (2020)
Thevenin, S., Zufferey, N.: Learning variable neighborhood search for a scheduling problem with time windows and rejections. Discret. Appl. Math. 261, 344–353 (2019)
Sun, Y., Li, X., Ernst, A.: Using statistical measures and machine learning for graph reduction to solve maximum weight clique problems. IEEE Trans. Pattern Anal. Mach. Intell. 43, 1746–1760 (2019)
Lauri, J., Dutta, S.: Fine-grained search space classification for hard enumeration variants of subset problems. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 33, pp. 2314–2321 (2019)
Abbasi, B., Babaei, T., Hosseinifard, Z., Smith-Miles, K., Dehghani, M.: Predicting solutions of large-scale optimization problems via machine learning: a case study in blood supply chain management. Comput. Oper. Res. 119, 104941 (2020)
Fischetti, M., Fraccaro, M.: Machine learning meets mathematical optimization to predict the optimal production of offshore wind parks. Comput. Oper. Res. 106, 289–297 (2019)
Karimi-Mamaghan, M., Mohammadi, M., Meyer, P., Karimi-Mamaghan, A.M., Talbi, E.-G.: Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art. Eur. J. Oper. Res. 296, 393–422 (2021)
Talbi, E.-G.: Machine learning into metaheuristics: a survey and taxonomy of data-driven metaheuristics (2020)
Glover, F., Hao, J.-K.: Diversification-based learning in computing and optimization. J. Heuristics 25(4–5), 521–537 (2019)
Christopher, R., Riley, L., Rego, C.: Intensification, diversification, and learning via relaxation adaptive memory programming: a case study on resource constrained project scheduling. J. Heuristics 25(4–5), 793–807 (2019)
Schindl, D., Zufferey, N.: A learning tabu search for a truck allocation problem with linear and nonlinear cost components. Nav. Res. Logist. (NRL) 62(1), 32–45 (2015)
Glover, F., Laguna, M.: Tabu Search. Wiley, Hoboken (1993)
Wang, Y., Qinghua, W., Glover, F.: Effective metaheuristic algorithms for the minimum differential dispersion problem. Eur. J. Oper. Res. 258(3), 829–843 (2017)
Wu, Q., Wang, Y., Glover, F.: Advanced algorithms for bipartite Boolean quadratic programs guided by tabu search, strategic oscillation and path relinking (2017)
Glover, F.: Tabu search: a tutorial. Interfaces 20(4), 74–94 (1990)
Arnold, F., Santana, Í., Sörensen, K., Vidal, T.: PILS: exploring high-order neighborhoods by pattern mining and injection. Pattern Recogn. 116, 107957 (2021)
Berthold, T.: Measuring the impact of primal heuristics. Oper. Res. Lett. 41(6), 611–614 (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Niroumandrad, N., Lahrichi, N., Lodi, A. (2023). A Learning Metaheuristic Algorithm for a Scheduling Application. In: Di Gaspero, L., Festa, P., Nakib, A., Pavone, M. (eds) Metaheuristics. MIC 2022. Lecture Notes in Computer Science, vol 13838. Springer, Cham. https://doi.org/10.1007/978-3-031-26504-4_6
Download citation
DOI: https://doi.org/10.1007/978-3-031-26504-4_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-26503-7
Online ISBN: 978-3-031-26504-4
eBook Packages: Computer ScienceComputer Science (R0)