{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T15:20:27Z","timestamp":1768749627784,"version":"3.49.0"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2023,3,13]],"date-time":"2023-03-13T00:00:00Z","timestamp":1678665600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,13]],"date-time":"2023-03-13T00:00:00Z","timestamp":1678665600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100022823","name":"CEFET-MG","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100022823","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004901","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de Minas Gerais","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004901","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100009730","name":"Universidade Federal de Ouro Preto","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100009730","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s11590-023-01990-1","type":"journal-article","created":{"date-parts":[[2023,3,26]],"date-time":"2023-03-26T22:16:12Z","timestamp":1679868972000},"page":"2033-2063","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["A general VNS for the multi-depot open vehicle routing problem with time windows"],"prefix":"10.1007","volume":"17","author":[{"given":"Sinaide Nunes","family":"Bezerra","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7831-6740","authenticated-orcid":false,"given":"S\u00e9rgio Ricardo","family":"de Souza","sequence":"additional","affiliation":[]},{"given":"Marcone Jamilson Freitas","family":"Souza","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,3,13]]},"reference":[{"key":"1990_CR1","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s11590-020-01594-z","volume":"15","author":"E Lalla-Ruiz","year":"2021","unstructured":"Lalla-Ruiz, E., Mes, M.: Mathematical formulations and improvements for the multi-depot open vehicle routing problem. Optim. Lett. 15, 271\u2013286 (2021)","journal-title":"Optim. Lett."},{"issue":"9","key":"1990_CR2","doi-asserted-by":"publisher","first-page":"2025","DOI":"10.3390\/ijerph15092025","volume":"15","author":"L Shen","year":"2018","unstructured":"Shen, L., Tao, F., Wang, S.: Multi-depot open vehicle routing problem with time windows based on carbon trading. Int. J. Environ. Res. Public Health 15(9), 2025 (2018)","journal-title":"Int. J. Environ. Res. Public Health"},{"issue":"2","key":"1990_CR3","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1016\/j.ejor.2020.01.008","volume":"284","author":"J Brand\u00e3o","year":"2020","unstructured":"Brand\u00e3o, J.: A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem. Eur. J. Oper. Res. 284(2), 559\u2013571 (2020)","journal-title":"Eur. J. Oper. Res."},{"key":"1990_CR4","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1057\/palgrave.jors.2602143","volume":"58","author":"P Repoussis","year":"2007","unstructured":"Repoussis, P., Tarantilis, C., Ioannou, G.: The open vehicle routing problem with time windows. J. Oper. Res. Soc. 58, 355\u2013367 (2007)","journal-title":"J. Oper. Res. Soc."},{"key":"1990_CR5","doi-asserted-by":"publisher","first-page":"928","DOI":"10.1057\/palgrave.jors.2601163","volume":"52","author":"JF Cordeau","year":"2001","unstructured":"Cordeau, J.F., Laporte, G., Mercier, A.: A unified tabu search heuristic for vehicle routing problems with time windows. J. Oper. Res. Soc. 52, 928\u2013936 (2001)","journal-title":"J. Oper. Res. Soc."},{"key":"1990_CR6","doi-asserted-by":"publisher","unstructured":"Rego, M.F., Souza, M.J.F.: Smart general variable neighborhood search with local search based on mathematical programming for solving the unrelated parallel machine scheduling problem. In: Proceedings of the 21st International Conference on Enterprise Information Systems (ICEIS 2019), vol. 2, pp. 287\u2013295. SciTePress, Heraklion, Greece (2019). https:\/\/doi.org\/10.5220\/0007703302870295. INSTICC","DOI":"10.5220\/0007703302870295"},{"issue":"3","key":"1990_CR7","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s13675-016-0075-x","volume":"5","author":"P Hansen","year":"2017","unstructured":"Hansen, P., Mladenovi\u0107, N., Todosijevi\u0107, R., Hanafi, S.: Variable neighborhood search: basics and variants. EURO J. Comput. Optim. 5(3), 423\u2013454 (2017)","journal-title":"EURO J. Comput. Optim."},{"issue":"11","key":"1990_CR8","doi-asserted-by":"publisher","first-page":"1899","DOI":"10.1016\/j.cor.2009.10.011","volume":"37","author":"A Subramanian","year":"2010","unstructured":"Subramanian, A., Drummond, L.M.A., Bentes, C., Ochi, L.S., Farias, R.: A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery. Comput. Oper. Res. 37(11), 1899\u20131911 (2010). (Metaheuristics for Logistics and Vehicle Routing)","journal-title":"Comput. Oper. Res."},{"key":"1990_CR9","unstructured":"Subramanian, A.: Heuristic, exact and hybrid approaches for vehicle routing problems. PhD thesis, Universidade Federal Fluminense, Niter\u00f3i, Brazil (2012). Available at http:\/\/www.ic.uff.br\/PosGraduacao\/frontend-tesesdissertacoes\/download.php?id=532.pdf &tipo=trabalho"},{"issue":"1","key":"1990_CR10","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1111\/itor.12671","volume":"27","author":"JC de Freitas","year":"2020","unstructured":"de Freitas, J.C., Penna, P.H.V.: A variable neighborhood search for flying sidekick traveling salesman problem. Int. Trans. Oper. Res. 27(1), 267\u2013290 (2020)","journal-title":"Int. Trans. Oper. Res."},{"issue":"2","key":"1990_CR11","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/j.ejor.2015.09.047","volume":"250","author":"VN Coelho","year":"2016","unstructured":"Coelho, V.N., Grasas, A., Ramalhinho, H., Coelho, I.M., Souza, M.J.F., Cruz, R.C.: An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints. Eur. J. Oper. Res. 250(2), 367\u2013376 (2016)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"1990_CR12","first-page":"5","volume":"275","author":"PHV Penna","year":"2013","unstructured":"Penna, P.H.V., Subramanian, A., Ochi, L.S., Vidal, T., Prins, C.: A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet. Ann. Oper. Res. 275(1), 5\u201374 (2013)","journal-title":"Ann. Oper. Res."},{"key":"1990_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.106016","volume":"149","author":"SN Bezerra","year":"2023","unstructured":"Bezerra, S.N., Souza, M.J.F., de Souza, S.R.: A variable neighborhood search-based algorithm with adaptive local search for the vehicle routing problem with time windows and multi-depots aiming for vehicle fleet reduction. Comput. Oper. Res. 149, 106016 (2023). https:\/\/doi.org\/10.1016\/j.cor.2022.106016","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"1990_CR14","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1002\/net.3230110212","volume":"11","author":"L Schrage","year":"1981","unstructured":"Schrage, L.: Formulation and structure of more complex\/realistic routing and scheduling problems. Networks 11(2), 229\u2013232 (1981)","journal-title":"Networks"},{"key":"1990_CR15","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1016\/S0377-2217(03)00238-8","volume":"157","author":"J Brand\u00e3o","year":"2004","unstructured":"Brand\u00e3o, J.: A tabu search algorithm for the open vehicle routing problem. Eur. J. Oper. Res. 157, 552\u2013564 (2004)","journal-title":"Eur. J. Oper. Res."},{"key":"1990_CR16","doi-asserted-by":"publisher","first-page":"955","DOI":"10.1007\/s00521-016-2608-x","volume":"29","author":"AAR Hosseinabadi","year":"2018","unstructured":"Hosseinabadi, A.A.R., Vahidi, J., Balas, V., Mirkamali, S.: OVRP_GELS: solving open vehicle routing problem using the gravitational emulation local search algorithm. Neural Comput. Appl. 29, 955\u2013968 (2018)","journal-title":"Neural Comput. Appl."},{"key":"1990_CR17","doi-asserted-by":"crossref","unstructured":"Redi, A.A.N.P., Maghfiroh, M.F.N., Yu, V.F.: An improved variable neighborhood search for the open vehicle routing problem with time windows. In: 2013 IEEE International Conference on Industrial Engineering and Engineering Management, Bangkok, Thailand, pp. 1641\u20131645 (2013)","DOI":"10.1109\/IEEM.2013.6962688"},{"issue":"5","key":"1990_CR18","doi-asserted-by":"publisher","first-page":"1467","DOI":"10.1051\/ro\/2019080","volume":"54","author":"B Chen","year":"2019","unstructured":"Chen, B., Qu, R., Bai, R., Laesanklang, W.: A variable neighborhood search algorithm with reinforcement learning for a real-life periodic vehicle routing problem with time windows and open routes. RAIRO Oper. Res. 54(5), 1467\u20131494 (2019)","journal-title":"RAIRO Oper. Res."},{"key":"1990_CR19","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/j.cie.2017.03.022","volume":"107","author":"M Soto","year":"2017","unstructured":"Soto, M., Sevaux, M., Rossi, A., Reinholz, A.: Multiple neighborhood search, tabu search and ejection chains for the multi-depot open vehicle routing problem. Comput. Ind. Eng. 107, 211\u2013222 (2017). https:\/\/doi.org\/10.1016\/j.cie.2017.03.022","journal-title":"Comput. Ind. Eng."},{"issue":"22","key":"1990_CR20","doi-asserted-by":"publisher","first-page":"6963","DOI":"10.1080\/00207543.2019.1572929","volume":"57","author":"R Lahyani","year":"2019","unstructured":"Lahyani, R., Gouguenheim, A.-L., Coelho, L.C.: A hybrid adaptive large neighbourhood search for multi-depot open vehicle routing problems. Int. J. Prod. Res. 57(22), 6963\u20136976 (2019). https:\/\/doi.org\/10.1080\/00207543.2019.1572929","journal-title":"Int. J. Prod. Res."},{"issue":"2","key":"1990_CR21","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/s10878-014-9767-4","volume":"31","author":"J Li","year":"2016","unstructured":"Li, J., Li, Y., Pardalos, P.M.: Multi-depot vehicle routing problem with time windows under shared depot resources. J. Comb. Optim. 31(2), 515\u2013532 (2016). https:\/\/doi.org\/10.1007\/s10878-014-9767-4","journal-title":"J. Comb. Optim."},{"issue":"2","key":"1990_CR22","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2), 254\u2013265 (1987)","journal-title":"Oper. Res."},{"issue":"1","key":"1990_CR23","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/S0260-8774(01)00040-1","volume":"51","author":"CD Tarantilis","year":"2002","unstructured":"Tarantilis, C.D., Kiranoudis, C.T.: Distribution of fresh meat. J. Food Eng. 51(1), 85\u201391 (2002). https:\/\/doi.org\/10.1016\/S0260-8774(01)00040-1","journal-title":"J. Food Eng."},{"issue":"1","key":"1990_CR24","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1111\/itor.12513","volume":"27","author":"N Smiti","year":"2018","unstructured":"Smiti, N., Dhiaf, M., Jarboui, B., Hanafi, S.: Skewed general variable neighborhood search for the cumulative capacitated vehicle routing problem. Int. Trans. Oper. Res. 27(1), 651\u2013664 (2018). https:\/\/doi.org\/10.1111\/itor.12513","journal-title":"Int. Trans. Oper. Res."},{"key":"1990_CR25","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.endm.2018.03.022","volume":"66","author":"SN Bezerra","year":"2018","unstructured":"Bezerra, S.N., de Souza, S.R., Souza, M.J.F.: A GVNS algorithm for solving the multi-depot vehicle routing problem. Electron. Notes Discrete Math. 66, 167\u2013174 (2018). (Proceedings of the 5th International Conference on Variable Neighborhood Search)","journal-title":"Electron. Notes Discrete Math."},{"key":"1990_CR26","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s10479-017-2576-2","volume":"272","author":"H Derbel","year":"2019","unstructured":"Derbel, H., Jarboui, B., Bhiri, R.: A skewed general variable neighborhood search algorithm with fixed threshold for the heterogeneous fleet vehicle routing problem. Ann. Oper. Res. 272, 243\u2013272 (2019). https:\/\/doi.org\/10.1007\/s10479-017-2576-2","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"1990_CR27","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s10732-017-9363-8","volume":"26","author":"J S\u00e1nchez-Oro","year":"2020","unstructured":"S\u00e1nchez-Oro, J., L\u00f3pez-S\u00e1nchez, A.D., Colmenar, J.M.: A general variable neighborhood search for solving the multi-objective open vehicle routing problem. J. Heuristics 26(3), 423\u2013452 (2020). https:\/\/doi.org\/10.1007\/s10732-017-9363-8","journal-title":"J. Heuristics"},{"key":"1990_CR28","doi-asserted-by":"publisher","DOI":"10.1016\/j.jclepro.2020.124155","volume":"275","author":"X Ren","year":"2020","unstructured":"Ren, X., Huang, H., Feng, S., Liang, G.: An improved variable neighborhood search for bi-objective mixed-energy fleet vehicle routing problem. J. Clean. Prod. 275, 124155 (2020). https:\/\/doi.org\/10.1016\/j.jclepro.2020.124155","journal-title":"J. Clean. Prod."},{"key":"1990_CR29","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113444","volume":"153","author":"P Karakostas","year":"2020","unstructured":"Karakostas, P., Sifaleras, A., Georgiadis, M.C.: Adaptive variable neighborhood search solution methods for the fleet size and mix pollution location-inventory-routing problem. Expert Syst. Appl. 153, 113444 (2020). https:\/\/doi.org\/10.1016\/j.eswa.2020.113444","journal-title":"Expert Syst. Appl."},{"key":"1990_CR30","doi-asserted-by":"crossref","unstructured":"Barrero, L., Robledo, F., Romero, P., Viera, R.: A GRASP\/VND heuristic for the heterogeneous fleet vehicle routing problem with time windows. In: Mladenovic, N., Sleptchenko, A., Sifaleras, A., Omar, M. (eds.) Proceedings of the 8th International Conference on Variable Neighborhood Search (ICVNS 2021). Lecture Notes in Computer Science, vol. 12559, pp. 152\u2013165. Springer, Cham (2021)","DOI":"10.1007\/978-3-030-69625-2_12"},{"key":"1990_CR31","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.108746","volume":"121","author":"P Karakostas","year":"2022","unstructured":"Karakostas, P., Sifaleras, A.: A double-adaptive general variable neighborhood search algorithm for the solution of the traveling salesman problem. Appl. Soft Comput. 121, 108746 (2022). https:\/\/doi.org\/10.1016\/j.asoc.2022.108746","journal-title":"Appl. Soft Comput."},{"issue":"1","key":"1990_CR32","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10479-009-0657-6","volume":"175","author":"P Hansen","year":"2010","unstructured":"Hansen, P., Mladenovi\u0107, N., Moreno P\u00e9rez, J.A.: Variable neighbourhood search: methods and applications. Ann. Oper. Res. 175(1), 367\u2013407 (2010)","journal-title":"Ann. Oper. Res."},{"key":"1990_CR33","unstructured":"Reinsma, J.A., Penna, P.H.V., Souza, M.J.F.: A simple and efficient algorithm for solving the generalized traveling salesman problem (in Portuguese). In: Proceedings of the L Brazilian Symposium of Operations Research. Galo\u00e1, Rio de Janeiro, Brazil, SOBRAPO (2018). Available at https:\/\/proceedings.science\/proceedings\/100015\/_papers\/85522\/download\/fulltext_file1"},{"issue":"2","key":"1990_CR34","doi-asserted-by":"publisher","first-page":"1041","DOI":"10.1016\/j.ejor.2010.05.031","volume":"207","author":"MJF Souza","year":"2010","unstructured":"Souza, M.J.F., Coelho, I.M., Ribas, S., Santos, H.G., Merschmann, L.H.C.: A hybrid heuristic algorithm for the open-pit-mining operational planning problem. Eur. J. Oper. Res. 207(2), 1041\u20131051 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"1990_CR35","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s10489-006-6926-z","volume":"24","author":"B Ombuki","year":"2006","unstructured":"Ombuki, B., Ross, B.J., Hanshar, F.: Multi-objective genetic algorithms for vehicle routing problem with time windows. Appl. Intell. 24(1), 17\u201330 (2006)","journal-title":"Appl. Intell."},{"issue":"2","key":"1990_CR36","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/BF03343534","volume":"1","author":"M Polacek","year":"2008","unstructured":"Polacek, M., Benkner, S., Doerner, K.F., Hartl, R.F.: A cooperative and adaptive variable neighborhood search for the multi depot vehicle routing problem with time windows. Bus. Res. 1(2), 207\u2013218 (2008). https:\/\/doi.org\/10.1007\/BF03343534","journal-title":"Bus. Res."},{"issue":"1","key":"1990_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2013.02.053","volume":"231","author":"T Vidal","year":"2013","unstructured":"Vidal, T., Crainic, T.G., Gendreau, M., Prins, C.: Heuristics for multi-attribute vehicle routing problems: a survey and synthesis. Eur. J. Oper. Res. 231(1), 1\u201321 (2013)","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"1990_CR38","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1016\/0305-0483(76)90097-9","volume":"4","author":"BE Gillett","year":"1976","unstructured":"Gillett, B.E., Johnson, J.G.: Multi-terminal vehicle-dispatch algorithm. Omega 4(6), 711\u2013718 (1976)","journal-title":"Omega"},{"issue":"6","key":"1990_CR39","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/s10732-005-5432-5","volume":"10","author":"M Polacek","year":"2004","unstructured":"Polacek, M., Hartl, R.F., Doerner, K., Reimann, M.: A variable neighborhood search for the multi depot vehicle routing problem with time windows. J. Heuristics 10(6), 613\u2013627 (2004). https:\/\/doi.org\/10.1007\/s10732-005-5432-5","journal-title":"J. Heuristics"},{"issue":"8","key":"1990_CR40","doi-asserted-by":"publisher","first-page":"2403","DOI":"10.1016\/j.cor.2005.09.012","volume":"34","author":"D Pisinger","year":"2007","unstructured":"Pisinger, D., Ropke, S.: A general heuristic for vehicle routing problems. Comput. Oper. Res. 34(8), 2403\u20132435 (2007)","journal-title":"Comput. Oper. Res."},{"key":"1990_CR41","doi-asserted-by":"crossref","unstructured":"Subramanian, A., Penna, P.H.V., Ochi, L.S., Souza, M.J.F.: Um algoritmo heur\u00edstico baseado em Iterated Local Search para problemas de roteamento de ve\u00edculos. In: Lopes, H.S., de Abreu Rodrigues, L.C., Steiner, M.T.A. (eds.) Meta-Heur\u00edsticas em Pesquisa Operacional, 1st edn., pp. 165\u2013180. Omnipax, Curitiba, PR (2013). Chap. 11. Available at http:\/\/www.decom.ufop.br\/prof\/marcone\/projects\/ppm497-13\/MetaheuristicasPesquisaOperacional-Cap11.pdf","DOI":"10.7436\/2013.mhpo.11"},{"issue":"3","key":"1990_CR42","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1287\/opre.1120.1048","volume":"60","author":"T Vidal","year":"2012","unstructured":"Vidal, T., Crainic, T.G., Gendreau, M., Lahrichi, N., Rei, W.: A hybrid genetic algorithm for multidepot and periodic vehicle routing problems. Oper. Res. 60(3), 611\u2013624 (2012)","journal-title":"Oper. Res."},{"issue":"1","key":"1990_CR43","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.ejor.2013.12.044","volume":"237","author":"T Vidal","year":"2014","unstructured":"Vidal, T., Crainic, T.G., Gendreau, M., Prins, C.: Implicit depot assignments and rotations in vehicle routing heuristics. Eur. J. Oper. Res. 237(1), 15\u201328 (2014). https:\/\/doi.org\/10.1016\/j.ejor.2013.12.044","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"1990_CR44","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1287\/trsc.2019.0914","volume":"54","author":"J Christiaens","year":"2020","unstructured":"Christiaens, J., Vanden Berghe, G.: Slack induction by string removals for vehicle routing problems. Transp. Sci. 54(2), 417\u2013433 (2020). https:\/\/doi.org\/10.1287\/trsc.2019.0914","journal-title":"Transp. Sci."},{"key":"1990_CR45","series-title":"Discrete Mathematics and Applications","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1137\/1.9780898718515.ch7","volume-title":"The Vehicle Routing Problem","author":"JF Cordeau","year":"2002","unstructured":"Cordeau, J.F., Desaulniers, G., Desrosiers, J., Solomon, M.M., Soumis, F.: Vrp with time windows. Chap. 7. In: Toth, P., Vigo, D. (eds.) The Vehicle Routing Problem. Discrete Mathematics and Applications, pp. 157\u2013193. Society for Industrial and Applied Mathematics, Philadelphia (2002)"},{"key":"1990_CR46","first-page":"43","volume":"3","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Dubois-Lacoste, J., C\u00e1ceres, L.P., Birattari, M., St\u00fctzle, T.: The IRACE package: iterated racing for automatic algorithm configuration. Oper. Res. Perspect. 3, 43\u201358 (2016)","journal-title":"Oper. Res. Perspect."},{"key":"1990_CR47","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-07124-4_16","volume-title":"Handbook of Heuristics","author":"M Sevaux","year":"2018","unstructured":"Sevaux, M., S\u00f6rensen, K., Pillay, N.: Adaptive and multilevel metaheuristics. In: Mart\u00ed, R., Pardalos, P.M., Resende, M.G.C. (eds.) Handbook of Heuristics, pp. 3\u201321. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-07124-4_16"},{"issue":"6","key":"1990_CR48","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3459664","volume":"54","author":"E Talbi","year":"2021","unstructured":"Talbi, E.: Machine learning into metaheuristics: a survey and taxonomy. ACM Comput. Surv. (CSUR) 54(6), 1\u201332 (2021). https:\/\/doi.org\/10.1145\/3459664","journal-title":"ACM Comput. Surv. (CSUR)"},{"issue":"2","key":"1990_CR49","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, 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(2), 393\u2013422 (2022)","journal-title":"Eur. J. Oper. Res."},{"key":"1990_CR50","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.eswa.2019.04.056","volume":"131","author":"MAL Silva","year":"2019","unstructured":"Silva, M.A.L., de Souza, S.R., Souza, M.J.F., Bazzan, A.L.C.: A reinforcement learning-based multi-agent framework applied for solving routing and scheduling problems. Expert Syst. Appl. 131, 148\u2013171 (2019)","journal-title":"Expert Syst. Appl."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-023-01990-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-023-01990-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-023-01990-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,30]],"date-time":"2023-10-30T11:04:50Z","timestamp":1698663890000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-023-01990-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,13]]},"references-count":50,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["1990"],"URL":"https:\/\/doi.org\/10.1007\/s11590-023-01990-1","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,13]]},"assertion":[{"value":"27 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 February 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 March 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}