|
Title
|
|
|
|
The **k**-dissimilar vehicle routing problem
|
|
|
Author
|
|
|
|
|
|
|
Abstract
|
|
|
|
| In this paper we define a new problem, the aim of which is to find a set of k dissimilar alternative solutions for a vehicle routing problem (VRP) on a single instance. This problem has several practical applications in the cash-in-transit sector and in the transportation of hazardous materials. A min-max mathematical formulation is developed that minimizes the objective function value of the worst solution. A distance measure is defined based on the edges shared between pairs of alternative solutions. An iterative heuristic algorithm to generate k dissimilar alternative solutions is also presented. The solution approach is tested using large and medium size benchmark instances for the capacitated vehicle routing problem. |
|
|
|
Language
|
|
|
|
English
|
|
|
Source (series)
|
|
|
|
Research paper / University of Antwerp, Faculty of Applied Economics ; 2013:029
|
|
|
Publication
|
|
|
|
Antwerp
:
University of Antwerp, Faculty of Applied Economics
,
2013
|
|
|
Volume/pages
|
|
|
|
24 p.
|
|
|
Full text (open access)
|
|
|
|
|
|