{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T04:38:02Z","timestamp":1780547882436,"version":"3.54.1"},"reference-count":68,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T00:00:00Z","timestamp":1753833600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T00:00:00Z","timestamp":1753833600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper. Res. Forum"],"DOI":"10.1007\/s43069-025-00513-1","type":"journal-article","created":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T09:49:11Z","timestamp":1753868951000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A New Adaptation Mechanism of the ALNS Algorithm Using Reinforcement Learning"],"prefix":"10.1007","volume":"6","author":[{"given":"Hajar","family":"Boualamia","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Abdelmoutalib","family":"Metrane","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Imad","family":"Hafidi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Oumaima","family":"Mellouli","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,7,30]]},"reference":[{"issue":"1","key":"513_CR1","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1186\/s42162-024-00430-3","volume":"7","author":"J Sager","year":"2024","unstructured":"Sager J, Nie\u00dfe A (2024) Combinatorial chance-constrained economic optimization of distributed energy resources. Energy Inform 7(1):128","journal-title":"Energy Inform"},{"issue":"1","key":"513_CR2","first-page":"43","volume":"51","author":"F Ganji","year":"2019","unstructured":"Ganji F, Zamani Z (2019) Optimization of profit and customer satisfaction in combinatorial production and purchase model by genetic algorithm. J Algorithms Comput 51(1):43\u201354","journal-title":"J Algorithms Comput"},{"key":"513_CR3","doi-asserted-by":"publisher","first-page":"104522","DOI":"10.1016\/j.trc.2024.104522","volume":"160","author":"J Lehmann","year":"2024","unstructured":"Lehmann J, Winkenbach M (2024) A matheuristic for the two-echelon multi-trip vehicle routing problem with mixed pickup and delivery demand and time windows. Transp Res Part C Emerg Technol 160:104522","journal-title":"Transp Res Part C Emerg Technol"},{"key":"513_CR4","doi-asserted-by":"publisher","first-page":"106531","DOI":"10.1016\/j.cor.2024.106531","volume":"164","author":"JF Sze","year":"2024","unstructured":"Sze JF, Salhi S, Wassan N (2024) An adaptive variable neighbourhood search approach for the dynamic vehicle routing problem. Comput Oper Res 164:106531","journal-title":"Comput Oper Res"},{"issue":"1","key":"513_CR5","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.ejor.2013.05.013","volume":"231","author":"HI Calvete","year":"2013","unstructured":"Calvete HI, Gal\u00e9 C, Iranzo JA (2013) An efficient evolutionary algorithm for the ring star problem. Eur J Oper Res 231(1):22\u201333","journal-title":"Eur J Oper Res"},{"issue":"1","key":"513_CR6","first-page":"65","volume":"1","author":"JE Mitchell","year":"2002","unstructured":"Mitchell JE (2002) Branch-and-cut algorithms for combinatorial optimization problems. Handbook of Applied Optimization 1(1):65\u201377","journal-title":"Handbook of Applied Optimization"},{"issue":"3","key":"513_CR7","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1145\/937503.937505","volume":"35","author":"C Blum","year":"2003","unstructured":"Blum C, Roli A (2003) Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput Surv 35(3):268\u2013308","journal-title":"ACM Comput Surv"},{"key":"513_CR8","doi-asserted-by":"crossref","unstructured":"Mirjalili S, Mirjalili S (2019) Genetic algorithm. Evolutionary algorithms and neural networks: theory and applications, pp 43\u201355","DOI":"10.1007\/978-3-319-93025-1_4"},{"key":"513_CR9","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s10462-009-9137-2","volume":"33","author":"F Neri","year":"2010","unstructured":"Neri F, Tirronen V (2010) Recent advances in differential evolution: a survey and experimental analysis. Artif Intell Rev 33:61\u2013106","journal-title":"Artif Intell Rev"},{"key":"513_CR10","doi-asserted-by":"crossref","unstructured":"Aarts E, Korst J, Michiels W (2005) Simulated annealing. Search methodologies: introductory tutorials in optimization and decision support techniques, pp 187\u2013210","DOI":"10.1007\/0-387-28356-0_7"},{"issue":"1","key":"513_CR11","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1109\/101.17235","volume":"5","author":"RA Rutenbar","year":"1989","unstructured":"Rutenbar RA (1989) Simulated annealing algorithms: an overview. IEEE Circuits Devices Mag 5(1):19\u201326","journal-title":"IEEE Circuits Devices Mag"},{"key":"513_CR12","doi-asserted-by":"publisher","first-page":"3269","DOI":"10.1007\/s11831-020-09498-y","volume":"28","author":"V Kumar","year":"2021","unstructured":"Kumar V, Kumar D (2021) A systematic review on firefly algorithm: past, present, and future. Arch Comput Methods Eng 28:3269\u20133291","journal-title":"Arch Comput Methods Eng"},{"issue":"2","key":"513_CR13","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s00500-016-2474-6","volume":"22","author":"D Wang","year":"2018","unstructured":"Wang D, Tan D, Liu L (2018) Particle swarm optimization algorithm: an overview. Soft Comput 22(2):387\u2013408","journal-title":"Soft Comput"},{"issue":"3","key":"513_CR14","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1016\/0377-2217(96)00007-0","volume":"92","author":"M Pirlot","year":"1996","unstructured":"Pirlot M (1996) General local search methods. Eur J Oper Res 92(3):493\u2013511","journal-title":"Eur J Oper Res"},{"issue":"2","key":"513_CR15","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/j.ejor.2021.04.032","volume":"296","author":"M Karimi-Mamaghan","year":"2022","unstructured":"Karimi-Mamaghan M, Mohammadi M, Meyer P, Karimi-Mamaghan AM, Talbi E-G (2022) Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art. Eur J Oper Res 296(2):393\u2013422","journal-title":"Eur J Oper Res"},{"issue":"3","key":"513_CR16","doi-asserted-by":"publisher","first-page":"1419","DOI":"10.1016\/j.asoc.2012.02.009","volume":"13","author":"I Pereira","year":"2013","unstructured":"Pereira I, Madureira A (2013) Self-optimization module for scheduling using case-based reasoning. Appl Soft Comput 13(3):1419\u20131432","journal-title":"Appl Soft Comput"},{"key":"513_CR17","doi-asserted-by":"crossref","unstructured":"Pereira I, Madureira A (2016) Self-optimizing a multi-agent scheduling system: a racing based approach. In: Intelligent distributed computing IX: Proceedings of the 9th international symposium on intelligent distributed computing\u2013IDC\u20192015, Guimar\u00e3es, Portugal, October 2015. Springer, pp 275\u2013284","DOI":"10.1007\/978-3-319-25017-5_26"},{"issue":"4","key":"513_CR18","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S Ropke","year":"2006","unstructured":"Ropke S, Pisinger D (2006) An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp Sci 40(4):455\u2013472","journal-title":"Transp Sci"},{"key":"513_CR19","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.cie.2018.05.016","volume":"121","author":"A Gunawan","year":"2018","unstructured":"Gunawan A, Lau HC, Lu K (2018) Adopt: combining parameter tuning and adaptive operator ordering for solving a class of orienteering problems. Comput Ind Eng 121:82\u201396","journal-title":"Comput Ind Eng"},{"key":"513_CR20","doi-asserted-by":"crossref","unstructured":"Mara STW, Norcahyo R, Jodiawan P, Lusiantoro L, Rifai AP (2022) A survey of adaptive large neighborhood search algorithms and applications. Comput Oper Res 105903","DOI":"10.1016\/j.cor.2022.105903"},{"key":"513_CR21","unstructured":"Baker JE et al (1987) Reducing bias and inefficiency in the selection algorithm. In: Proceedings of the second international conference on genetic algorithms, vol 206, pp 14\u201321"},{"key":"513_CR22","doi-asserted-by":"crossref","unstructured":"Mehdi N, Abdelmoutalib M, Imad H (2021) A modified ALNS algorithm for vehicle routing problems with time windows. In: Journal of Physics: Conference Series, vol 1743. IOP Publishing, p 012029","DOI":"10.1088\/1742-6596\/1743\/1\/012029"},{"key":"513_CR23","doi-asserted-by":"crossref","unstructured":"Reijnen R, Zhang Y, Lau HC, Bukhsh Z (2024) Online control of adaptive large neighborhood search using deep reinforcement learning. [Online]. Available: https:\/\/arxiv.org\/abs\/2211.00759","DOI":"10.1609\/icaps.v34i1.31507"},{"issue":"1","key":"513_CR24","first-page":"5243749","volume":"2020","author":"Y Chen","year":"2020","unstructured":"Chen Y, Chen M, Wen J, Chen Y, Xiang W (2020) An adaptive large neighborhood search algorithm for the satellite data transmission scheduling problem. Int J Aerosp Eng 2020(1):5243749","journal-title":"Int J Aerosp Eng"},{"issue":"2","key":"513_CR25","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.ejor.2020.07.063","volume":"290","author":"Y Bengio","year":"2021","unstructured":"Bengio Y, Lodi A, Prouvost A (2021) Machine learning for combinatorial optimization: a methodological tour d\u2019horizon. Eur J Oper Res 290(2):405\u2013421","journal-title":"Eur J Oper Res"},{"key":"513_CR26","doi-asserted-by":"crossref","unstructured":"Wauters T, Verbeeck K, Causmaecker PD, Berghe GV (2013) Boosting metaheuristic search using reinforcement learning. In: Hybrid metaheuristics. Springer, pp 433\u2013452","DOI":"10.1007\/978-3-642-30671-6_17"},{"key":"513_CR27","doi-asserted-by":"publisher","first-page":"108126","DOI":"10.1016\/j.cie.2022.108126","volume":"168","author":"J-J Wang","year":"2022","unstructured":"Wang J-J, Wang L (2022) A cooperative memetic algorithm with feedback for the energy-aware distributed flow-shops with flexible assembly scheduling. Comput Ind Eng 168:108126","journal-title":"Comput Ind Eng"},{"issue":"6","key":"513_CR28","doi-asserted-by":"publisher","first-page":"5051","DOI":"10.1109\/TCYB.2020.3026571","volume":"52","author":"Z Pan","year":"2020","unstructured":"Pan Z, Lei D, Wang L (2020) A knowledge-based two-population optimization algorithm for distributed energy-efficient parallel machines scheduling. IEEE Trans Cybern 52(6):5051\u20135063","journal-title":"IEEE Trans Cybern"},{"key":"513_CR29","doi-asserted-by":"crossref","unstructured":"Zhao F, Di S, Wang L (2022) A hyperheuristic with q-learning for the multiobjective energy-efficient distributed blocking flow shop scheduling problem. IEEE Trans Cybern","DOI":"10.1109\/TCYB.2022.3192112"},{"key":"513_CR30","doi-asserted-by":"crossref","unstructured":"Zhao F, Jiang T, Wang L (2022) A reinforcement learning driven cooperative meta-heuristic algorithm for energy-efficient distributed no-wait flow-shop scheduling with sequence-dependent setup time. IEEE Trans Ind Inform","DOI":"10.1109\/TII.2022.3218645"},{"key":"513_CR31","doi-asserted-by":"publisher","first-page":"107082","DOI":"10.1016\/j.cie.2020.107082","volume":"153","author":"F Zhao","year":"2021","unstructured":"Zhao F, Zhang L, Cao J, Tang J (2021) A cooperative water wave optimization algorithm with reinforcement learning for the distributed assembly no-idle flowshop scheduling problem. Comput Ind Eng 153:107082","journal-title":"Comput Ind Eng"},{"issue":"1","key":"513_CR32","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig GB, Ramser JH (1959) The truck dispatching problem. Manage Sci 6(1):80\u201391","journal-title":"Manage Sci"},{"issue":"4","key":"513_CR33","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G Clarke","year":"1964","unstructured":"Clarke G, Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12(4):568\u2013581","journal-title":"Oper Res"},{"key":"513_CR34","doi-asserted-by":"crossref","unstructured":"Toth P, Vigo D (2014) Vehicle routing: problems, methods, and applications. SIAM","DOI":"10.1137\/1.9781611973594"},{"issue":"4","key":"513_CR35","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1287\/trsc.1090.0301","volume":"43","author":"G Laporte","year":"2009","unstructured":"Laporte G (2009) Fifty years of vehicle routing. Transp Sci 43(4):408\u2013416","journal-title":"Transp Sci"},{"key":"513_CR36","doi-asserted-by":"crossref","unstructured":"Borcinova Z (2017) Two models of the capacitated vehicle routing problem. Croat Oper Res Rev 463\u2013469","DOI":"10.17535\/crorr.2017.0029"},{"key":"513_CR37","doi-asserted-by":"crossref","unstructured":"Krempser E, Fialho \u00c1, Barbosa HJ (2012) Adaptive operator selection at the hyper-level. In: International conference on parallel problem solving from nature. Springer, pp 378\u2013387","DOI":"10.1007\/978-3-642-32964-7_38"},{"issue":"2","key":"513_CR38","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/j.ejor.2020.10.045","volume":"292","author":"R Turke\u0161","year":"2021","unstructured":"Turke\u0161 R, S\u00f6rensen K, Hvattum LM (2021) Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search. Eur J Oper Res 292(2):423\u2013442","journal-title":"Eur J Oper Res"},{"key":"513_CR39","unstructured":"Silvestre\u00a0Fialho \u00c1R (2010) Adaptive operator selection for optimization, Ph.D. dissertation, Paris 11"},{"key":"513_CR40","doi-asserted-by":"crossref","unstructured":"Gretsista A, Burke EK (2017) An iterated local search framework with adaptive operator selection for nurse rostering. In: International conference on learning and intelligent optimization. Springer, pp 93\u2013108","DOI":"10.1007\/978-3-319-69404-7_7"},{"key":"513_CR41","doi-asserted-by":"crossref","unstructured":"Fialho \u00c1, Costa LD, Schoenauer M, Sebag M (2008) Extreme value based adaptive operator selection. In: International conference on parallel problem solving from nature. Springer, pp 175\u2013184","DOI":"10.1007\/978-3-540-87700-4_18"},{"issue":"10","key":"513_CR42","doi-asserted-by":"publisher","first-page":"4939","DOI":"10.1016\/j.eswa.2014.01.040","volume":"41","author":"JPQ dos Santos","year":"2014","unstructured":"dos Santos JPQ, de Melo JD, Neto ADD, Aloise D (2014) Reactive search strategies using reinforcement learning, local search algorithms and variable neighborhood search. Expert Syst Appl 41(10):4939\u20134949","journal-title":"Expert Syst Appl"},{"key":"513_CR43","unstructured":"Arda Y, Crama Y, Fran\u00e7ois V (2013) An adaptive large neighborhood search for a vehicle routing problem with multiple trips and driver shifts"},{"key":"513_CR44","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1016\/j.compeleceng.2018.02.049","volume":"67","author":"S Chen","year":"2018","unstructured":"Chen S, Chen R, Wang G-G, Gao J, Sangaiah AK (2018) An adaptive large neighborhood search heuristic for dynamic vehicle routing problems. Comput Electr Eng 67:596\u2013607","journal-title":"Comput Electr Eng"},{"issue":"3","key":"513_CR45","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1002\/net.21879","volume":"74","author":"J Hof","year":"2019","unstructured":"Hof J, Schneider M (2019) An adaptive large neighborhood search with path relinking for a class of vehicle-routing problems with simultaneous pickup and delivery. Networks 74(3):207\u2013250","journal-title":"Networks"},{"issue":"1","key":"513_CR46","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.ejor.2015.12.032","volume":"252","author":"Y Li","year":"2016","unstructured":"Li Y, Chen H, Prins C (2016) Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests. Eur J Oper Res 252(1):27\u201338","journal-title":"Eur J Oper Res"},{"key":"513_CR47","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.cor.2018.06.020","volume":"100","author":"L He","year":"2018","unstructured":"He L, Liu X, Laporte G, Chen Y, Chen Y (2018) An improved adaptive large neighborhood search algorithm for multiple agile satellites scheduling. Comput Oper Res 100:12\u201325","journal-title":"Comput Oper Res"},{"key":"513_CR48","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.trc.2019.02.018","volume":"102","author":"D Sacramento","year":"2019","unstructured":"Sacramento D, Pisinger D, Ropke S (2019) An adaptive large neighborhood search metaheuristic for the vehicle routing problem with drones. Transp Res Part C Emerg Technol 102:289\u2013315","journal-title":"Transp Res Part C Emerg Technol"},{"key":"513_CR49","doi-asserted-by":"crossref","unstructured":"Shirokikh VA, Zakharov VV (2015) Dynamic adaptive large neighborhood search for inventory routing problem. In: Modelling, computation and optimization in information systems and management sciences. Springer, pp 231\u2013241","DOI":"10.1007\/978-3-319-18161-5_20"},{"key":"513_CR50","doi-asserted-by":"crossref","unstructured":"Labdiad F, Nasri M, Khalfi H, Hafidi I (2021) Vrp with flexible time windows using the ALNS metaheuristic algorithm. In: International conference on numerical analysis and optimization days. Springer, pp 1\u201312","DOI":"10.1007\/978-3-030-83442-5_1"},{"key":"513_CR51","doi-asserted-by":"crossref","unstructured":"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. Springer, pp 417\u2013431","DOI":"10.1007\/3-540-49481-2_30"},{"key":"513_CR52","doi-asserted-by":"crossref","unstructured":"Pisinger D, Ropke S (2010) Large neighborhood search. In: Handbook of metaheuristics. Springer, pp 399\u2013419","DOI":"10.1007\/978-1-4419-1665-5_13"},{"key":"513_CR53","doi-asserted-by":"crossref","unstructured":"Drake JH, \u00d6zcan E, Burke EK (2012) An improved choice function heuristic selection for cross domain heuristic search. In: International conference on parallel problem solving from nature. Springer, pp 307\u2013316","DOI":"10.1007\/978-3-642-32964-7_31"},{"key":"513_CR54","unstructured":"Sutton RS, Barto AG (1998) Reinforcement learning: an introduction MIT Press, vol 22447. Cambridge, MA"},{"issue":"14","key":"513_CR55","doi-asserted-by":"publisher","first-page":"10007","DOI":"10.1007\/s00521-019-04527-9","volume":"32","author":"Y Xu","year":"2020","unstructured":"Xu Y, Pi D (2020) A reinforcement learning-based communication topology in particle swarm optimization. Neural Comput Appl 32(14):10007\u201310032","journal-title":"Neural Comput Appl"},{"key":"513_CR56","doi-asserted-by":"crossref","unstructured":"Gambardella L, Ant-Q DM (1994) A reinforcement l. earning approach to the traveling salesman problem. In: Proceedings of ML-95 Twelfth Intern Conf on Machining, pp 252\u2013260","DOI":"10.1016\/B978-1-55860-377-6.50039-6"},{"key":"513_CR57","doi-asserted-by":"publisher","first-page":"106099","DOI":"10.1016\/j.asoc.2020.106099","volume":"89","author":"C Qu","year":"2020","unstructured":"Qu C, Gai W, Zhong M, Zhang J (2020) A novel reinforcement learning based grey wolf optimizer algorithm for unmanned aerial vehicles (UAVs) path planning. Appl Soft Comput 89:106099","journal-title":"Appl Soft Comput"},{"issue":"3","key":"513_CR58","first-page":"279","volume":"8","author":"CJ Watkins","year":"1992","unstructured":"Watkins CJ, Dayan P (1992) Q-learning. Mach Learn 8(3):279\u2013292","journal-title":"Mach Learn"},{"key":"513_CR59","unstructured":"Mnih V, Kavukcuoglu K, Silver D, Graves A, Antonoglou I, Wierstra D, Riedmiller M (2013) Playing atari with deep reinforcement learning. arXiv:1312.5602"},{"key":"513_CR60","unstructured":"Watkins CJCH (1989) Learning from delayed rewards"},{"issue":"3","key":"513_CR61","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/0377-2217(93)90221-8","volume":"66","author":"J-Y Potvin","year":"1993","unstructured":"Potvin J-Y, Rousseau J-M (1993) A parallel route building algorithm for the vehicle routing and scheduling problem with time windows. Eur J Oper Res 66(3):331\u2013340","journal-title":"Eur J Oper Res"},{"issue":"2","key":"513_CR62","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1002\/1520-6750(199203)39:2<137::AID-NAV3220390202>3.0.CO;2-D","volume":"39","author":"MA Trick","year":"1992","unstructured":"Trick MA (1992) A linear relaxation heuristic for the generalized assignment problem. Nav Res Logist (NRL) 39(2):137\u2013151","journal-title":"Nav Res Logist (NRL)"},{"key":"513_CR63","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1016\/j.asoc.2016.01.006","volume":"43","author":"H Samma","year":"2016","unstructured":"Samma H, Lim CP, Saleh JM (2016) A new reinforcement learning-based memetic particle swarm optimizer. Appl Soft Comput 43:276\u2013297","journal-title":"Appl Soft Comput"},{"key":"513_CR64","unstructured":"Christofides N (1979) The vehicle routing problem. Combinatorial optimization"},{"issue":"1","key":"513_CR65","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF02430370","volume":"1","author":"Y Rochat","year":"1995","unstructured":"Rochat Y, Taillard \u00c9D (1995) Probabilistic diversification and intensification in local search for vehicle routing. J Heuristics 1(1):147\u2013167","journal-title":"J Heuristics"},{"key":"513_CR66","unstructured":"Golden B, Wasil E, Kelly J, Chao I (1998) Metaheuristics in vehicle routing. In: Craignic, t. & laporte, g.(eds.) fleet management and logistics"},{"issue":"5","key":"513_CR67","doi-asserted-by":"publisher","first-page":"1165","DOI":"10.1016\/j.cor.2003.10.002","volume":"32","author":"F Li","year":"2005","unstructured":"Li F, Golden B, Wasil E (2005) Very large-scale vehicle routing: new test problems, algorithms, and results. Comput Oper Res 32(5):1165\u20131179","journal-title":"Comput Oper Res"},{"issue":"4","key":"513_CR68","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1109\/TSMCA.2012.2226024","volume":"43","author":"P Rakshit","year":"2013","unstructured":"Rakshit P, Konar A, Bhowmik P, Goswami I, Das S, Jain LC, Nagar AK (2013) Realization of an adaptive memetic algorithm using differential evolution and q-learning: a case study in multirobot path planning. IEEE Trans Syst Man Cybern Syst 43(4):814\u2013831","journal-title":"IEEE Trans Syst Man Cybern Syst"}],"container-title":["Operations Research Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-025-00513-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43069-025-00513-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-025-00513-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T16:08:05Z","timestamp":1765382885000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43069-025-00513-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,30]]},"references-count":68,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2025,9]]}},"alternative-id":["513"],"URL":"https:\/\/doi.org\/10.1007\/s43069-025-00513-1","relation":{},"ISSN":["2662-2556"],"issn-type":[{"value":"2662-2556","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7,30]]},"assertion":[{"value":"6 January 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 July 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 July 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}},{"value":"Not applicable","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to Participate"}},{"value":"Not applicable","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for Publication"}},{"value":"The authors declare no competing interests.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}],"article-number":"105"}}