Metaheuristics for the risk-constrained cash-in-transit vehicle routing problem
AbstractThis paper proposes a variant of the well-known capacitated vehicle routing problem that models the problem of routing vehicles in the cash-in-transit industry by introducing a risk constraint. In this problem, which is called the risk-constrained cash-in-transit vehicle routing problem (rctvrp), the risk associated with a robbery, 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 certain risk threshold. A library containing three sets of instances for the rctvrp, some with known optimal solution, is generated based on VRP instances from the literature. A mathematical formulation is developed and small instances of the problem are solved using ibm cplex. Four constructive heuristics as well as a local search block composed of six different local search operators are developed and combined using two different metaheuristic structures: a multi-start structure and a perturb-and-improve structure. In a statistical experiment, the best parameter settings for each component are determined, and the resulting heuristic con gurations are compared in their best possible setting. The resulting methods are able to obtain solutions of excellent quality in very limited computing times.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by University of Antwerp, Faculty of Applied Economics in its series Working Papers with number 2013005.
Length: 30 pages
Date of creation: Mar 2013
Date of revision:
Contact details of provider:
Postal: Prinsstraat 13, B-2000 Antwerpen
Web page: https://www.uantwerp.be/en/faculties/applied-economic-sciences/
More information through EDIRC
Metaheuristics; Vehicle routing; Risk constraint; Security; Cash-in-transit; Combinatorial optimization;
This paper has been announced in the following NEP Reports:
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Helsgaun, Keld, 2000. "An effective implementation of the Lin-Kernighan traveling salesman heuristic," European Journal of Operational Research, Elsevier, Elsevier, vol. 126(1), pages 106-130, October.
- TALARICO, Luca & SÖRENSEN, Kenneth & SPRINGAEL, Johan, 2013. "The risk constrained cash-in-transit vehicle routing problem with time windows," Working Papers 2013012, University of Antwerp, Faculty of Applied Economics.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Joeri Nys).
If references are entirely missing, you can add them using this form.