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

Johann Hartleb; Markus Friedrich; Emely Richter

doi:10.1007/s11116-021-10205-4

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

Johann Hartleb^*
, Markus Friedrich
, Emely Richter

^*Corresponding author for this work

Department of Technology and Operations Management

University of Stuttgart

Research output: Contribution to journal › Article › Academic › peer-review

17 Citations (Scopus)

173 Downloads (Pure)

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.

Original language	English
Pages (from-to)	1133-1155
Number of pages	23
Journal	Transportation
Volume	49
Issue number	4
DOIs	https://doi.org/10.1007/s11116-021-10205-4
Publication status	Published - 2 Jul 2021

Bibliographical note

Funding Information:
This research was funded by Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) as part of the research group for integrated planning in public transport (DFG ).

Funding Information:
This research was funded by Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) as part of the research group for integrated planning in public transport (DFG 2020).

Publisher Copyright:
© 2021, The Author(s).

Access to Document

10.1007/s11116-021-10205-4

Hartleb2021_Article_VehicleSchedulingForOn-demandVFinal published version, 1.52 MB

Cite this

@article{4880c9f923e44df299856d9b1df3f785,

title = "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 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.",

author = "Johann Hartleb and Markus Friedrich and Emely Richter",

note = "Funding Information: This research was funded by Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) as part of the research group for integrated planning in public transport (DFG ). Funding Information: This research was funded by Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) as part of the research group for integrated planning in public transport (DFG 2020). Publisher Copyright: {\textcopyright} 2021, The Author(s).",

year = "2021",

month = jul,

day = "2",

doi = "10.1007/s11116-021-10205-4",

language = "English",

volume = "49",

pages = "1133--1155",

journal = "Transportation",

issn = "0049-4488",

publisher = "Springer",

number = "4",

}

TY - JOUR

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

AU - Hartleb, Johann

AU - Friedrich, Markus

AU - Richter, Emely

N1 - Funding Information: This research was funded by Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) as part of the research group for integrated planning in public transport (DFG ). Funding Information: This research was funded by Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) as part of the research group for integrated planning in public transport (DFG 2020). Publisher Copyright: © 2021, The Author(s).

PY - 2021/7/2

Y1 - 2021/7/2

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/85109268404

U2 - 10.1007/s11116-021-10205-4

DO - 10.1007/s11116-021-10205-4

M3 - Article

AN - SCOPUS:85109268404

SN - 0049-4488

VL - 49

SP - 1133

EP - 1155

JO - Transportation

JF - Transportation

IS - 4

ER -

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

Abstract

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this