{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:41:28Z","timestamp":1742960488208,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031249068"},{"type":"electronic","value":"9783031249075"}],"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-24907-5_53","type":"book-chapter","created":{"date-parts":[[2023,8,29]],"date-time":"2023-08-29T10:02:05Z","timestamp":1693303325000},"page":"443-449","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Manipulating Waiting-Plus-Detour-Time Mechanisms for Pickup and Delivery Problems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0047-1235","authenticated-orcid":false,"given":"Martin Damyanov","family":"Aleksandrov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,30]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Afrati, F., Cosmadakis, S., Papadimitriou, C. H., Papageorgiou, G., & Papakostantinou, N. (1986). The complexity of the travelling repairman problem. RAIRO\u2014Theoretical Informatics and Applications\u2014Informatique Th\u00e9orique et Applications,\u00a020(1), 79\u201387. http:\/\/www.numdam.org\/item\/ITA_1986_20_1_79_0\/","key":"53_CR1","DOI":"10.1051\/ita\/1986200100791"},{"doi-asserted-by":"publisher","unstructured":"Aleksandrov, M. D. (2021). Fleet fairness and fleet efficiency in capacitated pickup and delivery problems. In Proceedings of the 32nd IEEE Intelligent Vehicles Symposium (IV21), Nagoya, Japan, July 11\u201317, 2021 (pp. 1156\u20131161). IEEE Xplore. https:\/\/doi.org\/10.1109\/IV48863.2021.9576002","key":"53_CR2","DOI":"10.1109\/IV48863.2021.9576002"},{"doi-asserted-by":"publisher","unstructured":"Fredman, M., & Tarjan, R. (1984). Fibonacci heaps and their uses in improved network optimization algorithms. In 25th Annual Symposium on Foundations of Computer Science (pp. 338\u2013346). https:\/\/doi.org\/10.1109\/SFCS.1984.715934","key":"53_CR3","DOI":"10.1109\/SFCS.1984.715934"},{"doi-asserted-by":"publisher","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. W. H. Freeman. https:\/\/doi.org\/10.5555\/574848","key":"53_CR4","DOI":"10.5555\/574848"},{"key":"53_CR5","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1287\/trsc.2018.0837","volume":"53","author":"T Gschwind","year":"2019","unstructured":"Gschwind, T., & Drexl, M. (2019). Adaptive large neighborhood search with a constant-time feasibility test for the dial-a-ride problem. Transportation Science,\u00a053, 480\u2013491. https:\/\/doi.org\/10.1287\/trsc.2018.0837","journal-title":"Transportation Science"},{"doi-asserted-by":"publisher","unstructured":"Koutsoupias, E., & Papadimitriou, C. (1999). Worst-case equilibria. In C. Meinel, & S. Tison (Eds.), Proceedings of 16th Annual Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science (Vol. 1563, pp. 404\u2013413). Springer. https:\/\/doi.org\/10.1007\/3-540-49116-3_38","key":"53_CR6","DOI":"10.1007\/3-540-49116-3_38"},{"issue":"2","key":"53_CR7","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1145\/3440968.3440975","volume":"18","author":"H Ma","year":"2020","unstructured":"Ma, H., Fang, F., & Parkes, D. C. (2020). Spatio-temporal pricing for ridesharing platforms. SIGecom Exchange,\u00a018(2), 53\u201357. https:\/\/doi.org\/10.1145\/3440968.3440975","journal-title":"SIGecom Exchange"},{"issue":"2","key":"53_CR8","doi-asserted-by":"publisher","first-page":"155","DOI":"10.2307\/1907266","volume":"18","author":"J Nash","year":"1950","unstructured":"Nash, J. (1950). The bargaining problem. Econometrica,\u00a018(2), 155\u2013162. https:\/\/doi.org\/10.2307\/1907266","journal-title":"Econometrica"},{"issue":"6","key":"53_CR9","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1134\/S1064230715040024","volume":"54","author":"S Nucamendi","year":"2015","unstructured":"Nucamendi, S., Cardona-Valdes, Y., & Angel-Bello Acosta, F. (2015). Minimizing customers\u2019 waiting time in a vehicle routing problem with unit demands. Journal of Computer and Systems Sciences International,\u00a054(6), 866\u2013881. https:\/\/doi.org\/10.1134\/S1064230715040024","journal-title":"Journal of Computer and Systems Sciences International"},{"issue":"3","key":"53_CR10","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/s11116-011-9375-4","volume":"39","author":"J Paquette","year":"2012","unstructured":"Paquette, J., Bellavance, F., Cordeau, J. F., & Laporte, G. (2012). Measuring quality of service in dial-a-ride operations: The case of a Canadian city. Transportation,\u00a039(3), 539\u2013564. https:\/\/doi.org\/10.1007\/s11116-011-9375-4","journal-title":"Transportation"},{"doi-asserted-by":"publisher","unstructured":"Rheingans-Yoo, D., Kominers, S. D., Ma, H., & Parkes, D. C. (2019). Ridesharing with driver location preferences. In Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, IJCAI-19, International Joint Conferences on Artificial Intelligence Organization (pp. 557\u2013564). https:\/\/doi.org\/10.24963\/ijcai.2019\/79","key":"53_CR11","DOI":"10.24963\/ijcai.2019\/79"},{"issue":"2","key":"53_CR12","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/j.ejor.2019.10.010","volume":"286","author":"T Vidal","year":"2020","unstructured":"Vidal, T., Laporte, G., & Matl, P. (2020). A concise guide to existing and emerging vehicle routing problem variants. European Journal of Operational Research,\u00a0286(2), 401\u2013416. https:\/\/doi.org\/10.1016\/j.ejor.2019.10.010","journal-title":"European Journal of Operational Research"}],"container-title":["Lecture Notes in Operations Research","Operations Research Proceedings 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-24907-5_53","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,29]],"date-time":"2023-08-29T10:07:41Z","timestamp":1693303661000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-24907-5_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031249068","9783031249075"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-24907-5_53","relation":{},"ISSN":["2731-040X","2731-0418"],"issn-type":[{"type":"print","value":"2731-040X"},{"type":"electronic","value":"2731-0418"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"30 August 2023","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":"Karlsruhe","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","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":"6 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"or2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}