{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T23:29:43Z","timestamp":1759879783879,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031220388"},{"type":"electronic","value":"9783031220395"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-22039-5_11","type":"book-chapter","created":{"date-parts":[[2022,12,10]],"date-time":"2022-12-10T18:02:31Z","timestamp":1670695351000},"page":"135-144","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Sweep Algorithms for\u00a0the\u00a0Vehicle Routing Problem with\u00a0Time Windows"],"prefix":"10.1007","author":[{"given":"Philipp","family":"Armbrust","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kerstin","family":"Maier","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":[[2022,12,11]]},"reference":[{"issue":"1","key":"11_CR1","doi-asserted-by":"crossref","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":"11_CR2","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/j.cie.2015.12.007","volume":"99","author":"K Braekers","year":"2016","unstructured":"Braekers, K., Ramaekers, K., Nieuwenhuyse, I.V.: The vehicle routing problem: state of the art classification and review. Comput. Ind. Eng. 99, 300\u2013313 (2016)","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"11_CR3","doi-asserted-by":"crossref","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":"1","key":"11_CR4","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1287\/trsc.1030.0057","volume":"39","author":"O Br\u00e4ysy","year":"2005","unstructured":"Br\u00e4ysy, O., Gendreau, M.: Vehicle routing problem with time windows, Part II: metaheuristics. Transp. Sci. 39(1), 119\u2013139 (2005)","journal-title":"Transp. Sci."},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1007\/978-3-658-32182-6_2","volume-title":"Data Science \u2013 Analytics and Applications","author":"PA Bucur","year":"2021","unstructured":"Bucur, P.A., Hungerl\u00e4nder, P., Jellen, A., Maier, K., Pachatz, V.: Shift planning for smart meter service operators. In: Haber, P., Lampoltshammer, T., Mayr, M., Plankensteiner, K. (eds.) Data Science \u2013 Analytics and Applications, pp. 8\u201310. Springer, Wiesbaden (2021). https:\/\/doi.org\/10.1007\/978-3-658-32182-6_2"},{"key":"11_CR6","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/j.jksus.2010.03.002","volume":"22","author":"NA El-Sherbeny","year":"2010","unstructured":"El-Sherbeny, N.A.: Vehicle routing with time windows: an overview of exact heuristic and metaheuristic methods. J. King Saud Univ. 22, 123\u2013131 (2010)","journal-title":"J. King Saud Univ."},{"issue":"2","key":"11_CR7","doi-asserted-by":"crossref","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":"11_CR8","series-title":"Operations Research Proceedings","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-030-18500-8_17","volume-title":"Operations Research Proceedings 2018","author":"C Hertrich","year":"2019","unstructured":"Hertrich, C., Hungerl\u00e4nder, P., Truden, C.: Sweep algorithms for the capacitated vehicle routing problem with structured time windows. In: Fortz, B., Labb\u00e9, M. (eds.) Operations Research Proceedings 2018. ORP, pp. 127\u2013133. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-18500-8_17"},{"key":"11_CR9","doi-asserted-by":"crossref","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":"11_CR10","doi-asserted-by":"crossref","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."},{"unstructured":"Savills: European Food and Groceries Sector, European Commercial, Savills Commercial Research (2021). https:\/\/pdf.euro.savills.co.uk\/european\/europe-retail-markets\/spotlight---european-food-and-groceries-sector---2021.pdf. Accessed 19 Dec 2021","key":"11_CR11"},{"issue":"2","key":"11_CR12","doi-asserted-by":"crossref","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":"11_CR13","volume-title":"The Vehicle Routing Problem: Problems, Methods, and Applications","year":"2014","unstructured":"Toth, P., Vigo, D. (eds.): The Vehicle Routing Problem: Problems, Methods, and Applications, 2nd edn. Society for Industrial and Applied Mathematics, Philadelphia (2014)","edition":"2"}],"container-title":["Communications in Computer and Information Science","Optimization and Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22039-5_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,30]],"date-time":"2025-03-30T04:31:11Z","timestamp":1743309071000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22039-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031220388","9783031220395"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22039-5_11","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"11 December 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"OLA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Optimization and Learning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Syracuse, Sicilia","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 July 2022","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":"ola2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ola2022.sciencesconf.org\/","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":"sciencesconf.org","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"52","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":"19","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":"37% - 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)"}}]}}