{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T23:33:59Z","timestamp":1767137639464,"version":"build-2238731810"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031226946","type":"print"},{"value":"9783031226953","type":"electronic"}],"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.springernature.com\/gp\/researchers\/text-and-data-mining"},{"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.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-22695-3_48","type":"book-chapter","created":{"date-parts":[[2022,12,2]],"date-time":"2022-12-02T10:11:58Z","timestamp":1669975918000},"page":"690-703","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficiency and\u00a0Truthfulness in\u00a0Dial-a-Ride Problems with\u00a0Customers Location Preferences"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0047-1235","authenticated-orcid":false,"given":"Martin","family":"Aleksandrov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7349-1179","authenticated-orcid":false,"given":"Philip","family":"Kilby","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,3]]},"reference":[{"key":"48_CR1","doi-asserted-by":"crossref","unstructured":"Afrati, F., Cosmadakis, S., Papadimitriou, C.H., Papageorgiou, G., Papakostantinou, N.: The complexity of the travelling repairman problem. RAIRO Theor. Inform. Appl. Inform. Th\u00e9orique et Appl. 20(1), 79\u201387 (1986). http:\/\/www.numdam.org\/item\/ITA_1986__20_1_79_0\/","DOI":"10.1051\/ita\/1986200100791"},{"key":"48_CR2","doi-asserted-by":"publisher","unstructured":"Aleksandrov, M.D.: Fleet fairness and fleet efficiency in capacitated pickup and delivery problems. In: Proceedings of the 32nd IEEE Intelligent Vehicles Symposium (IV21), 11\u201317. Nagoya, Japan, pp. 1156\u20131161. IEEE Xplore (2021). https:\/\/doi.org\/10.1109\/IV48863.2021.9576002","DOI":"10.1109\/IV48863.2021.9576002"},{"key":"48_CR3","doi-asserted-by":"publisher","unstructured":"Araque G, J.R., Kudva, G., Morin, T.L., Pekny, J.F.: A branch-and-cut algorithm for vehicle routing problems. Ann. Oper. Res. 50(1), 37\u201359 (1994). https:\/\/doi.org\/10.1007\/BF02085634","DOI":"10.1007\/BF02085634"},{"key":"48_CR4","doi-asserted-by":"crossref","unstructured":"Bei, X., Zhang, S.: Algorithms for trip-vehicle assignment in ride-sharing. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 32, no. 1 (2018). https:\/\/ojs.aaai.org\/index.php\/AAAI\/article\/view\/11298","DOI":"10.1609\/aaai.v32i1.11298"},{"key":"48_CR5","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10479-007-0170-8","volume":"153","author":"JF Cordeau","year":"2007","unstructured":"Cordeau, J.F., Laporte, G.: The dial-a-ride problem (DARP): models and algorithms. Ann. Oper. Res. 153, 29\u201346 (2007). https:\/\/doi.org\/10.1007\/s10479-007-0170-8","journal-title":"Ann. Oper. Res."},{"key":"48_CR6","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manage. Sci. 6, 80\u201391 (1959). https:\/\/doi.org\/10.1287\/mnsc.6.1.80","journal-title":"Manage. Sci."},{"key":"48_CR7","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.: Adaptive large neighborhood search with a constant-time feasibility test for the dial-a-ride problem. Transp. Sci. 53, 480\u2013491 (2019). https:\/\/doi.org\/10.1287\/trsc.2018.0837","journal-title":"Transp. Sci."},{"issue":"1","key":"48_CR8","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.ejor.2014.03.003","volume":"238","author":"B Li","year":"2014","unstructured":"Li, B., Krushinsky, D., Reijers, H.A., Woensel, T.V.: The share-a-ride problem: people and parcels sharing taxis. Eur. J. Oper. Res. 238(1), 31\u201340 (2014). https:\/\/doi.org\/10.1016\/j.ejor.2014.03.003","journal-title":"Eur. J. Oper. Res."},{"issue":"8","key":"48_CR9","doi-asserted-by":"publisher","first-page":"4665","DOI":"10.1287\/mnsc.2020.3721","volume":"67","author":"M Liu","year":"2021","unstructured":"Liu, M., Brynjolfsson, E., Dowlatabadi, J.: Do digital platforms reduce moral hazard? The case of uber and taxis. Manage. Sci. 67(8), 4665\u20134685 (2021). https:\/\/doi.org\/10.1287\/mnsc.2020.3721","journal-title":"Manage. Sci."},{"issue":"2","key":"48_CR10","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1287\/trsc.2017.0744","volume":"52","author":"P Matl","year":"2018","unstructured":"Matl, P., Hartl, R.F., Vidal, T.: Workload equity in vehicle routing problems: a survey and analysis. Transp Sci. 52(2), 239\u2013260 (2018). https:\/\/doi.org\/10.1287\/trsc.2017.0744","journal-title":"Transp Sci."},{"issue":"6","key":"48_CR11","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.: Minimizing customers\u2019 waiting time in a vehicle routing problem with unit demands. J. Comput. Syst. Sci. Int. 54(6), 866\u2013881 (2015). https:\/\/doi.org\/10.1134\/S1064230715040024","journal-title":"J. Comput. Syst. Sci. Int."},{"issue":"3","key":"48_CR12","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.: Measuring quality of service in dial-a-ride operations: the case of a Canadian city. Transportation 39(3), 539\u2013564 (2012). https:\/\/doi.org\/10.1007\/s11116-011-9375-4","journal-title":"Transportation"},{"key":"48_CR13","doi-asserted-by":"publisher","unstructured":"Pareto, V.: Cours d\u2019\u00e9conomie politique. \u0152uvres compl\u00e8tes publi\u00e9es sous la direction de giovanni busino. tomes 1 et 2 en un volume (1897). https:\/\/doi.org\/10.3917\/droz.paret.1964.01, 9782600040143","DOI":"10.3917\/droz.paret.1964.01"},{"key":"48_CR14","unstructured":"Santos, D.O., Xavier, E.C.: Dynamic taxi and ridesharing: a framework and heuristics for the optimization problem. In: Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence IJCAI 2013, pp. 2885\u20132891. AAAI Press (2013). https:\/\/dl.acm.org\/doi\/10.5555\/2540128.2540544"},{"issue":"2","key":"48_CR15","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.: A concise guide to existing and emerging vehicle routing problem variants. Eur. J. Oper. Res. 286(2), 401\u2013416 (2020). https:\/\/doi.org\/10.1016\/j.ejor.2019.10.010","journal-title":"Eur. J. Oper. Res."},{"key":"48_CR16","unstructured":"Zhang, M.: Mechanism design in facility location games. In: Proceedings of the 20th International AAMAS Conference, pp. 1850\u20131852. AAMAS 2021, International Foundation for Autonomous Agents and Multiagent Systems, Richland, SC (2021). https:\/\/dl.acm.org\/doi\/10.5555\/3463952.3464262"}],"updated-by":[{"DOI":"10.1007\/978-3-031-22695-3_57","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2023,1,22]],"date-time":"2023-01-22T00:00:00Z","timestamp":1674345600000}}],"container-title":["Lecture Notes in Computer Science","AI 2022: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22695-3_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T11:31:00Z","timestamp":1710243060000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22695-3_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031226946","9783031226953"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22695-3_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"3 December 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"22 January 2023","order":2,"name":"change_date","label":"Change Date","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Correction","order":3,"name":"change_type","label":"Change Type","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"In the originally published version of chapter 48, Table 1 and the equation on page 696 contained errors. This has been corrected.","order":4,"name":"change_details","label":"Change Details","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australasian Joint Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Perth, WA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","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":"5 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"35","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ausai2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ajcai2022.org\/","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":"90","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":"56","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":"62% - 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)"}}]}}