{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:18:58Z","timestamp":1743074338033,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030192112"},{"type":"electronic","value":"9783030192129"}],"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-19212-9_14","type":"book-chapter","created":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T10:32:32Z","timestamp":1558348352000},"page":"208-224","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["An Optimization Approach to the Ordering Phase of an Attended Home Delivery Service"],"prefix":"10.1007","author":[{"given":"G\u00fcnther","family":"Cwioro","sequence":"first","affiliation":[]},{"given":"Philipp","family":"Hungerl\u00e4nder","sequence":"additional","affiliation":[]},{"given":"Kerstin","family":"Maier","sequence":"additional","affiliation":[]},{"given":"J\u00f6rg","family":"P\u00f6cher","sequence":"additional","affiliation":[]},{"given":"Christian","family":"Truden","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,28]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-0-387-77778-8_17","volume-title":"The Vehicle Routing Problem: Latest Advances and New Challenges","author":"N Agatz","year":"2008","unstructured":"Agatz, N., Campbell, A.M., Fleischmann, M., Savelsbergh, M.W.P.: Challenges and opportunities in attended home delivery. In: Golden, B., Raghavan, S., Wasil, E. (eds.) The Vehicle Routing Problem: Latest Advances and New Challenges, pp. 379\u2013396. Springer, US (2008). \n                    https:\/\/doi.org\/10.1007\/978-0-387-77778-8_17"},{"issue":"3","key":"14_CR2","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1287\/trsc.1040.0105","volume":"39","author":"AM Campbell","year":"2005","unstructured":"Campbell, A.M., Savelsbergh, M.W.P.: Decision support for consumer direct grocery initiatives. Transp. Sci. 39(3), 313\u2013327 (2005)","journal-title":"Transp. Sci."},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-1-4614-3628-7_3","volume-title":"In: Integration of Information and Optimization Models for Routing in City Logistics","author":"JF Ehmke","year":"2012","unstructured":"Ehmke, J.F.: Attended home delivery. In: Integration of Information and Optimization Models for Routing in City Logistics, pp. 23\u201333. Springer, Boston (2012). \n                    https:\/\/doi.org\/10.1007\/978-1-4614-3628-7_3"},{"issue":"1","key":"14_CR4","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/j.ejor.2013.08.028","volume":"233","author":"JF Ehmke","year":"2014","unstructured":"Ehmke, J.F., Campbell, A.M.: Customer acceptance mechanisms for home deliveries in metropolitan areas. Eur. J. Oper. Res. 233(1), 193\u2013207 (2014). \n                    https:\/\/doi.org\/10.1016\/j.ejor.2013.08.028","journal-title":"Eur. J. Oper. Res."},{"key":"14_CR5","doi-asserted-by":"publisher","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":"3","key":"14_CR6","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1287\/opre.46.3.330","volume":"46","author":"M Gendreau","year":"1998","unstructured":"Gendreau, M., Hertz, A., Laporte, G., Stan, M.: A generalized insertion heuristic for the traveling salesman problem with time windows. Oper. Res. 46(3), 330\u2013335 (1998)","journal-title":"Oper. Res."},{"key":"14_CR7","series-title":"Operations Research Proceedings","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-319-55702-1_18","volume-title":"Operations Research Proceedings 2016","author":"P Hungerl\u00e4nder","year":"2018","unstructured":"Hungerl\u00e4nder, P., Maier, K., P\u00f6cher, J., Rendl, A., Truden, C.: Solving an on-line capacitated vehicle routing problem with structured time windows. In: Fink, A., F\u00fcgenschuh, A., Geiger, M.J. (eds.) Operations Research Proceedings 2016. ORP, pp. 127\u2013132. Springer, Cham (2018). \n                    https:\/\/doi.org\/10.1007\/978-3-319-55702-1_18"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1016\/j.trpro.2017.12.046","volume":"27","author":"P Hungerl\u00e4nder","year":"2017","unstructured":"Hungerl\u00e4nder, P., Rendl, A., Truden, C.: On the slot optimization problem in on-line vehicle routing. Transp. Res. Procedia 27, 492\u2013499 (2017). \n                    https:\/\/doi.org\/10.1016\/j.trpro.2017.12.046","journal-title":"Transp. Res. Procedia"},{"key":"14_CR9","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). \n                    https:\/\/doi.org\/10.1016\/j.trpro.2018.09.018\n                    \n                  . EURO Mini Conference on \u201cAdvances in Freight Transportation and Logistics\u201d","journal-title":"Transp. Res. Procedia"},{"doi-asserted-by":"publisher","unstructured":"Klein, R., Mackert, J., Neugebauer, M., Steinhardt, C.: A model-based approximation of opportunity cost for dynamic pricing in attended home delivery. OR Spectrum (2017). \n                    https:\/\/doi.org\/10.1007\/s00291-017-0501-3","key":"14_CR10","DOI":"10.1007\/s00291-017-0501-3"},{"key":"14_CR11","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2017.0738","author":"R Klein","year":"2017","unstructured":"Klein, R., Neugebauer, M., Ratkovitch, D., Steinhardt, C.: Differentiated time slot pricing under routing considerations in attended home delivery. Transp. Sci. (2017). \n                    https:\/\/doi.org\/10.1287\/trsc.2017.0738","journal-title":"Transp. Sci."},{"key":"14_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2019.01.001","author":"C K\u00f6hler","year":"2019","unstructured":"K\u00f6hler, C., Ehmke, J.F., Campbell, A.M.: Flexible time window management for attended home deliveries. Omega (2019). \n                    https:\/\/doi.org\/10.1016\/j.omega.2019.01.001","journal-title":"Omega"},{"issue":"2","key":"14_CR13","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1002\/net.3230110211","volume":"11","author":"JK Lenstra","year":"1981","unstructured":"Lenstra, J.K., Kan, A.H.G.R.: Complexity of vehicle routing and scheduling problems. Networks 11(2), 221\u2013227 (1981). \n                    https:\/\/doi.org\/10.1002\/net.3230110211","journal-title":"Networks"},{"issue":"9","key":"14_CR14","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). \n                    https:\/\/doi.org\/10.1108\/IMDS-10-2016-0432","journal-title":"Ind. Manag. Data Syst."},{"issue":"2","key":"14_CR15","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). \n                    https:\/\/doi.org\/10.1287\/opre.35.2.254","journal-title":"Oper. Res."},{"unstructured":"Syndy: The state of online grocery retail in Europe 2015 (2015). \n                    http:\/\/www.syndy.com\/report-the-state-of-online-grocery-retail-2015\/","key":"14_CR16"},{"unstructured":"Vienna public transport (Wiener Linien): 2017 - Facts and Figures (2018). \n                    https:\/\/www.wienerlinien.at\/media\/files\/2018\/facts_and_figures_2017_243486.pdf","key":"14_CR17"},{"issue":"2","key":"14_CR18","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1287\/trsc.2014.0549","volume":"50","author":"X Yang","year":"2016","unstructured":"Yang, X., Strauss, A.K., Currie, C.S.M., Eglese, R.: Choice-based demand management and vehicle routing in E-fulfillment. Transp. Sci. 50(2), 473\u2013488 (2016)","journal-title":"Transp. Sci."}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-19212-9_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T19:06:30Z","timestamp":1558983990000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-19212-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030192112","9783030192129"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-19212-9_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"28 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CPAIOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Thessaloniki","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2019b","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cpaior2019.uowm.gr\/","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"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"94","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"34","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"9","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"36% - 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"}},{"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"}},{"value":"5.67","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}