A shift scheduling model for ridepooling services
Publication date
2024-08-21
Document type
Forschungsartikel
Author
Organisational unit
Scopus ID
Publisher
Springer Science and Business Media
Series or journal
OR Spectrum
ISSN
Periodical volume
47
Periodical issue
2
First page
349
Last page
373
Peer-reviewed
✅
Part of the university bibliography
✅
Language
English
Keyword
Mixed-integer programming
On-demand transportation
Ridepooling
Shift planning
Abstract
The planning of efficient shift schedules is a key challenge for many service companies whose economic success heavily relies on the efficient employment of personnel. In spite of the recent advances in autonomous driving, mobility services, such as ride pooling, still heavily rely on the use of human drivers and will presumably remain in this category in the near to midterm. As a consequence, shift scheduling of drivers is one of the key success factors in the current industry environment. Determining appropriate shifts that minimize an under- and oversupply of vehicles for all planning periods is a challenging task, since demand can vary heavily over time and the assignment flexibilities are limited due to driver preferences and regulations. In this work, we present a shift scheduling model for ridepooling services. Moreover, we introduce a data generator for instances with realistic properties of a ridepooling service. Using it, we study the effect of different kinds of flexibilities on solution quality.
Description
This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
Version
Published version
Access right on openHSU
Metadata only access
Open Access Funding
Springer Nature (DEAL)