The vehicle routing problem 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 VRPC (Vehicle Routing Problem with Conicts). This study presents a mathematical model, heuristics, metaheuristics (an iterated local search) and a greedy randomized adaptive search procedure - evolutionary local search. A lower bound is also introduced in this article.
The vehicle routing problem with conflicts
2011
6 Seiten, 4 Tabellen, 19 Quellen
Aufsatz (Konferenz)
Datenträger
Englisch
Transportation Research Record | 2013
|Stochastic Vehicle Routing Problem with Restocking
Online Contents | 2000
|SLUB | 2002
|Vehicle routing problem with steep roads
Elsevier | 2021
|