Advertisement

OR Spectrum

pp 1–22 | Cite as

Route feasibility testing and forward time slack for the Synchronized Pickup and Delivery Problem

  • Timo GschwindEmail author
Regular Article
  • 22 Downloads

Abstract

The Synchronized Pickup and Delivery Problem (SPDP) consists of finding a set of minimum-cost routes servicing user-specified transportation requests from pickup to delivery locations subject to pairing and precedence, capacity, time-window, and minimum and maximum time-lag constraints. The temporal constraints of the SPDP impose a complex scheduling problem for the service times at the customer locations which makes the efficient feasibility checking of routes intricate. We present different route feasibility tests for the SPDP and compare their practical runtime on a huge number of randomly generated routes. Furthermore, we generalize to the SPDP the concept of forward time slack, which has proven a versatile tool for feasibility testing of customer or request insertions into a given (feasible) route for many VRP variants.

Keywords

Vehicle routing Temporal synchronization Feasibility testing Forward time slack 

Notes

Acknowledgements

This research was partially funded by the Deutsche Forschungsgemeinschaft (DFG) under Grant No. IR 122/5-2.

Supplementary material

291_2018_544_MOESM1_ESM.pdf (127 kb)
Supplementary material 1 (pdf 126 KB)

References

  1. Barnhart C, Cohn AM, Johnson EL, Klabjan D, Nemhauser GL, Vance PH (2003) Airline crew scheduling. In: Hall RW (ed) Handbook of transportation science. Kluwer Academic Publishers, Norwell, pp 517–560CrossRefGoogle Scholar
  2. Bélanger N, Desaulniers G, Soumis F, Desrosiers J (2006) Periodic airline fleet assignment with time windows, spacing constraints, and time dependent revenues. Eur J Oper Res 175(3):1754–1766CrossRefGoogle Scholar
  3. Braekers K, Caris A, Janssens GK (2014) Exact and meta-heuristic approach for a general heterogeneous dial-a-ride problem with multiple depots. Transp Res Part B 67:166–186CrossRefGoogle Scholar
  4. Bredström D, Rönnqvist M (2008) Combined vehicle routing and scheduling with temporal precedence and synchronization constraints. Eur J Oper Res 191:19–29CrossRefGoogle Scholar
  5. Cherkassky BV, Georgiadis L, Goldberg AV, Tarjan RE, Werneck RF (2009) Shortest-path feasibility algorithms. J Exp Algorithmics 14:2.7–2.37CrossRefGoogle Scholar
  6. Cordeau JF, Laporte G (2003) A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transp Res Part B 37(6):579–594CrossRefGoogle Scholar
  7. Cordeau JF, Laporte G (2007) The dial-a-ride problem: models and algorithms. Ann Oper Res 153(1):29–46CrossRefGoogle Scholar
  8. Cormen TH, Leiserson CE, Rivest RL, Stein C (2001) Introduction to algorithms. MIT Press, CambridgeGoogle Scholar
  9. Eveborn P, Flisberg P, Rönnqvist M (2006) Laps care—an operational system for staff planning of home care. Eur J Oper Res 171(3):962–976CrossRefGoogle Scholar
  10. Firat M, Woeginger GJ (2011) Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh. Oper Res Lett 39(1):32–35CrossRefGoogle Scholar
  11. Gschwind T (2015) A comparison of column-generation approaches to the synchronized pickup and delivery problem. Eur J Oper Res 247(1):60–71CrossRefGoogle Scholar
  12. Gschwind T, Irnich S (2015) Effective handling of dynamic time windows and its application to solving the dial-a-ride problem. Transp Sci 49(2):335–354CrossRefGoogle Scholar
  13. Kovacs AA, Golden BL, Hartl RF, Parragh SN (2014) Vehicle routing problems in which consistency considerations are important: a survey. Networks 64(3):192–213CrossRefGoogle Scholar
  14. Lu Q, Dessouky MM (2006) A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows. Eur J Oper Res 175(2):672–687CrossRefGoogle Scholar
  15. Masson R, Lehuédé F, Péton O (2013) Efficient feasibility testing for request insertion in the pickup and delivery problem with transfers. Oper Res Lett 41(3):211–215CrossRefGoogle Scholar
  16. Masson R, Lehuédé F, Péton O (2014) The dial-a-ride problem with transfers. Comput Oper Res 41:12–23CrossRefGoogle Scholar
  17. Pillac V, Guéret C, Medaglia AL (2012) A parallel matheuristic for the technician routing and scheduling problem. Optim Lett 7(7):1525–1535CrossRefGoogle Scholar
  18. Rasmussen MS, Justesen T, Dohn A, Larsen J (2012) The home care crew scheduling problem: preference-based visit clustering and temporal dependencies. Eur J Oper Res 219(3):598–610CrossRefGoogle Scholar
  19. Savelsbergh MWP (1992) The vehicle routing problem with time windows: minimizing route duration. INFORMS J Comput 4(2):146–154CrossRefGoogle Scholar
  20. Tang J, Kong Y, Lau H, Ip AWH (2010) A note on “efficient feasibility testing for dial-a-ride problems”. Oper Res Lett 38(5):405–407CrossRefGoogle Scholar
  21. Tarjan RE (1981) Shortest paths. Technical report, AT&T Bell Laboratories, Murray Hill, NJGoogle Scholar

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Chair of Logistics Management, Gutenberg School of Management and EconomicsJohannes Gutenberg University MainzMainzGermany

Personalised recommendations