IDEAS home Printed from
   My bibliography  Save this paper

The risk constrained cash-in-transit vehicle routing problem with time windows


  • TALARICO, Luca
  • SÖRENSEN, Kenneth
  • SPRINGAEL, Johan


This paper proposes a variant of the Vehicle Routing Problem in which a particular kind of risk constraint has been introduced to model the problem of routing vehicles in the cash-in-transit industry and a hard time window constraint, with no waiting times, delimits the customer's visit within a specified time interval. Two metaheuristic algorithms have been developed to cope with medium and large instances of the problem. In a computational experiment, the best parameter settings for each algorithm are determined. The resulting metaheuristics are compared, in their best possible setting, solving some benchmark instances for the capacitated vehicle routing problem with time windows.

Suggested Citation

  • 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.
  • Handle: RePEc:ant:wpaper:2013012

    Download full text from publisher

    File URL:
    Download Restriction: no

    References listed on IDEAS

    1. Zografos, Konstantinos G. & Androutsopoulos, Konstantinos N., 2004. "A heuristic algorithm for solving hazardous materials distribution problems," European Journal of Operational Research, Elsevier, vol. 152(2), pages 507-519, January.
    2. G. B. Dantzig & J. H. Ramser, 1959. "The Truck Dispatching Problem," Management Science, INFORMS, vol. 6(1), pages 80-91, October.
    3. TALARICO, Luca & SÖRENSEN, Kenneth & SPRINGAEL, Johan, 2013. "Metaheuristics for the risk-constrained cash-in-transit vehicle routing problem," Working Papers 2013005, University of Antwerp, Faculty of Applied Economics.
    Full references (including those not matched with items on IDEAS)


    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.

    Cited by:

    1. Talarico, L. & Sörensen, K. & Springael, J., 2015. "The k-dissimilar vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 244(1), pages 129-140.

    More about this item


    Vehicle routing; Risk; Security; Cash-in-transit; Metaheuristic;

    NEP fields

    This paper has been announced in the following NEP Reports:


    Access and download statistics


    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ant:wpaper:2013012. 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). General contact details of provider: .

    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 CitEc recognized a reference but did not link an item in RePEc 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 RePEc Author Service 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.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.