The k-dissimilar vehicle routing problem

Luca Talarico, Kenneth Sörensen and Johan Springael

Working Papers from University of Antwerp, Faculty of Business and Economics

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.

Keywords: Vehicle Routing Problem (VRP); Metaheuristic; Security; Similarity (search for similar items in EconPapers)
Pages: 26 pages
Date: 2013-12
New Economics Papers: this item is included in nep-cmp and nep-tre
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://repository.uantwerpen.be/docman/irua/fb78be/bfc1e562.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ant:wpaper:2013029

Access Statistics for this paper

More papers in Working Papers from University of Antwerp, Faculty of Business and Economics Contact information at EDIRC.
Bibliographic data for series maintained by Joeri Nys ().