{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T11:16:50Z","timestamp":1768562210153,"version":"3.49.0"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031530241","type":"print"},{"value":"9783031530258","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"vor","delay-in-days":31,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Research have been driven by the increased demand for delivery and pick-up services to develop new formulations and algorithms for solving Vehicle Routing Problems (VRP). The main objective is to create algorithms that can identify paths considering execution time in real-world scenarios. This study focused on using the Guided Local Search (GLS) metaheuristic available in OR-Tools to solve the Capacitated Vehicle Routing Problem with Time Windows using the Solomons instances. The execution time was used as a stop criterion, with short runs ranging from 1 to 10\u00a0s and a long run of 360\u00a0s for comparison. The results showed that the GLS metaheuristic from OR-Tools is applicable for achieving high performance in finding the shortest path and optimizing routes within constrained execution times. It outperformed the best-known solutions from the literature in longer execution times and even provided a close-to-optimal solution within 10\u00a0s. These findings suggest the potential application of this tool for dynamic VRP scenarios that require faster algorithms.<\/jats:p>","DOI":"10.1007\/978-3-031-53025-8_7","type":"book-chapter","created":{"date-parts":[[2024,1,31]],"date-time":"2024-01-31T20:02:12Z","timestamp":1706731332000},"page":"93-108","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Time-Dependency of\u00a0Guided Local Search to\u00a0Solve the\u00a0Capacitated Vehicle Routing Problem with\u00a0Time Windows"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6795-2335","authenticated-orcid":false,"given":"Adriano S.","family":"Silva","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7902-1207","authenticated-orcid":false,"given":"Jos\u00e9","family":"Lima","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8551-6353","authenticated-orcid":false,"given":"Adri\u00e1n M. T.","family":"Silva","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6898-2408","authenticated-orcid":false,"given":"Helder T.","family":"Gomes","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":[[2024,2,1]]},"reference":[{"key":"7_CR1","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"},{"key":"7_CR2","first-page":"670","volume":"64","author":"V Praveen","year":"2022","unstructured":"Praveen, V., Keerthika, P., Sivapriya, G., Sarankumar, A., Bhasker, B.: Vehicle routing optimization problem: a study on capacitated vehicle routing problem. Mater. Today: Proc. 64, 670\u2013674 (2022)","journal-title":"Mater. Today: Proc."},{"key":"7_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.jclepro.2023.136775","volume":"401","author":"G Leite","year":"2023","unstructured":"Leite, G., Marcelino, C., Pedreira, C., Jim\u00e9nez-Fern\u00e1ndez, S., Salcedo-Sanz, S.: Evaluating the risk of uncertainty in smart grids with electric vehicles using an evolutionary swarm-intelligent algorithm. J. Clean. Prod. 401, 136775 (2023)","journal-title":"J. Clean. Prod."},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Mendes, R.S., Wanner, E.F., Martins, F.V., Deb, K.: Aggregation or selection? clustering many objectives for vehicle routing problem with demand responsive transport. In: 2021 IEEE Congress on Evolutionary Computation (CEC), pp. 1257\u20131264. IEEE (2021)","DOI":"10.1109\/CEC45853.2021.9504919"},{"issue":"3","key":"7_CR5","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0377-2217(92)90192-C","volume":"59","author":"G Laporte","year":"1992","unstructured":"Laporte, G.: The vehicle routing problem: an overview of exact and approximate algorithms. Eur. J. Oper. Res. 59(3), 345\u2013358 (1992)","journal-title":"Eur. J. Oper. Res."},{"key":"7_CR6","doi-asserted-by":"publisher","unstructured":"Tanel, A., et al.: Capacitated vehicle routing problem with time windows. In: Durakbasa, N.M., Gen\u00e7y\u0131lmaz, M.G. (eds.) Digitizing Production Systems: Selected Papers from ISPR2021, 07\u201309 October 2021, pp. 653\u2013664. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-90421-0_56","DOI":"10.1007\/978-3-030-90421-0_56"},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.cor.2019.04.018","volume":"109","author":"J Andelmin","year":"2019","unstructured":"Andelmin, J., Bartolini, E.: A multi-start local search heuristic for the green vehicle routing problem based on a multigraph reformulation. Comput. Oper. Res. 109, 43\u201363 (2019)","journal-title":"Comput. Oper. Res."},{"key":"7_CR8","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."},{"issue":"2","key":"7_CR9","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1177\/03611981221124592","volume":"2677","author":"T Cokyasar","year":"2023","unstructured":"Cokyasar, T., Subramanyam, A., Larson, J., Stinson, M., Sahin, O.: Time-constrained capacitated vehicle routing problem in urban e-commerce delivery. Transp. Res. Rec. 2677(2), 190\u2013203 (2023)","journal-title":"Transp. Res. Rec."},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"UCT in capacitated vehicle routing problem with traffic jams. Inf. Sci. 406\u2013407, 42\u201356 (2017)","DOI":"10.1016\/j.ins.2017.04.020"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Real-time collaborative feeder vehicle routing problem with flexible time windows. Swarm Evolution. Comput. 75, 101201 (2022)","DOI":"10.1016\/j.swevo.2022.101201"},{"key":"7_CR12","doi-asserted-by":"publisher","unstructured":"Silva, A.S., Lima, J., Pereira, A.I., Silva, A.M.T., Gomes, H.T.: Execution time experiments to solve capacitated vehicle routing problem. In: Gervasi, O., et al. (eds.) ICCSA 2023. LNCS, vol. 14111, pp. 273\u2013289. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-37126-4_19","DOI":"10.1007\/978-3-031-37126-4_19"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Silva, A.S., et al.: Capacitated waste collection problem solution using an open-source tool. Computers 12(1) (2023)","DOI":"10.3390\/computers12010015"},{"key":"7_CR14","doi-asserted-by":"publisher","unstructured":"Silva, A.S., et al.: Solving a capacitated waste collection problem using an open-source tool. In: Gervasi, O., Murgante, B., Misra, S., Rocha, A.M.A.C., Garau, C. (eds.) ICCSA 2022. LNCS, vol. 13378, pp. 140\u2013156. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-10562-3_11","DOI":"10.1007\/978-3-031-10562-3_11"},{"issue":"2","key":"7_CR15","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0305-0548(83)90030-8","volume":"10","author":"S Raff","year":"1983","unstructured":"Raff, S.: Routing and scheduling of vehicles and crews: the state of the art. Comput. Oper. Res. 10(2), 63\u2013211 (1983)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"7_CR16","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_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.tre.2022.102875","volume":"166","author":"M Amine Masmoudi","year":"2022","unstructured":"Amine Masmoudi, M., 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_CR18","doi-asserted-by":"crossref","unstructured":"Nishida, K., Nishi, T.: Dynamic optimization of conflict-free routing of automated guided vehicles for just-in-time delivery. IEEE Trans. Automat. Sci. Eng. (2022)","DOI":"10.1109\/TASE.2022.3194082"},{"key":"7_CR19","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_CR20","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":"1","key":"7_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2011.07.037","volume":"218","author":"R Baldacci","year":"2012","unstructured":"Baldacci, R., Mingozzi, A., Roberti, R.: Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints. Eur. J. Oper. Res. 218(1), 1\u20136 (2012)","journal-title":"Eur. J. Oper. Res."},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"Yang, S., Ning, L., Shang, P., (Carol) Tong, L.: Augmented Lagrangian relaxation approach for logistics vehicle routing problem with mixed backhauls and time windows. Transp. Res. Part E: Logist. Transp. Rev. 135, 101891 (2020)","DOI":"10.1016\/j.tre.2020.101891"},{"key":"7_CR23","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/j.cor.2017.09.010","volume":"90","author":"MS Farham","year":"2018","unstructured":"Farham, M.S., S\u00fcral, H., Iyigun, C.: A column generation approach for the location-routing problem with time windows. Comput. Oper. Res. 90, 249\u2013263 (2018)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"7_CR24","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1016\/j.ejor.2010.10.017","volume":"210","author":"AL Kok","year":"2011","unstructured":"Kok, A.L., Hans, E.W., Schutten, J.M.J.: Optimizing departure times in vehicle routes. Eur. J. Oper. Res. 210(3), 579\u2013587 (2011)","journal-title":"Eur. J. Oper. Res."},{"key":"7_CR25","volume-title":"Modern Heuristic Techniques for Combinatorial Problems","author":"C Reeves","year":"1995","unstructured":"Reeves, C.: Modern Heuristic Techniques for Combinatorial Problems. Wiley, London (1995)"},{"key":"7_CR26","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.cor.2014.07.005","volume":"52","author":"D Ta\u015f","year":"2014","unstructured":"Ta\u015f, D., Jabali, O., Van Woensel, T.: A vehicle routing problem with flexible time windows. Comput. Oper. Res. 52, 39\u201354 (2014)","journal-title":"Comput. Oper. Res."},{"key":"7_CR27","doi-asserted-by":"crossref","unstructured":"Kaabachi, I., Jriji, D., Krichen, S.: An improved ant colony optimization for green multi-depot vehicle routing problem with time windows. In: 2017 18th IEEE\/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel\/Distributed Computing (SNPD), pp. 339\u2013344 (2017)","DOI":"10.1109\/SNPD.2017.8022743"},{"key":"7_CR28","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/j.ins.2018.12.086","volume":"481","author":"Y Marinakis","year":"2019","unstructured":"Marinakis, Y., Marinaki, M., Migdalas, A.: A multi-adaptive particle swarm optimization for the vehicle routing problem with time windows. Inf. Sci. 481, 311\u2013329 (2019)","journal-title":"Inf. Sci."},{"key":"7_CR29","doi-asserted-by":"crossref","unstructured":"Kallehauge, B.: Formulations and exact algorithms for the vehicle routing problem with time windows. Comput. Oper. Res. 35(7), 2307\u20132330 (2008). Part Special Issue: Includes Selected Papers Presented at the ECCO 2004 European Conference on Combinatorial Optimization","DOI":"10.1016\/j.cor.2006.11.006"},{"key":"7_CR30","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF02430370","volume":"1","author":"Y Rochat","year":"1995","unstructured":"Rochat, Y., Taillard, \u00c9.D.: Probabilistic diversification and intensification in local search for vehicle routing. J. Heuristics 1, 147\u2013167 (1995)","journal-title":"J. Heuristics"},{"issue":"2","key":"7_CR31","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1287\/trsc.31.2.170","volume":"31","author":"\u00c9 Taillard","year":"1997","unstructured":"Taillard, \u00c9., Badeau, P., Gendreau, M., Guertin, F., Potvin, J.Y.: A Tabu search heuristic for the vehicle routing problem with soft time windows. Transp. Sci. 31(2), 170\u2013186 (1997)","journal-title":"Transp. Sci."},{"issue":"4","key":"7_CR32","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1287\/ijoc.9.4.417","volume":"9","author":"WC Chiang","year":"1997","unstructured":"Chiang, W.C., Russell, R.A.: A reactive Tabu search metaheuristic for the vehicle routing problem with time windows. INFORMS J. Comput. 9(4), 417\u2013430 (1997)","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"7_CR33","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1287\/ijoc.8.2.165","volume":"8","author":"JY Potvin","year":"1996","unstructured":"Potvin, J.Y., Bengio, S.: The vehicle routing problem with time windows Part II: genetic search. Informs J. Comput. 8(2), 165\u2013172 (1996)","journal-title":"Informs J. Comput."},{"issue":"11","key":"7_CR34","doi-asserted-by":"publisher","first-page":"1043","DOI":"10.1016\/0305-0548(96)00018-4","volume":"23","author":"SR Thangiah","year":"1996","unstructured":"Thangiah, S.R., Potvin, J.Y., Sun, T.: Heuristic approaches to vehicle routing with backhauls and time windows. Comput. Oper. Res. 23(11), 1043\u20131057 (1996)","journal-title":"Comput. Oper. Res."}],"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-031-53025-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,31]],"date-time":"2024-01-31T20:18:27Z","timestamp":1706732307000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-53025-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031530241","9783031530258"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-53025-8_7","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"1 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"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":"Ponta Delgada","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ol2a2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ol2a.ipb.pt\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"162","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"66","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}