Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/325197 
Year of Publication: 
2024
Citation: 
[Journal:] EURO Journal on Transportation and Logistics (EJTL) [ISSN:] 2192-4384 [Volume:] 13 [Issue:] 1 [Article No.:] 100134 [Year:] 2024 [Pages:] 1-13
Publisher: 
Elsevier, Amsterdam
Abstract: 
Ride-sharing systems strive to provide affordable on-demand mobility in urban areas by effectively consolidating incoming transportation requests. To ensure that transportation offers meet travelers' individual time requirements and constraints, service operators offer multiple pickup times from which travelers can choose. Designing such pickup time offers is challenging due to the uncertainty of both the requirements of the requesting traveler and the efficient fulfillment of future demand. We propose a parametric cost function approximation to balance between maximizing the probability that a traveler will choose an offered pickup time and minimizing the expected vehicle routing effort. We demonstrate the effectiveness of the proposed approach in a comprehensive computational study and provide managerial insights, particularly with respect to the value of information on traveler pickup time requirements.
Subjects: 
Demand management
Ride-sharing
Stochastic dynamic decision making
Vehicle routing
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by-nc-nd Logo
Document Type: 
Article

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.