A new lower bound for the static dial-a-ride problem with ride and waiting time minimization
Publication date
2022-05-05
Document type
Konferenzbeitrag
Author
Pfeiffer, Christian
Organisational unit
Institute of Operations Management, University of Hamburg
Scopus ID
Conference
8th International Conference on Dynamics in Logistics (LDIC 2022) ; Bremen, Germany ; February 23-25, 2022
Publisher
Springer International Publishing
Series or journal
Lecture Notes in Logistics
Book title
Dynamics in Logistics : Proceedings of the 8th International Conference LDIC 2022, Bremen, Germany
First page
231
Last page
243
Is supplemented by
Peer-reviewed
✅
Part of the university bibliography
Nein
Language
English
Keyword
Branch-and-bound
Demand responsive transport
Dial-a-ride
Lower bound
Abstract
The paper focuses on the static dial-a-ride problem with ride and waiting time minimization. This is an important problem setting of significant practical relevance, as several ridesharing providers launched in recent years in large cities. In contrast to the standard dial-a-ride problem, these providers focus on the general public. Therefore, they are amongst others in competition with taxis and private cars, which makes a more customer-oriented objective necessary. We minimize the sum of relative detours of all customers. The paper introduces upper bounds for the arrival times and an initial lower bound for the objective value. Our approach is tested in a computational study with realistic test instances.
Version
Published version
Access right on openHSU
Metadata only access