2021
DOI: 10.1007/s11116-021-10205-4
|View full text |Cite
|
Sign up to set email alerts
|

Vehicle scheduling for on-demand vehicle fleets in macroscopic travel demand models

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 an… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
14
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 11 publications
(14 citation statements)
references
References 29 publications
(34 reference statements)
0
14
0
Order By: Relevance
“…Up-to-date information on actual demand is received by the system every 15 min and updates the system's functioning. Another research project used the adjusted four-step algorithm to solve the vehicle scheduling problem, aiming to minimize the number of serving vehicles for the on-demand transport services [16]. The authors propose to incorporate on-demand services into the macroscopic travel demand model, expanding the model by adding supplementary steps to the conventional four.…”
Section: Literature Reviewmentioning
confidence: 99%
See 1 more Smart Citation
“…Up-to-date information on actual demand is received by the system every 15 min and updates the system's functioning. Another research project used the adjusted four-step algorithm to solve the vehicle scheduling problem, aiming to minimize the number of serving vehicles for the on-demand transport services [16]. The authors propose to incorporate on-demand services into the macroscopic travel demand model, expanding the model by adding supplementary steps to the conventional four.…”
Section: Literature Reviewmentioning
confidence: 99%
“…ParameterValue Share of values below 10 veh./day (%)16.52 Share of values from 10 to 50 veh./day (%)23.64…”
mentioning
confidence: 99%
“…Fagnant and Kockelman (2018) extended agent-and network-based simulations to include dynamic ride-sharing in shared AVs and studied its role in reducing average service time and travel costs. Hartleb et al (2021) proposed efficient heuristics for a fleetsizing problem that serves demand estimated from a macroscopic model. Grahn et al (2021) proposed a heuristic-based approach for demand matching and vehicle routing to cater to on-demand FLM requests.…”
Section: Literature Reviewmentioning
confidence: 99%
“…This approach has been successfully implemented for regional modeling studies in the context of automated driving ( 9 , 10 ). Applying the scheduling algorithm by Hartleb et al ( 11 ), it is possible to determine relocation trips and fleet sizes.…”
Section: Introductionmentioning
confidence: 99%
“…Since the suppliers’ tours in this case solely depend on the demanders’ trips, the demander paths are matched with themselves following the previously described steps. Finally, fleet size and relocation trips of the ride-sharing vehicles are determined with the scheduling method described by Hartleb et al ( 11 ) and Richter et al ( 10 ). It is a heuristic approach at optimizing vehicle usage.…”
Section: Introductionmentioning
confidence: 99%