IDEAS home Printed from
   My bibliography  Save this paper

The Value of Inaccurate Advance Time Window Information in a Pick-up and Delivery Problem


  • Srour, F.J.
  • Agatz, N.A.H.
  • Oppen, J.


We examine different routing strategies to cope with inaccurate time window in- formation in the context of a dynamic pick-up and delivery problem with time windows. Our experiments show that advance information, even if inaccurate, can provide benefits from a planning perspective. We propose a novel stochastic strategy that consistently performs well compared to several benchmark strategies.

Suggested Citation

  • Srour, F.J. & Agatz, N.A.H. & Oppen, J., 2014. "The Value of Inaccurate Advance Time Window Information in a Pick-up and Delivery Problem," ERIM Report Series Research in Management ERS-2014-002-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
  • Handle: RePEc:ems:eureri:50394

    Download full text from publisher

    File URL:
    Download Restriction: no

    References listed on IDEAS

    1. Tjokroamidjojo, Darsono & Kutanoglu, Erhan & Taylor, G. Don, 2006. "Quantifying the value of advance load information in truckload trucking," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 42(4), pages 340-357, July.
    2. Soumia Ichoua & Michel Gendreau & Jean-Yves Potvin, 2006. "Exploiting Knowledge About Future Demands for Real-Time Vehicle Dispatching," Transportation Science, INFORMS, vol. 40(2), pages 211-225, May.
    3. Barrett W. Thomas & Chelsea C. White, 2004. "Anticipatory Route Selection," Transportation Science, INFORMS, vol. 38(4), pages 473-487, November.
    4. Mitrovic-Minic, Snezana & Krishnamurti, Ramesh & Laporte, Gilbert, 2004. "Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 38(8), pages 669-685, September.
    5. Gianpaolo Ghiani & Emanuele Manni & Barrett W. Thomas, 2012. "A Comparison of Anticipatory Algorithms for the Dynamic and Stochastic Traveling Salesman Problem," Transportation Science, INFORMS, vol. 46(3), pages 374-387, August.
    6. Ghiani, Gianpaolo & Guerriero, Francesca & Laporte, Gilbert & Musmanno, Roberto, 2003. "Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies," European Journal of Operational Research, Elsevier, vol. 151(1), pages 1-11, November.
    Full references (including those not matched with items on IDEAS)

    More about this item


    routing; value of information; dynamic pick-up and delivery problem with time windows; multiple scenario analysis;

    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:ems:eureri:50394. 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: (RePub). 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.