{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T13:34:46Z","timestamp":1760016886170,"version":"3.40.3"},"publisher-location":"Cham","reference-count":6,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031086229"},{"type":"electronic","value":"9783031086236"}],"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.springer.com\/tdm"},{"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.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-08623-6_42","type":"book-chapter","created":{"date-parts":[[2022,8,29]],"date-time":"2022-08-29T07:06:24Z","timestamp":1661756784000},"page":"283-288","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["New Optimization Guidance for\u00a0Dynamic Dial-a-Ride Problems"],"prefix":"10.1007","author":[{"given":"Christian","family":"Ackermann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julia","family":"Rieck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,30]]},"reference":[{"issue":"3","key":"42_CR1","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1287\/ijoc.1110.0454","volume":"24","author":"G Berbeglia","year":"2012","unstructured":"Berbeglia, G., Cordeau, J.F., Laporte, G.: A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem. Informs J. Comput. 24(3), 343\u2013355 (2012)","journal-title":"Informs J. Comput."},{"key":"42_CR2","doi-asserted-by":"publisher","first-page":"101199","DOI":"10.1016\/j.jocs.2020.101199","volume":"47","author":"S Vallee","year":"2020","unstructured":"Vallee, S., Oulamara, A., Cherif-Khettaf, W.R.: New online reinsertion approaches for a dynamic dial-a-ride problem. J. Comput. Sci. 47, 101199 (2020)","journal-title":"J. Comput. Sci."},{"key":"42_CR3","unstructured":"Chassaing, M., Giboulot, V., Lacomme, P., Quilliot, A., Ren, L.: Determination of robust solutions for the dynamic dial-a-ride problem. In: CIE45 Proceedings (2015)"},{"issue":"1","key":"42_CR4","doi-asserted-by":"publisher","first-page":"59","DOI":"10.3141\/2218-07","volume":"2218","author":"Y Luo","year":"2011","unstructured":"Luo, Y., Schonfeld, P.: Online rejected-reinsertion heuristics for dynamic multivehicle dial-a-ride problem. Transp. Res. Rec. 2218(1), 59\u201367 (2011)","journal-title":"Transp. Res. Rec."},{"key":"42_CR5","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.trb.2014.05.007","volume":"67","author":"K Braekers","year":"2014","unstructured":"Braekers, K., Caris, A., Janssens, G.K.: Exact and meta-heuristic approach for a general heterogeneous dial-a-ride problem with multiple depots. Transp. Res. Part B 67, 166\u2013186 (2014)","journal-title":"Transp. Res. Part B"},{"key":"42_CR6","doi-asserted-by":"crossref","unstructured":"Ulmer, M.W.: Anticipation vs. reactive reoptimization for dynamic vehicle routing with stochastic requests. Networks 73(3), 277\u2013291 (2018)","DOI":"10.1002\/net.21861"}],"container-title":["Lecture Notes in Operations Research","Operations Research Proceedings 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-08623-6_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,29]],"date-time":"2022-08-29T07:09:42Z","timestamp":1661756982000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-08623-6_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031086229","9783031086236"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-08623-6_42","relation":{},"ISSN":["2731-040X","2731-0418"],"issn-type":[{"type":"print","value":"2731-040X"},{"type":"electronic","value":"2731-0418"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"30 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"OR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"or2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.or2021.unibe.ch\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}