{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:56:36Z","timestamp":1743130596417,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031325335"},{"type":"electronic","value":"9783031325342"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-32534-2_4","type":"book-chapter","created":{"date-parts":[[2023,5,17]],"date-time":"2023-05-17T16:02:17Z","timestamp":1684339337000},"page":"45-55","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Time-Aware Optimisation Models for\u00a0Hospital Logistics"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6913-8046","authenticated-orcid":false,"given":"Herwig","family":"Zeiner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9165-3749","authenticated-orcid":false,"given":"Roland","family":"Unterberger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-2707-4077","authenticated-orcid":false,"given":"Julia","family":"Tschuden","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3716-360X","authenticated-orcid":false,"given":"Mohammad Yusuf","family":"Quadri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,18]]},"reference":[{"issue":"2","key":"4_CR1","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/j.ejor.2012.05.028","volume":"223","author":"N Agatz","year":"2012","unstructured":"Agatz, N., Erera, A., Savelsbergh, M., Wang, X.: Optimization for dynamic ride-sharing: a review. Eur. J. Oper. Res. 223(2), 295\u2013303 (2012)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"4_CR2","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s00291-008-0135-6","volume":"32","author":"A Beaudry","year":"2010","unstructured":"Beaudry, A., Laporte, G., Melo, T., Nickel, S.: Dynamic transportation of patients in hospitals. OR Spectr. 32(1), 77\u2013107 (2010)","journal-title":"OR Spectr."},{"issue":"1","key":"4_CR3","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/j.ejor.2009.04.024","volume":"202","author":"G Berbeglia","year":"2010","unstructured":"Berbeglia, G., Cordeau, J.F., Laporte, G.: Dynamic pickup and delivery problems. Eur. J. Oper. Res. 202(1), 8\u201315 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"4_CR4","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1287\/inte.1080.0379","volume":"39","author":"T Hanne","year":"2009","unstructured":"Hanne, T., Melo, T., Nickel, S.: Bringing robustness to patient flow management through optimized patient transports in hospitals. Interfaces 39(3), 241\u2013255 (2009)","journal-title":"Interfaces"},{"key":"4_CR5","unstructured":"Kallrath, J.: Vehicle routing problems in hospital transportation. i models and solution approaches. In: Online Storage Systems and Transportation Problems with Applications: Optimization Models and Mathematical Solutions, pp. 57\u2013120 (2005)"},{"issue":"2","key":"4_CR6","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1016\/j.ejor.2011.04.033","volume":"214","author":"Y Kergosien","year":"2011","unstructured":"Kergosien, Y., Lente, C., Piton, D., Billaut, J.C.: A tabu search heuristic for the dynamic transportation of patients between care units. Eur. J. Oper. Res. 214(2), 442\u2013452 (2011)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"4_CR7","doi-asserted-by":"publisher","first-page":"1008","DOI":"10.1016\/j.cor.2005.05.022","volume":"34","author":"JQ Li","year":"2007","unstructured":"Li, J.Q., Borenstein, D., Mirchandani, P.B.: A decision support system for the single-depot vehicle rescheduling problem. Comput. Oper. Res. 34(4), 1008\u20131032 (2007)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"4_CR8","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1016\/j.ejor.2007.12.037","volume":"194","author":"JQ Li","year":"2009","unstructured":"Li, J.Q., Mirchandani, P.B., Borenstein, D.: Real-time vehicle rerouting problems with time windows. Eur. J. Oper. Res. 194(3), 711\u2013727 (2009)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"4_CR9","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF02031946","volume":"60","author":"OB Madsen","year":"1995","unstructured":"Madsen, O.B., Ravn, H.F., Rygaard, J.M.: A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives. Ann. Oper. Res. 60(1), 193\u2013208 (1995)","journal-title":"Ann. Oper. Res."},{"key":"4_CR10","unstructured":"Parragh, S.: Ambulance routing problems with rich constraints and multiple objectives. Ph.D. thesis, uniwien (2009)"},{"issue":"5","key":"4_CR11","doi-asserted-by":"publisher","first-page":"912","DOI":"10.1016\/j.trc.2010.06.002","volume":"19","author":"SN Parragh","year":"2011","unstructured":"Parragh, S.N.: Introducing heterogeneous users and vehicles into models and algorithms for the dial-a-ride problem. Trans. Res. Part C: Emerg. Technol. 19(5), 912\u2013930 (2011)","journal-title":"Trans. Res. Part C: Emerg. Technol."},{"issue":"3","key":"4_CR12","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/s00291-010-0229-9","volume":"34","author":"SN Parragh","year":"2012","unstructured":"Parragh, S.N., Cordeau, J.F., Doerner, K.F., Hartl, R.F.: Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints. OR Spectr. 34(3), 593\u2013633 (2012)","journal-title":"OR Spectr."},{"issue":"6","key":"4_CR13","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1016\/j.cor.2009.10.003","volume":"37","author":"SN Parragh","year":"2010","unstructured":"Parragh, S.N., Doerner, K.F., Hartl, R.F.: Variable neighborhood search for the dial-a-ride problem. Comput. Oper. Res. 37(6), 1129\u20131138 (2010)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"4_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2012.08.015","volume":"225","author":"V Pillac","year":"2013","unstructured":"Pillac, V., Gendreau, M., Gu\u00e9ret, C., Medaglia, A.L.: A review of dynamic vehicle routing problems. Eur. J. Oper. Res. 225(1), 1\u201311 (2013)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"4_CR15","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1287\/trsc.1120.0452","volume":"48","author":"V Schmid","year":"2014","unstructured":"Schmid, V., Doerner, K.F.: Examination and operating room scheduling including optimization of intrahospital routing. Transp. Sci. 48(1), 59\u201377 (2014)","journal-title":"Transp. Sci."},{"issue":"1","key":"4_CR16","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1287\/trsc.31.1.60","volume":"31","author":"P Toth","year":"1997","unstructured":"Toth, P., Vigo, D.: Heuristic algorithms for the handicapped persons transportation problem. Transp. Sci. 31(1), 60\u201371 (1997)","journal-title":"Transp. Sci."},{"issue":"1","key":"4_CR17","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1016\/j.ijpe.2012.07.001","volume":"140","author":"X Wang","year":"2012","unstructured":"Wang, X., Ruan, J., Shi, Y.: A recovery model for combinational disruptions in logistics delivery: considering the real-world participators. Int. J. Prod. Econ. 140(1), 508\u2013520 (2012)","journal-title":"Int. J. Prod. Econ."},{"issue":"3","key":"4_CR18","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1111\/j.1475-3995.2006.00544.x","volume":"13","author":"KI Wong","year":"2006","unstructured":"Wong, K.I., Bell, M.G.: Solution of the dial-a-ride problem with multi-dimensional capacity constraints. Int. Trans. Oper. Res. 13(3), 195\u2013208 (2006)","journal-title":"Int. Trans. Oper. Res."},{"key":"4_CR19","doi-asserted-by":"publisher","first-page":"189614","DOI":"10.1109\/ACCESS.2020.3032018","volume":"8","author":"Y Wu","year":"2020","unstructured":"Wu, Y., Zheng, B., Zhou, X.: A disruption recovery model for time-dependent vehicle routing problem with time windows in delivering perishable goods. IEEE Access 8, 189614\u2013189631 (2020)","journal-title":"IEEE Access"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Zeiner, H., Unterberger, R.: Time-aware data spaces-a key computing unit in the edge-to-cloud continuum. In: 2021 8th International Conference on Future Internet of Things and Cloud (FiCloud), pp. 250\u2013255. IEEE (2021)","DOI":"10.1109\/FiCloud49777.2021.00043"}],"container-title":["Lecture Notes in Business Information Processing","Decision Support Systems XIII. Decision Support Systems in An Uncertain World: The Contribution of Digital Twins"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-32534-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,19]],"date-time":"2024-03-19T07:07:23Z","timestamp":1710832043000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-32534-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031325335","9783031325342"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-32534-2_4","relation":{},"ISSN":["1865-1348","1865-1356"],"issn-type":[{"type":"print","value":"1865-1348"},{"type":"electronic","value":"1865-1356"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"18 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICDSST","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Decision Support System Technology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Albi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icdsst2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icdsst2023.wordpress.com\/about-2\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"65","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":"21","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":"32% - 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":"3","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)"}}]}}