An exponential (matching based) neighborhood for the vehicle routing problem - Archive ouverte HAL Access content directly
Journal Articles Journal of Combinatorial Optimization Year : 2008

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

(1) , (1) , (2)
1
2

Abstract

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
Origin : Files produced by the author(s)

Dates and versions

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

Identifiers

Cite

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⟩
170 View
127 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More