Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/287057 
Year of Publication: 
2021
Citation: 
[Journal:] Transportation [ISSN:] 1572-9435 [Volume:] 49 [Issue:] 4 [Publisher:] Springer US [Place:] New York, NY [Year:] 2021 [Pages:] 1133-1155
Publisher: 
Springer US, New York, NY
Abstract: 
The planning of on-demand services requires the formation of vehicle schedules consisting of service trips and empty trips. This paper presents an algorithm for building vehicle schedules that uses time-dependent demand matrices (= service trips) as input and determines time-dependent empty trip matrices and the number of required vehicles as a result. The presented approach is intended for long-term, strategic transport planning. For this purpose, it provides planners with an estimate of vehicle fleet size and distance travelled by on-demand services. The algorithm can be applied to integer and non-integer demand matrices and is therefore particularly suitable for macroscopic travel demand models. Two case studies illustrate potential applications of the algorithm and feature that on-demand services can be considered in macroscopic travel demand models.
Subjects: 
Vehicle scheduling
Macroscopic travel demand models
Automated vehicles
Carsharing
Ridesharing
On-demand service
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by Logo
Document Type: 
Article
Document Version: 
Published Version

Files in This Item:
File
Size





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