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 :
Journal articles
Complete list of metadatas
Contributor : Fabien Lehuédé <>
Submitted on : Friday, September 6, 2013 - 2:02:48 PM
Last modification on : Wednesday, December 19, 2018 - 3:02:08 PM

Links full text



Renaud Masson, Fabien Lehuédé, Olivier Péton. The dial-a-ride problem with transfers. Computers and Operations Research, Elsevier, 2014, 41, pp.12-23. ⟨10.1016/j.cor.2013.07.020⟩. ⟨hal-00859053⟩



Record views