{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,2]],"date-time":"2025-10-02T01:04:01Z","timestamp":1759367041840,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783032001368"},{"type":"electronic","value":"9783032001375"}],"license":[{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"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":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-00137-5_7","type":"book-chapter","created":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T23:46:21Z","timestamp":1759275981000},"page":"95-110","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Performance Benchmarking of\u00a0OR-Tools Methods for\u00a0Capacitated Vehicle Routing Problems with\u00a0Time Windows"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4995-4799","authenticated-orcid":false,"given":"In\u00eas","family":"Sena","sequence":"first","affiliation":[]},{"given":"Tiago B.","family":"Ribeiro","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6795-2335","authenticated-orcid":false,"given":"Adriano Santos","family":"Silva","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9542-4460","authenticated-orcid":false,"given":"Florbela P.","family":"Fernandes","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4772-4404","authenticated-orcid":false,"given":"Lino A.","family":"Costa","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3803-2043","authenticated-orcid":false,"given":"Ana I.","family":"Pereira","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,1]]},"reference":[{"key":"7_CR1","unstructured":"Bujel, K., Lai, F., Szczecinski, M., So, W., Fernandez, M.: Solving high volume capacitated vehicle routing problem with time windows using recursive-dbscan clustering algorithm. arXiv preprint arXiv:1812.02300 (2018)"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"2227","DOI":"10.1016\/j.procs.2015.05.501","volume":"51","author":"PJ Cardoso","year":"2015","unstructured":"Cardoso, P.J., Sch\u00fctz, G., Mazayev, A., Ey, E., Corr\u00eaa, T.: A solution for a real-time stochastic capacitated vehicle routing problem with time windows. Procedia Comput. Sci. 51, 2227\u20132236 (2015)","journal-title":"Procedia Comput. Sci."},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.trd.2017.04.016","volume":"54","author":"M \u00c7imen","year":"2017","unstructured":"\u00c7imen, M., Soysal, M.: Time-dependent green vehicle routing problem with stochastic vehicle speeds: an approximate dynamic programming algorithm. Transp. Res. Part D: Transp. Environ. 54, 82\u201398 (2017)","journal-title":"Transp. Res. Part D: Transp. Environ."},{"key":"7_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.dajour.2022.100113","volume":"4","author":"U Dereci","year":"2022","unstructured":"Dereci, U., Karabekmez, M.E.: The applications of multiple route optimization heuristics and meta-heuristic algorithms to solid waste transportation: A case study in turkey. Decision Anal. J. 4, 100113 (2022)","journal-title":"Decision Anal. J."},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"1155356","DOI":"10.3389\/fams.2023.1155356","volume":"9","author":"J Dornemann","year":"2023","unstructured":"Dornemann, J.: Solving the capacitated vehicle routing problem with time windows via graph convolutional network assisted tree search and quantum-inspired computing. Front. Appl. Mathe. Stat. 9, 1155356 (2023)","journal-title":"Front. Appl. Mathe. Stat."},{"key":"7_CR6","unstructured":"Gehring, H., Homberger, J.: A parallel hybrid evolutionary metaheuristic for the vehicle routing problem with time windows. In: Proceedings of EUROGEN99, vol.\u00a02, pp. 57\u201364. Citeseer (1999)"},{"issue":"3","key":"7_CR7","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover, F.: Tabu search-part i. ORSA J. Comput. 1(3), 190\u2013206 (1989)","journal-title":"ORSA J. Comput."},{"issue":"1","key":"7_CR8","first-page":"35","volume":"9","author":"OM Gonz\u00e1lez","year":"2018","unstructured":"Gonz\u00e1lez, O.M., Segura, C., Pe\u00f1a, S.I.V.: A parallel memetic algorithm to solve the capacitated vehicle routing problem with time windows. Int. J. Combinatorial Optimization Problems Inform. 9(1), 35 (2018)","journal-title":"Int. J. Combinatorial Optimization Problems Inform."},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Hashi, E.K., Hasan, M.R., Zaman, M.S.U.: Gis based heuristic solution of the vehicle routing problem to optimize the school bus routing and scheduling. In: 2016 19th International Conference on Computer and Information Technology (ICCIT), pp. 56\u201360. IEEE (2016)","DOI":"10.1109\/ICCITECHN.2016.7860167"},{"key":"7_CR10","unstructured":"Laarhoven, P.J.M.v., Aarts, E.H.L.: Simulated Annealing: Theory and Applications. D. Reidel; Sold and distributed in the U.S.A. and Canada by Kluwer Academic Publishers (1987)"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Lecron, F., Manneback, P., Tuyttens, D.: Exploiting grid computation for solving the vehicle routing problem. In: ACS\/IEEE International Conference on Computer Systems and Applications-AICCSA 2010, pp.\u00a01\u20136. IEEE (2010)","DOI":"10.1109\/AICCSA.2010.5587020"},{"key":"7_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2022.102875","volume":"166","author":"MA Masmoudi","year":"2022","unstructured":"Masmoudi, M.A., Coelho, L.C., Demir, E.: Plug-in hybrid electric refuse vehicle routing problem for waste collection. Transp. Res. Part E: Logist. Transp. Rev. 166, 102875 (2022)","journal-title":"Transp. Res. Part E: Logist. Transp. Rev."},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1016\/j.jocs.2017.04.012","volume":"21","author":"MA Mohammed","year":"2017","unstructured":"Mohammed, M.A., et al.: Solving vehicle routing problem by using improved k-nearest neighbor algorithm for best solution. J. Comput. Sci. 21, 232\u2013240 (2017)","journal-title":"J. Comput. Sci."},{"issue":"3","key":"7_CR14","doi-asserted-by":"publisher","first-page":"2099","DOI":"10.1109\/TASE.2022.3194082","volume":"20","author":"K Nishida","year":"2022","unstructured":"Nishida, K., Nishi, T.: Dynamic optimization of conflict-free routing of automated guided vehicles for just-in-time delivery. IEEE Trans. Autom. Sci. Eng. 20(3), 2099\u20132114 (2022)","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Perron, L.: Operations research and constraint programming at google. In: Principles and Practice of Constraint Programming\u2013CP 2011: 17th International Conference, CP 2011, Perugia, Italy, September 12-16, 2011. Proceedings 17, pp.\u00a02\u20132. Springer (2011)","DOI":"10.1007\/978-3-642-23786-7_2"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Silva, A.S., Lima, J., Silva, A.M., Gomes, H.T., Pereira, A.I.: Time-dependency of guided local search to solve the capacitated vehicle routing problem with time windows. In: International Conference on Optimization, Learning Algorithms and Applications, pp. 93\u2013108. Springer (2023)","DOI":"10.1007\/978-3-031-53025-8_7"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Silva, A., et al.: Solving a capacitated waste collection problem using an open-source tool. In: International Conference on Computational Science and Its Applications, pp. 140\u2013156. Springer (2022)","DOI":"10.1007\/978-3-031-10562-3_11"},{"key":"7_CR18","doi-asserted-by":"publisher","first-page":"670","DOI":"10.1016\/j.neucom.2020.02.126","volume":"423","author":"P Sitek","year":"2021","unstructured":"Sitek, P., Wikarek, J., Rutczy\u0144ska-Wdowiak, K., Bocewicz, G., Banaszak, Z.: Optimization of capacitated vehicle routing problem with alternative delivery, pick-up and time windows: A modified hybrid approach. Neurocomputing 423, 670\u2013678 (2021)","journal-title":"Neurocomputing"},{"issue":"2","key":"7_CR19","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."},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Tanel, A., et al.: Capacitated vehicle routing problem with time windows. In: Digitizing Production Systems: Selected Papers from ISPR2021, October 07-09, 2021 Online, Turkey, pp. 653\u2013664. Springer (2022)","DOI":"10.1007\/978-3-030-90421-0_56"},{"key":"7_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2024.111755","volume":"162","author":"H Tunga","year":"2024","unstructured":"Tunga, H., Kar, S., Giri, D.: Multi-objective brainstorm optimization algorithm based on bayesian inference learning automaton for solving cvrp with time windows. Appl. Soft Comput. 162, 111755 (2024)","journal-title":"Appl. Soft Comput."},{"key":"7_CR22","unstructured":"Voudouris, C.: Guided local search for combinatorial optimisation problems. Ph.D. thesis, Department of Computer Science, University of Essex, Colchester, UK, July 1997"}],"container-title":["Communications in Computer and Information Science","Optimization, Learning Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-00137-5_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T23:46:25Z","timestamp":1759275985000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-00137-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,1]]},"ISBN":["9783032001368","9783032001375"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-00137-5_7","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2025,10,1]]},"assertion":[{"value":"1 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"OL2A","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Optimization, Learning Algorithms and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sesti Levante","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 April 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 April 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ol2a2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ol2a.ipb.pt","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}