{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T07:09:01Z","timestamp":1750748941741,"version":"3.40.3"},"publisher-location":"Cham","reference-count":7,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030184995"},{"type":"electronic","value":"9783030185008"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-18500-8_17","type":"book-chapter","created":{"date-parts":[[2019,8,29]],"date-time":"2019-08-29T15:02:47Z","timestamp":1567090967000},"page":"127-133","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Sweep Algorithms for the Capacitated Vehicle Routing Problem with Structured Time Windows"],"prefix":"10.1007","author":[{"given":"Christoph","family":"Hertrich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philipp","family":"Hungerl\u00e4nder","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Truden","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,30]]},"reference":[{"issue":"1","key":"17_CR1","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."},{"issue":"1","key":"17_CR2","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1287\/trsc.1030.0056","volume":"39","author":"O Br\u00e4ysy","year":"2005","unstructured":"Br\u00e4ysy, O., Gendreau, M.: Vehicle routing problem with time windows, part I: route construction and local search algorithms. Transp. Sci. 39(1), 104\u2013118 (2005)","journal-title":"Transp. Sci."},{"issue":"2","key":"17_CR3","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1287\/opre.22.2.340","volume":"22","author":"BE Gillett","year":"1974","unstructured":"Gillett, B.E., Miller, L.R.: A heuristic algorithm for the vehicle-dispatch problem. Oper. Res. 22(2), 340\u2013349 (1974)","journal-title":"Oper. Res."},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.trpro.2018.09.018","volume":"30","author":"P Hungerl\u00e4nder","year":"2018","unstructured":"Hungerl\u00e4nder, P., Truden, C.: Efficient and easy-to-implement mixed-integer linear programs for the traveling salesperson problem with time windows. Transp. Res. Procedia 30, 157\u2013166 (2018)","journal-title":"Transp. Res. Procedia"},{"issue":"9","key":"17_CR5","doi-asserted-by":"publisher","first-page":"1917","DOI":"10.1108\/IMDS-10-2016-0432","volume":"117","author":"S Pan","year":"2017","unstructured":"Pan, S., Giannikas, V., Han, Y., Grover-Silva, E., Qiao, B.: Using customer-related data to enhance e-grocery home delivery. Ind. Manag. Data Syst. 117(9), 1917\u20131933 (2017)","journal-title":"Ind. Manag. Data Syst."},{"issue":"2","key":"17_CR6","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":"17_CR7","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1002\/net.3230070103","volume":"7","author":"RE Tarjan","year":"1977","unstructured":"Tarjan, R.E.: Finding optimum branchings. Networks 7(1), 25\u201335 (1977)","journal-title":"Networks"}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2018"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-18500-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,29]],"date-time":"2019-08-29T22:03:47Z","timestamp":1567116227000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-18500-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030184995","9783030185008"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-18500-8_17","relation":{},"ISSN":["0721-5924","2197-9294"],"issn-type":[{"type":"print","value":"0721-5924"},{"type":"electronic","value":"2197-9294"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"30 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}