The dial-a-ride problem with transfers

Renaud Masson 1, * Fabien Lehuédé 1 Olivier Péton 1
* Corresponding author
1 SLP - Systèmes Logistiques et de Production
IRCCyN - Institut de Recherche en Communications et en Cybernétique de Nantes
Abstract : The Dial-A-Ride Problem with Transfers (DARPT) consists in defining a set of routes that satisfy transportation requests of users between a set of pickup points and a set of delivery points, in the presence of ride time constraints. Users may change vehicles during their trip. This change of vehicle, called a transfer, is made at specific locations called transfer points. Solving the DARPT involves modeling and algorithmic difficulties. In this paper we provide a solution method based on an Adaptive Large Neighborhood Search (ALNS) metaheuristic and explain how to check the feasibility of a request insertion. The method is evaluated on real-life and generated instances. Experiments show that savings due to transfers can be up to 8\% on real-life instances.
Document type :
Complete list of metadatas
Contributor : Fabien Lehuédé <>
Submitted on : Friday, October 26, 2012 - 2:35:48 PM
Last modification on : Wednesday, December 19, 2018 - 3:02:08 PM


  • HAL Id : hal-00745813, version 1


Renaud Masson, Fabien Lehuédé, Olivier Péton. The dial-a-ride problem with transfers. 2012. ⟨hal-00745813⟩



Record views