Dynamic Pickup and Delivery with Transfers

  • Panagiotis Bouros
  • Dimitris Sacharidis
  • Theodore Dalamagas
  • Timos Sellis
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6849)


In the dynamic Pickup and Delivery Problem with Transfers (dPDPT), a set of transportation requests that arrive at arbitrary times must be assigned to a fleet of vehicles. We use two cost metrics that capture both the company’s and the customer’s viewpoints regarding the quality of an assignment. In most related problems, the rule of thumb is to apply a two-phase local search algorithm to heuristically determine a good requests-to-vehicles assignment. This work proposes a novel solution based on a graph-based formulation of the problem that treats each request independently. Briefly, in this conceptual graph, the goal is to find a shortest path from a node representing the pickup location to that of the delivery location. However, we show that efficient Bellman-Ford or Dijkstra-like algorithms cannot be applied. Still, our method is able to find dPDPT solutions significantly faster than a conventional two-phase local search algorithm, while the quality of the solution is only marginally lower.


Pickup and delivery problem dynamic shortest path 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Agrawal, R., Jagadish, H.V.: Materialization and incremental update of path information. In: ICDE, pp. 374–383 (1989)Google Scholar
  2. 2.
    Bent, R., Hentenryck, P.V.: A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows. Computers and Operations Research 33(4), 875–893 (2006)CrossRefzbMATHGoogle Scholar
  3. 3.
    Berbeglia, G., Cordeau, J.F., Laporte, G.: Dynamic pickup and delivery problems. European Journal of Operational Research 202(1), 8–15 (2010)CrossRefzbMATHGoogle Scholar
  4. 4.
    Berbeglia, G., Cordeau, J.F., Gribkovskaia, I., Laporte, G.: Static pickup and delivery problems: a classification scheme and survey. TOP 15, 1–31 (2007)CrossRefzbMATHGoogle Scholar
  5. 5.
    Carraway, R.L., Morin, T.L., Moskowitz, H.: Generalized dynamic programming for multicriteria optimization. European Journal of Operational Research 44(1), 95–104 (1990)CrossRefzbMATHGoogle Scholar
  6. 6.
    Cheng, J., Yu, J.X.: On-line exact shortest distance query processing. In: EDBT, pp. 481–492 (2009)Google Scholar
  7. 7.
    Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. In: SODA, pp. 937–946 (2002)Google Scholar
  8. 8.
    Cooke, K.L., Halsey, E.: The shortest route through a network with time-dependent internodal transit times. Journal of Mathematical Analysis and Applications 14(3), 493–498 (1966)CrossRefzbMATHGoogle Scholar
  9. 9.
    Cordeau, J.F., Laporte, G., Ropke, S.: Recent Models and Algorithms for One-to-One Pickup and Delivery Problems. In: Vehicle Routing: Latest Advances and Challenges, pp. 327–357. Kluwer, Dordrecht (2008)CrossRefGoogle Scholar
  10. 10.
    Cordeau, J.F.: A branch-and-cut algorithm for the dial-a-ride problem. Operations Research 54(3), 573–586 (2006)CrossRefzbMATHGoogle Scholar
  11. 11.
    Cortés, C.E., Matamala, M., Contardo, C.: The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method. European Journal of Operational Research 200(3), 711–724 (2010)CrossRefzbMATHGoogle Scholar
  12. 12.
    Ding, B., Yu, J.X., Qin, L.: Finding time-dependent shortest paths over large graphs. In: EDBT, pp. 205–216 (2008)Google Scholar
  13. 13.
    Dreyfus, S.E.: An appraisal of some shortest-path algorithms. Operations Research 17(3) (1969)Google Scholar
  14. 14.
    Dumas, Y., Desrosiers, J., Soumis, F.: The pickup and delivery problem with time windows. European Journal of Operational Research 54(1), 7–22 (1991)CrossRefzbMATHGoogle Scholar
  15. 15.
    Gendreau, M., Guertin, F., Potvin, J.Y., Séguin, R.: Neighbourhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries. Transportation Research Part C: Emerging Technologies 14(3), 157–174 (2006)CrossRefGoogle Scholar
  16. 16.
    Goldberg, A.V., Harrelson, C.: Computing the shortest path: A search meets graph theory. In: SODA 2005: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, pp. 156–165 (2005)Google Scholar
  17. 17.
    Goldberg, A.V., Kaplan, H., Werneck, R.F.: Reach for A*: Efficient point-to-point shortest path algorithms. In: Proc. of the 8th WS on Algorithm Engineering and Experiments (ALENEX), pp. 129–143. SIAM, Philadelphia (2006)Google Scholar
  18. 18.
    Granat, J., Guerriero, F.: The interactive analysis of the multicriteria shortest path problem by the reference point method. European Journal of Operational Research 151(1), 103–118 (2003)CrossRefzbMATHGoogle Scholar
  19. 19.
    Guerriero, F., Musmanno, R.: Label correcting methods to solve multicriteria shortest path problems. Journal of Optimization Theory and Applications 111(3), 589–613 (2001)CrossRefzbMATHGoogle Scholar
  20. 20.
    Jing, N., Huang, Y.W., Rundensteiner, E.A.: Hierarchical encoded path views for path query processing: An optimal model and its performance evaluation. In: TKDE, vol. 10(3), pp. 409–432 (1998)Google Scholar
  21. 21.
    Jung, S., Pramanik, S.: An efficient path computation model for hierarchically structured topographical road maps. In: TKDE, vol. 14(5), pp. 1029–1046 (2002)Google Scholar
  22. 22.
    Kriegel, H.P., Renz, M., Schubert, M.: Route skyline queries: A multi-preference path planning approach. In: ICDE, pp. 261–272 (2010)Google Scholar
  23. 23.
    Li, H., Lim, A.: A metaheuristic for the pickup and delivery problem with time windows. In: ICTAI, pp. 333–340 (2001)Google Scholar
  24. 24.
    Mitrović-Minić, S., Krishnamurti, R., Laporte, G.: Double-horizon based heuristics for the dynamic pickup and delivery problem. Transportation Research Part B: Methodological 38(7), 669–685 (2004)CrossRefGoogle Scholar
  25. 25.
    Mitrović-Minić, S., Laporte, G.: Waiting strategies for the dynamic pickup and delivery problem with time windows. Transportation Research Part B: Methodological 38(7), 635–655 (2004)CrossRefGoogle Scholar
  26. 26.
    Mitrović-Minić, S., Laporte, G.: The pickup and delivery problem with time windows and transshipment. INFOR 44(3), 217–228 (2006)Google Scholar
  27. 27.
    Orda, A., Rom, R.: Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length. J. ACM 37(3), 607–625 (1990)CrossRefzbMATHGoogle Scholar
  28. 28.
    Parragh, S., Doerner, K., Hartl, R.: A survey on pickup and delivery problems, Part II: Transportation between pickup and delivery locations. Journal für Betriebswirtschaft 58, 81–117 (2008)CrossRefGoogle Scholar
  29. 29.
    Pohl, I.: Bi-directional search. Machine Intelligence 6, 127–140 (1971)zbMATHGoogle Scholar
  30. 30.
    Popken, D.A.: Controlling order circuity in pickup and delivery problems. Transportation Research Part E: Logistics and Transportation Review 42(5), 431–443 (2006)CrossRefGoogle Scholar
  31. 31.
    Ropke, S., Cordeau, J.F.: Branch and cut and price for the pickup and delivery problem with time windows. Transportation Science 43(3), 267–286 (2009)CrossRefGoogle Scholar
  32. 32.
    Ropke, S., Cordeau, J.F., Laporte, G.: Models and branch-and-cut algorithms for pickup and delivery problems with time windows. Networks 49(4), 258–272 (2007)CrossRefzbMATHGoogle Scholar
  33. 33.
    Ropke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Science 40(4), 455–472 (2006)CrossRefGoogle Scholar
  34. 34.
    Sigurd, M., Pisinger, D., Sig, M.: Scheduling transportation of live animals to avoid spread of diseases. INFORMS Transportation Science 38, 197–209 (2004)CrossRefGoogle Scholar
  35. 35.
    Tian, Y., Lee, K.C.K., Lee, W.C.: Finding skyline paths in road networks. In: GIS, pp. 444–447 (2009)Google Scholar
  36. 36.
    Xu, H., Chen, Z.L., Rajagopal, S., Arunapuram, S.: Solving a practical pickup and delivery problem. Transportation Science 37(3), 347–364 (2003)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Panagiotis Bouros
    • 1
  • Dimitris Sacharidis
    • 2
  • Theodore Dalamagas
    • 2
  • Timos Sellis
    • 1
    • 2
  1. 1.National Technical University of AthensGreece
  2. 2.Institute for the Management of Information Systems, R.C. “Athena”Greece

Personalised recommendations