{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:07:29Z","timestamp":1757617649551,"version":"3.44.0"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031863691"},{"type":"electronic","value":"9783031863707"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-86370-7_6","type":"book-chapter","created":{"date-parts":[[2025,4,4]],"date-time":"2025-04-04T07:32:45Z","timestamp":1743751965000},"page":"83-97","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Capacity Vehicle Routing Problem with Time Windows: Simulation Tool for Footprint Network Design"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7057-3416","authenticated-orcid":false,"given":"Cosimo","family":"Birtolo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-5107-6451","authenticated-orcid":false,"given":"Erica","family":"Occhionero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-4051-6536","authenticated-orcid":false,"given":"Francesca","family":"Torre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,4,3]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manag. Sci. 6, 80\u201391 (1959)","journal-title":"Manag. Sci."},{"issue":"1","key":"6_CR2","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s13676-014-0074-0","volume":"6","author":"D Cattaruzza","year":"2017","unstructured":"Cattaruzza, D., Absi, N., Feillet, D., Gonz\u00e1lez-Feliu, J.: Vehicle routing problems for city logistics. EURO J. Transp. Logist. 6(1), 51\u201379 (2017)","journal-title":"EURO J. Transp. Logist."},{"key":"6_CR3","unstructured":"Christofides, N.: Worst-case analysis of a new heuristic for the travelling salesman problem. Carnegie Mellon University (1976)"},{"issue":"1","key":"6_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/trsc.22.1.1","volume":"22","author":"MM Solomon","year":"1988","unstructured":"Solomon, M.M., Desrosiers, J.: Survey paper\u2014time window constrained routing and scheduling problems. Transp. Sci. 22(1), 1\u201313 (1988)","journal-title":"Transp. Sci."},{"issue":"8","key":"6_CR5","doi-asserted-by":"publisher","first-page":"5375","DOI":"10.1016\/j.asoc.2011.05.021","volume":"11","author":"Z Ursani","year":"2011","unstructured":"Ursani, Z., Essam, D., Cornforth, D., Stocker, R.: Localized genetic algorithm for vehicle routing problem with time windows. Appl. Soft Comput. 11(8), 5375\u20135390 (2011)","journal-title":"Appl. Soft Comput."},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Hedar, A., Bakr, A: Three strategies tabu search for vehicle routing problem with time windows. Comput. Sci. Inf. Technol. 2(2), 108\u2013119 (2014)","DOI":"10.13189\/csit.2014.020208"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Dereci, U., Erkan Karabekmez, M.: The applications of multiple route optimization heuristics and meta-heuristic algorithms to solid waste transportation: a case study in Turkey. Decis. Anal. J. 4 (2022)","DOI":"10.1016\/j.dajour.2022.100113"},{"issue":"5","key":"6_CR8","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1016\/j.trc.2010.07.008","volume":"19","author":"A Bettinelli","year":"2011","unstructured":"Bettinelli, A., Ceselli, A., Righini, G.: A branch-and-cut-and-price algorithm for the multi-depot heterogeneous vehicle routing problem with time windows. Transp. Res. Part C: Emerg. Technol. 19(5), 723\u2013740 (2011)","journal-title":"Transp. Res. Part C: Emerg. Technol."},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Rapanaki, E., Psychas, I., Marinaki, M., Marinakis, Y.: An artificial bee colony algorithm for the multiobjective energy reduction multi-depot vehicle routing problem. In: Matsatsinis, N., Marinakis, Y., Pardalos, P. (eds.) Learning and Intelligent Optimization. LION 2019, LNCS, vol. 11968. Springer, Cham (2020)","DOI":"10.1007\/978-3-030-38629-0_17"},{"issue":"6","key":"6_CR10","doi-asserted-by":"publisher","first-page":"1866","DOI":"10.1109\/TEVC.2022.3230042","volume":"27","author":"P Stodola","year":"2023","unstructured":"Stodola, P., Nohel, J.: Adaptive ant colony optimization with node clustering for the multidepot vehicle routing problem. IEEE Trans. Evol. Comput. 27(6), 1866\u20131880 (2023)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"6_CR11","doi-asserted-by":"publisher","unstructured":"Goel, R., Maini, R., Bansal, R.: Vehicle routing problem with time windows having stochastic customers demands and stochastic service times: modelling and solution. J. Comput. Sci. 34, 1\u201310 (2019). https:\/\/doi.org\/10.1016\/j.jocs.2019.04.003","DOI":"10.1016\/j.jocs.2019.04.003"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Birtolo, C., Torre, F.: C2VRPTW: Assigning capacity to vehicles and nodes in a Vehicle Routing Problem for real-world delivery application. In: Proceedings of the 18th Learning and Intelligent Optimization Conference, 9\u201313 June 2024, Ischia, Italy (2024)","DOI":"10.1007\/978-3-031-75623-8_5"},{"issue":"1","key":"6_CR13","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/s10479-009-0650-0","volume":"175","author":"R Baldacci","year":"2010","unstructured":"Baldacci, R., Toth, P., Vigo, D.: Exact algorithms for routing problems under vehicle capacity constraints. Ann. Oper. Res. 175(1), 213\u2013245 (2010)","journal-title":"Ann. Oper. Res."},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1016\/j.ins.2012.01.006","volume":"259","author":"L Troiano","year":"2014","unstructured":"Troiano, L., Birtolo, C.: Genetic algorithms supporting generative design of user interfaces: examples. Inf. Sci. 259, 433\u2013451 (2014)","journal-title":"Inf. Sci."},{"key":"6_CR15","unstructured":"Furnon, V., Perron, L.: OR-Tools Routing Library v9.8. Google (2023). https:\/\/developers.google.com\/optimization\/routing\/"}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Intelligent Transport Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-86370-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T08:42:12Z","timestamp":1757148132000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-86370-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031863691","9783031863707"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-86370-7_6","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"type":"print","value":"1867-8211"},{"type":"electronic","value":"1867-822X"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"3 April 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"INTSYS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Transport Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pisa","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"intsys2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}