This paper studies a set of rich vehicle routing problems incorporating various complexities found in real-life applications. The rich vehicle routing problem considers simultaneously four multiple constraints: multiple depots, multiple time windows, multiple trips, and multiple vehicle types. A metaheuristic algorithm called the general vehicle routing algorithm, based on the skewed variable neighborhood search, was designed to address the problem of any combination on five features. A slice of operators and heuristic approaches developed for the specific constraints is embedded in the general vehicle routing algorithm. Six combination vehicle routing problem types were investigated. The computational results demonstrated that the proposed algorithm is competitive for both benchmark instances and generated instances in accuracy of solution and computational time.
General Metaheuristic Algorithm for a Set of Rich Vehicle Routing Problems
Transportation Research Record
Transportation Research Record: Journal of the Transportation Research Board ; 2548 , 1 ; 97-106
2016-01-01
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
A flexible metaheuristic framework for solving rich vehicle routing problems
Tema Archiv | 2011
|Ant Metaheuristic with Adapted Personalities for the Vehicle Routing Problem
British Library Conference Proceedings | 2015
|