The dial-a-ride problem with transfers

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

Cited literature [36 references]  Display  Hide  Download
Contributor : Olivier Péton <>
Submitted on : Monday, April 29, 2013 - 11:18:35 AM
Last modification on : Wednesday, December 19, 2018 - 3:02:03 PM
Long-term archiving on : Tuesday, July 30, 2013 - 5:00:20 AM


Files produced by the author(s)


  • HAL Id : hal-00818800, version 1


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



Record views


Files downloads