An Adaptive Large Neighborhood Search for the Pickup and Delivery Problem with Transfers - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

An Adaptive Large Neighborhood Search for the Pickup and Delivery Problem with Transfers

Résumé

The Pickup and Delivery Problem (PDP) consists in defining a set of routes that satisfy transportation requests between a set of pickup points and a set of delivery points. This paper addresses a variant of the PDP where requests can change vehicle during their trip. The transshipment is made at specific locations called "transfer points". The corresponding problem is called the Pickup and Delivery with Transfers (PDPT). Solving the PDPT leads to new modeling and algorithmic difficulties. We propose new heuristics capable of efficiently inserting requests through transfer points. These heuristics are embedded into an Adaptive Large Neighborhood Search. We evaluate the method on generated instances and apply it to the transportation of people with disabilities. On these real-life instances we show that the introduction of transfer points generally brings non-negligible improvements (up to 9%). Experiments on related instances from the literature show clearly that the method is competitive with existing method.
Fichier non déposé

Dates et versions

hal-00597066 , version 1 (31-05-2011)

Identifiants

  • HAL Id : hal-00597066 , version 1

Citer

Renaud Masson, Fabien Lehuédé, Olivier Péton. An Adaptive Large Neighborhood Search for the Pickup and Delivery Problem with Transfers. MIC 2011, Jul 2011, Udine, Italy. pp.S3-09-1. ⟨hal-00597066⟩
124 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More