IDEAS home Printed from
MyIDEAS: Log in (now much improved!) to save this paper

Metaheuristics for the risk-constrained cash-in-transit vehicle routing problem

Listed author(s):
  • TALARICO, Luca
  • SÖRENSEN, Kenneth
  • SPRINGAEL, Johan
Registered author(s):

    This 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 configurations are compared in their best possible setting. The resulting methods are able to obtain solutions of excellent quality in very limited computing times.

    If 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.

    File URL:
    Download Restriction: no

    Paper provided by University of Antwerp, Faculty of Applied Economics in its series Working Papers with number 2013005.

    in new window

    Length: 30 pages
    Date of creation: Mar 2013
    Handle: RePEc:ant:wpaper:2013005
    Contact details of provider: Postal:
    Prinsstraat 13, B-2000 Antwerpen

    Web page:

    More information through EDIRC

    References listed on IDEAS
    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.:

    in new window

    1. Helsgaun, Keld, 2000. "An effective implementation of the Lin-Kernighan traveling salesman heuristic," European Journal of Operational Research, Elsevier, vol. 126(1), pages 106-130, October.
    Full references (including those not matched with items on IDEAS)

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    When requesting a correction, please mention this item's handle: RePEc:ant:wpaper:2013005. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Joeri Nys)

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.