Skip to Main content Skip to Navigation
Journal articles

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

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.
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-00341352
Contributor : Frédéric Davesne Connect in order to contact the contributor
Submitted on : Thursday, March 27, 2014 - 9:49:19 AM
Last modification on : Monday, February 15, 2021 - 9:50:29 AM
Long-term archiving on: : Friday, June 27, 2014 - 10:35:33 AM

File

ptv.pdf
Files produced by the author(s)

Identifiers

Citation

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

Share

Metrics

Les métriques sont temporairement indisponibles