Publication
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 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 minmax mathematical formulation is proposed which requires a maximum similarity threshold between VRP solutions, and the number k of dissimilar VRP solutions that need to be generated. An index to measure similarities between VRP solutions is defined based on the edges shared between pairs of alternative solutions. An iterative metaheuristic 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 Decision support systems; Combinatorial optimization; Metaheuristic; Logistics; Risk management
Language
English
Source (journal)
European journal of operational research. - Amsterdam
Publication
Amsterdam : 2015
ISSN
0377-2217
Volume/pages
244:1(2015), p. 129-140
ISI
000352667900013
Full text (Publisher's DOI)
Full text (open access)
The author-created version that incorporates referee comments and is the accepted for publication version Available from 01.04.2018
Full text (publisher's version - intranet only)
UAntwerpen
Faculty/Department
Research group
Publication type
Subject
Affiliation
Publications with a UAntwerp address
External links
Web of Science
Record
Identification
Creation 27.04.2015
Last edited 14.09.2017
To cite this reference