{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T17:01:21Z","timestamp":1762102881679,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030782290"},{"type":"electronic","value":"9783030782306"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-78230-6_18","type":"book-chapter","created":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T23:06:15Z","timestamp":1623884775000},"page":"283-298","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Learning Surrogate Functions for the Short-Horizon Planning in Same-Day Delivery Problems"],"prefix":"10.1007","author":[{"given":"Adrian","family":"Bracher","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikolaus","family":"Frohner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00fcnther R.","family":"Raidl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,17]]},"reference":[{"issue":"1","key":"18_CR1","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.cor.2013.08.016","volume":"41","author":"N Azi","year":"2014","unstructured":"Azi, N., Gendreau, M., Potvin, J.Y.: An adaptive large neighborhood search for a vehicle routing problem with multiple routes. Comput. Oper. Res. 41(1), 167\u2013173 (2014)","journal-title":"Comput. Oper. Res."},{"issue":"6","key":"18_CR2","doi-asserted-by":"publisher","first-page":"977","DOI":"10.1287\/opre.1040.0124","volume":"52","author":"RW Bent","year":"2004","unstructured":"Bent, R.W., Van Hentenryck, P.: Scenario-based planning for partially dynamic vehicle routing with stochastic customers. Oper. Res. 52(6), 977\u2013987 (2004)","journal-title":"Oper. Res."},{"key":"18_CR3","unstructured":"Frohner, N., Raidl, G.R.: A double-horizon approach to a purely dynamic and stochastic vehicle routing problem with delivery deadlines and shift flexibility. In: Causmaecker, P.D., et al. (eds.) Proceedings of the 13th International Conference on the Practice and Theory of Automated Timetabling - PATAT 2021, Vol. I. Bruges, Belgium (2020)"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Joe, W., Lau, H.C.: Deep reinforcement learning approach to solve dynamicvehicle routing problem with stochastic customers. In: Proceedings of theInternational Conference on Automated Planning and Scheduling, vol.\u00a030, pp. 394\u2013402 (2020)","DOI":"10.1609\/icaps.v30i1.6685"},{"key":"18_CR5","unstructured":"Kingma, D.P., Ba, J.: Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014)"},{"issue":"8","key":"18_CR6","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1016\/j.trb.2003.09.001","volume":"38","author":"S Mitrovi\u0107-Mini\u0107","year":"2004","unstructured":"Mitrovi\u0107-Mini\u0107, S., Krishnamurti, R., Laporte, G.: Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows. Trans. Res. Part B: Methodol. 38(8), 669\u2013685 (2004)","journal-title":"Trans. Res. Part B: Methodol."},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"2403","DOI":"10.1007\/978-3-642-46629-8_9","volume":"34","author":"D Pisinger","year":"2007","unstructured":"Pisinger, D., Ropke, S.: A general heuristic for node routing problems. Comput. Oper. Res. 34, 2403\u20132435 (2007). https:\/\/doi.org\/10.1007\/978-3-642-46629-8_9","journal-title":"Comput. Oper. Res."},{"key":"18_CR8","doi-asserted-by":"publisher","DOI":"10.1002\/9780470182963","volume-title":"Approximate Dynamic Programming: Solving the Curses of Dimensionality","author":"WB Powell","year":"2007","unstructured":"Powell, W.B.: Approximate Dynamic Programming: Solving the Curses of Dimensionality. Wiley, Hoboken (2007)"},{"issue":"1","key":"18_CR9","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1080\/00207543.2015.1043403","volume":"54","author":"U Ritzinger","year":"2016","unstructured":"Ritzinger, U., Puchinger, J., Hartl, R.F.: A survey on dynamic and stochastic vehicle routing problems. Int. J. Prod. Res. 54(1), 215\u2013231 (2016)","journal-title":"Int. J. Prod. Res."},{"issue":"4","key":"18_CR10","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S Ropke","year":"2006","unstructured":"Ropke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Trans. Sci. 40(4), 455\u2013472 (2006)","journal-title":"Trans. Sci."},{"issue":"4","key":"18_CR11","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s13676-018-0124-0","volume":"8","author":"Marlin W Ulmer","year":"2018","unstructured":"Ulmer, Marlin W., Thomas, Barrett W., Mattfeld, Dirk C.: Preemptive depot returns for dynamic same-day delivery. EURO J. Trans. Logist. 8(4), 327\u2013361 (2018). https:\/\/doi.org\/10.1007\/s13676-018-0124-0","journal-title":"EURO J. Trans. Logist."},{"issue":"1","key":"18_CR12","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1287\/trsc.2016.0732","volume":"53","author":"SA Voccia","year":"2019","unstructured":"Voccia, S.A., Campbell, A.M., Thomas, B.W.: The same-day delivery problem for online purchases. Trans. Sci. 53(1), 167\u2013184 (2019)","journal-title":"Trans. Sci."}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-78230-6_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,31]],"date-time":"2022-12-31T12:08:04Z","timestamp":1672488484000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-78230-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030782290","9783030782306"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-78230-6_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"17 June 2021","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":"Vienna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cpaior2021.dbai.tuwien.ac.at\/","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":"75","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":"30","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":"40% - 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":"6","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the COVID-19 pandemic the conference was held online.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}