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

Eric Angel (), Evripidis Bampis () and Fanny Pascual ()
Additional contact information
Eric Angel: Université d’Évry Val d’Essonne
Evripidis Bampis: Université d’Évry Val d’Essonne
Fanny Pascual: Université d’Évry Val d’Essonne

Journal of Combinatorial Optimization, 2008, vol. 15, issue 2, No 4, 179-190

Abstract: 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 $\mathcal{NP}$ -hard problem.

Keywords: Local search; Exponential neighborhood; Vehicle routing problem; Matching (search for similar items in EconPapers)
Date: 2008
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-007-9075-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:15:y:2008:i:2:d:10.1007_s10878-007-9075-3

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-007-9075-3

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().