Publication
Title
Metaheuristics for the risk-constrained cash-in-transit vehicle routing problem
Author
Abstract
This paper proposes a variant of the well-known capacitated vehicle routing problem that models the routing of vehicles in the cash-in-transit industry by introducing a risk constraint. In the Risk-constrained Cash-in-Transit Vehicle Routing Problem (RCTVRP), the risk of being robbed, which is assumed to be proportional both to the amount of cash being carried and the time or the distance covered by the vehicle carrying the cash, is limited by a risk threshold. A library containing two sets of instances for the RCTVRP, some with known optimal solution, is generated. A mathematical formulation is developed and small instances of the problem are solved by using IBM CPLEX. Four constructive heuristics as well as a local search block composed of six local search operators are developed and combined using two different metaheuristic structures: a multistart heuristic and a perturb-and-improve structure. In a statistical experiment, the best parameter settings for each component are determined, and the resulting heuristic configurations are compared in their best possible setting. The resulting metaheuristics are able to obtain solutions of excellent quality in very limited computing times. Keywords Metaheuristics; Vehicle routing; Risk management; Cash-in-transit; Combinatorial optimization
Language
English
Source (journal)
European journal of operational research. - Amsterdam
Publication
Amsterdam : 2015
ISSN
0377-2217
DOI
10.1016/J.EJOR.2015.01.040
Volume/pages
244 :2 (2015) , p. 457-470
ISI
000352331300010
Full text (Publisher's DOI)
Full text (open access)
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
Identifier
Creation 27.04.2015
Last edited 09.10.2023
To cite this reference