The Vehicle Routing Problem with Conflicts
Résumé
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.