Abstract
Adaptive Large Neighborhood Search (ALNS) is used to solve NP-hard practical problems. Selecting operators and changing parameters to match a specific purpose is a difficult aspect of metaheuristic design. Our proposal concerns ALNS operator selection. Classical ALNS uses “roulette wheel selection” (RWS) to pick operators during the search phase. Choosing operators with RWS is a big challenge because an operator will almost always take the best spot in the roulette, whereas evolutionary algorithms require a balance between exploration and exploitation. We provide an improved ALNS metaheuristic for the capacitated vehicle routing problem (CVRP) that balances exploration and exploitation. The suggested strategy favors the most successful operators using reinforcement learning, notably the Q-learning algorithm. The experimental study shows that the suggested approach works well and is comparable to the classic ALNS.
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
Mlejnek, J., Kubalik, J.: Evolutionary hyperheuristic for capacitated vehicle routing problem. In: Proceedings Of The 15th Annual Conference Companion on Genetic and Evolutionary Computation, pp. 219-220 (2013)
Sanchez, M., Cruz-Duarte, J., Ortız-Bayliss, J., Ceballos, H., Terashima-Marin, H., Amaya, I.: A systematic review of hyper-heuristics on combinatorial optimization problems. IEEE Access 8, 128068–128095 (2020)
Cowling, P., Kendall, G., Soubeiga, E.: A hyperheuristic approach to scheduling a sales summit. In: International Conference on the Practice and Theory of Automated Timetabling, pp. 176-190 (2000)
Ropke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp. Sci. 40, 455–472 (2006)
Mara, S., Norcahyo, R., Jodiawan, P., Lusiantoro, L., Rifai, A.: A survey of adaptive large neighborhood search algorithms and applications. Computers & Operations Research, pp. 105903 (2022)
Chowdhury, S., Marufuzzaman, M., Tunc, H., Bian, L., Bullington, W.: A modified Ant Colony Optimization algorithm to solve a dynamic traveling salesman problem: a case study with drones for wildlife surveillance. J. Comput. Design Eng. 6, 368–386 (2019)
Baker, J., et al.: Reducing bias and inefficiency in the selection algorithm. In: Proceedings of the Second International Conference On Genetic Algorithms, vol. 206, pp. 14–21 (1987)
Dantzig, G., Ramser, J.: The truck dispatching problem. Manage. Sci. 6, 80–91 (1959)
Clarke, G., Wright, J.: Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12, 568–581 (1964)
Arda, Y., Crama, Y., François, V.: An adaptive large neighborhood search for a vehicle routing problem with multiple trips and driver shifts (2013)
Chen, S., Chen, R., Wang, G., Gao, J., Sangaiah, A.: An adaptive large neighborhood search heuristic for dynamic vehicle routing problems. Comput. Electr. Eng. 67, 596–607 (2018)
Hof, J., Schneider, M.: An adaptive large neighborhood search with path relinking for a class of vehicle-routing problems with simultaneous pickup and delivery. Networks 74, 207–250 (2019)
Li, Y., Chen, H., Prins, C.: Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests. Eur. J. Oper. Res. 252, 27–38 (2016)
He, L., Liu, X., Laporte, G., Chen, Y., Chen, Y.: An improved adaptive large neighborhood search algorithm for multiple agile satellites scheduling. Comput. Oper. Res. 100, 12–25 (2018)
Sacramento, D., Pisinger, D., Ropke, S.: An adaptive large neighborhood search metaheuristic for the vehicle routing problem with drones. Transp. Res. Part C: Emerg. Technol. 102, 289–315 (2019)
Shirokikh, V., Zakharov, V.: Dynamic adaptive large neighborhood search for inventory routing problem, pp. 231–241. Modelling, Computation And Optimization In Information Systems And Management Sciences (2015)
Shaw, P.: 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 (1998)
Turkeš, R., Sörensen, K., Hvattum, L.: Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search. Eur. J. Oper. Res. 292, 423–442 (2021)
Gunawan, A., Lau, H., Lu, K.: ADOPT: combining parameter tuning and adaptive operator ordering for solving a class of orienteering problems. Comput. Ind. Eng. 121, 82–96 (2018)
Silvestre Fialho, Á.: Adaptive operator selection for optimization. (Paris 11, 2010)
Wauters, T., Verbeeck, K., Causmaecker, P., Berghe, G.: Boosting metaheuristic search using reinforcement learning. In: Hybrid Metaheuristics, pp. 433-452 (2013)
Gretsista, A., Burke, E.: An iterated local search framework with adaptive operator selection for nurse rostering. In: International Conference On Learning And Intelligent Optimization, pp. 93-108 (2017)
Fialho, Á., Costa, L., Schoenauer, M., Sebag, M.: Extreme value based adaptive operator selection. In: International Conference on Parallel Problem Solving From Nature, pp. 175-184 (2008)
Santos, J., Melo, J., Neto, A., Aloise, D.: Reactive search strategies using reinforcement learning, local search algorithms and variable neighborhood search. Expert Syst. Appl. 41, 4939–4949 (2014)
Mehdi, N., Abdelmoutalib, M., Imad, H.: A modified ALNS algorithm for vehicle routing problems with time windows. J. Phys. Conf. Ser. 1743, 012029 (2021)
Nasri, M., Hafidi, I., Metrane, A.: Multithreading parallel robust approach for the VRPTW with uncertain service and travel times. Symmetry. 13, 36 (2020)
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
Boualamia, H., Metrane, A., Hafidi, I., Mellouli, O. (2023). A New Adaptation Mechanism of the ALNS Algorithm Using Reinforcement Learning. In: Aboutabit, N., Lazaar, M., Hafidi, I. (eds) Advances in Machine Intelligence and Computer Science Applications. ICMICSA 2022. Lecture Notes in Networks and Systems, vol 656. Springer, Cham. https://doi.org/10.1007/978-3-031-29313-9_1
Download citation
DOI: https://doi.org/10.1007/978-3-031-29313-9_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-28845-6
Online ISBN: 978-3-031-29313-9
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)