Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/286849 
Year of Publication: 
2021
Citation: 
[Journal:] OR Spectrum [ISSN:] 1436-6304 [Volume:] 44 [Issue:] 1 [Publisher:] Springer [Place:] Berlin, Heidelberg [Year:] 2021 [Pages:] 87-119
Publisher: 
Springer, Berlin, Heidelberg
Abstract: 
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.
Subjects: 
Demand responsive transport
Dial-a-ride
Adaptive large neighbourhood search
Dynamic programming
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by Logo
Document Type: 
Article
Document Version: 
Published Version

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.