The dial-a-ride problem with transfers - Archive ouverte HAL Accéder directement au contenu
Rapport Année : 2012

The dial-a-ride problem with transfers

Résumé

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.
Fichier principal
Vignette du fichier
rapport_recherche_AUTO12-7.pdf (423.39 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00818800 , version 1 (29-04-2013)

Identifiants

  • HAL Id : hal-00818800 , version 1

Citer

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

Partager

Gmail Facebook X LinkedIn More