Feasibility algorithms for two pickup and delivery problems with transfers

Fabien Lehuédé 1 Renaud Masson 1 Olivier Péton 1
1 SLP - Systèmes Logistiques et de Production
IRCCyN - Institut de Recherche en Communications et en Cybernétique de Nantes
Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [5 references]  Display  Hide  Download

Contributor : Fabien Lehuédé <>
Submitted on : Friday, March 15, 2013 - 11:17:47 AM
Last modification on : Wednesday, December 19, 2018 - 3:02:08 PM
Long-term archiving on : Sunday, June 16, 2013 - 5:30:09 AM


Publisher files allowed on an open archive


  • HAL Id : hal-00801187, version 1


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⟩



Record views


Files downloads