A tabu search algorithm for the Dial-a-Ride Problem with Transfers

Abstract : The Dial-a-Ride Problem (DARP) consists in determining and scheduling routes serviced by a set of vehicles in order to satisfy transportation requests from pickup points to delivery points. This paper introduces a variant of the DARP where the client can be transferred from one vehicle to another on specic points called \transfer points". Solving this variant of the DARP yields new algorithmic diculties. In this paper, we propose a tabu search algorithm for the Dial-a-Ride Problem with Transfers (DARPT) with a special emphasis on checking whether a modication of the current solution is feasible or not. The method is evaluated over generated and real instances.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00568880
Contributor : Olivier Péton <>
Submitted on : Wednesday, February 23, 2011 - 5:18:29 PM
Last modification on : Wednesday, December 19, 2018 - 3:02:04 PM

Identifiers

  • HAL Id : hal-00568880, version 1

Citation

Renaud Masson, Fabien Lehuédé, Olivier Péton. A tabu search algorithm for the Dial-a-Ride Problem with Transfers. International Conference on Industrial Engineering and Systems Management, May 2011, Metz, France. ⟨hal-00568880⟩

Share

Metrics

Record views

319