The Vehicle Routing Problem with Conflicts - Archive ouverte HAL Access content directly
Journal Articles IFAC Proceedings Volumes Year : 2011

The Vehicle Routing Problem with Conflicts

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

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.
Not file

Dates and versions

hal-02521862 , version 1 (27-03-2020)

Identifiers

Cite

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

Collections

CNRS UTT LOSI
7 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More