Feasibility algorithms for two pickup and delivery problems with transfers - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

Feasibility algorithms for two pickup and delivery problems with transfers

Renaud Masson
  • Fonction : Auteur
  • PersonId : 891708
Olivier Péton

Résumé

This presentation follows the PhD thesis of Renaud Masson [1] on the Pickup and Delivery Problem with Transfers (PDPT). The motivating application is a dial-a-ride problem in which a passenger may be transferred from the vehicle that picked him/her up to another vehicle at some predetermined location, called transfer point. Both the PDPT and the Dial-A-Ride Problem with Transfers (DARPT) were investigated. An adaptive large neighborhood search has been developed to solve the PDPT [2] and also adapted to the DARPT [3]. In both algorithms, multiple insertions of requests in routes are tested. E ciently evaluating their feasibility with respect to the temporal constraints of the problem is a key issue.
Fichier principal
Vignette du fichier
lehuede-masson-peton-Synchrotrans2013.pdf (109.2 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-00801187 , version 1 (15-03-2013)

Identifiants

  • HAL Id : hal-00801187 , version 1

Citer

Fabien Lehuédé, Renaud Masson, Olivier Péton. Feasibility algorithms for two pickup and delivery problems with transfers. 1st International Workshop on Synchronisation in Transport, SynchroTrans 2013, May 2013, Mainz, Germany, France. ⟨hal-00801187⟩
264 Consultations
235 Téléchargements

Partager

Gmail Facebook X LinkedIn More