An exponential (matching based) neighborhood for the vehicle routing problem - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Combinatorial Optimization Année : 2008

An exponential (matching based) neighborhood for the vehicle routing problem

Résumé

We introduce an exponential neighborhood for the Vehicle Routing Problem (vrp) with unit customers' demands, and we show that it can be explored efficiently in polynomial time by reducing its exploration to a particular case of the Restricted Complete Matching (rcm) problem that we prove to be polynomial time solvable using flow techniques. Furthermore, we show that in the general case with non-unit customers' demands the exploration of the neighborhood becomes an NP-hard problem.
Fichier principal
Vignette du fichier
ptv.pdf (285.6 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00341352 , version 1 (27-03-2014)

Identifiants

Citer

Eric Angel, Evripidis Bampis, Fanny Pascual. An exponential (matching based) neighborhood for the vehicle routing problem. Journal of Combinatorial Optimization, 2008, 15 (2), pp.179--190. ⟨10.1007/s10878-007-9075-3⟩. ⟨hal-00341352⟩
182 Consultations
138 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More