An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization

Artikel

The paper investigates the static dial-a-ride problem with ride and waiting time minimization. This is a new problem setting of significant practical relevance because several ride-sharing providers launched in recent years in large European 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 present an adaptive large neighbourhood search (ALNS) as well as a dynamic programming algorithm (DP), which are tested in comprehensive computational studies. Although the DP can only be used for a single tour and, due to the computational effort, as a restricted version or for small instances, the ALNS also works efficiently for larger instances. The results indicate that ride-sharing proposals may help to solve the trade-off between individual transport, profitability of the provider, and reduction of traffic and pollution.

Object Details

• Language: Englisch

References and Relationships

• Bibliographic citation: Journal: OR Spectrum ; ISSN: 1436-6304 ; Volume: 44 ; Year: 2021 ; Issue: 1 ; Pages: 87-119 ; Berlin, Heidelberg: Springer

Classification and Topics

• Classification: Management
• Subject: Demand responsive transport ; Dial-a-ride ; Adaptive large neighbourhood search ; Dynamic programming

Contributors, Places and Time

• Event: Geistige Schöpfung
• (who): Pfeiffer, Christian ; Schulz, Arne
• Event: Veröffentlichung
• (who): Springer
• (where): Berlin, Heidelberg
• (when): 2021

Further information

• DOI: doi:10.1007/s00291-021-00656-7
• Last update: 10.03.2025, 11:41 AM CET