Skip to Main content Skip to Navigation
Journal articles

The Vehicle Routing Problem with Conflicts

Abstract : The Vehicle Routing Problem (VRP) is a classical problem for which several exact and approximation methods were proposed. In real life applications, such as in Hazardous Material transportation, transported items may be incompatible. This paper summarizes the first methods developed for this extension called the Vehicle Routing Problem with Conflicts (VRPC). This study presents a mathematical model, heuristics, metaheuristics (an Iterated Local Search (ILS) and a Greedy Randomized Adaptive Search Procedure – Evolutionary Local Search (GRASP-ELS)). A lower bound is also introduced in this article.
Document type :
Journal articles
Complete list of metadata

https://hal-utt.archives-ouvertes.fr/hal-02521862
Contributor : Daniel Gavrysiak Connect in order to contact the contributor
Submitted on : Friday, March 27, 2020 - 4:26:23 PM
Last modification on : Friday, August 27, 2021 - 3:14:08 PM

Identifiers

Collections

UTT | CNRS

Citation

Khaoula Hamdi-Dhaoui, Nacima Labadie, Alice Yalaoui. The Vehicle Routing Problem with Conflicts. IFAC Proceedings Volumes, Elsevier, 2011, 44 (1), pp.9799-9804. ⟨10.3182/20110828-6-IT-1002.01565⟩. ⟨hal-02521862⟩

Share

Metrics

Record views

356