Skip to main content
SpringerLink
Log in

Recent Models and Algorithms for One-to-One Pickup and Delivery Problems

  • Chapter
The Vehicle Routing Problem: Latest Advances and New Challenges

Part of the book series: Operations Research/Computer Science Interfaces ((ORCS,volume 43))

Summary

In one-to-onePickup and Delivery Problems (PDPs), the aim is to design a set of least cost vehicle routes starting and ending at a common depot in order to satisfy a set of pickup and delivery requests between location pairs, subject to side constraints. Each request originates at one location and is destined for one other location. These requests apply to the transportation of goods or people, in which case the problem is often called the dial-a-ride problem. In recent years, there have been several significant developments in the area of exact and heuristic algorithms for PDPs. The purpose of this chapter is to report on these developments. It contains two main sections devoted to single vehicle and multi-vehicle problems, respectively. Each section is subdivided into two parts, one on exact algorithms and one on heuristics.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 219.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 279.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 379.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Balas E, Fischetti M, and Pulleyblank WR (1995) The precedence-constrained asymmetric traveling salesman polytope.Mathematical Programming 68:241–265

    Google Scholar 

  2. Bent R and Van Hentenryck P (2006) A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows.Computers & Operations Research 33:875–893

    Article  Google Scholar 

  3. Berbeglia G, Cordeau J-F, Gribkovskaia I, and Laporte G (2007) Static pickup and delivery problems: A classification scheme and survey.TOP 15:1–31

    Article  Google Scholar 

  4. Bianco L, Mingozzi A, and Ricciardelli S (1994) Exact and heuristic procedures for the traveling salesman problem with precedence constraints, based on dynamic programming.INFOR 32:19–31

    Google Scholar 

  5. Bodin LD and Sexton T (1986). The multi-vehicle subscriber dial-a-ride problem.TIMS Studies in Management Science 26:73–86

    Google Scholar 

  6. Borndörfer R, Grötschel M, Klostermeier F, and Küttner C (1997)Telebus Berlin: Vehicle scheduling in a dial-a-ride system. Technical Report SC 97–23, Konrad-Zuse-Zentrum für Informationstechnik Berlin

    Google Scholar 

  7. Brønmo G, Christiansen M, Fagerholt K, and Nygreen B (2007) A multi-start local search heuristic for ship scheduling – a computational study.Computers & Operations Research 34:900–917

    Article  Google Scholar 

  8. Carrabs F (2006)Heuristics and exact approaches for transportation problems with pickup and delivery. Ph.D. Thesis, Universitá di Salermo, Italy

    Google Scholar 

  9. Carrabs F, Cerulli R, and Cordeau J-F (2006) An additive branch-and-bound algorithm for the pickup and delivery traveling salesman problem with LIFO loading. Submitted for publication

    Google Scholar 

  10. Carrabs F, Cordeau J-F, and Laporte G (2006) Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading.INFORMS Journal on Computing forthcoming

    Google Scholar 

  11. Cassani L and Righini G (2004) Heuristic Algorithms for the TSP with rear-loading. Presented at the 35th Annual Conference of the Italian Operations Research Society (AIRO XXXV), Lecce, Italy

    Google Scholar 

  12. Christiansen M and Nygreen B (1998a) A method for solving ship routing problems with inventory constraints.Annals of Operations Research 81:357–378

    Article  Google Scholar 

  13. Christiansen M and Nygreen B (1998b) Modelling path flows for a combined routing and inventory management problem.Annals of Operations Research 82:391–412

    Article  Google Scholar 

  14. Cordeau J-F (2006) A branch-and-cut algorithm for the dial-a-ride problem.Operations Research 54:573–586

    Article  Google Scholar 

  15. Cordeau J-F, Gendreau M, and Laporte G (1997) A tabu search heuristic for periodic and multi-depot vehicle routing problems.Networks 30:105–119

    Article  Google Scholar 

  16. Cordeau J-F, Iori M, Laporte G, and Salazar-González JJ (2006) A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading. Submitted for publication

    Google Scholar 

  17. Cordeau J-F and Laporte G (2003) A tabu search heuristic for the static multi-vehicle dial-a-ride problem.Transportation Research B 37:579–594

    Article  Google Scholar 

  18. Cordeau J-F and Laporte G (2007) The dial-a-ride problem: Models and algorithms.Annals of Operations Research 153:29–46

    Article  Google Scholar 

  19. Cordeau J-F, Laporte G, and Mercier A (2001) A unified tabu search heuristic for vehicle routing problems with time windows.Journal of the Operational Research Society 52:928–936

    Article  Google Scholar 

  20. Cordeau J-F, Laporte G, Potvin J-Y, and Savelsbergh MWP (2007) Transportation on demand. In: Barnhart C and Laporte G (eds.)Transportation, Handbooks in Operations Research and Management Science, Volume 14, pages 429–466, North-Holland, Amsterdam

    Google Scholar 

  21. Croes G (1958) A method for solving traveling salesman problems.Operations Research 6:791–812

    Google Scholar 

  22. Cullen FH, Jarvis JJ, and Ratliff HD (1981) Set partitioning based heuristics for interactive routing.Networks 11:125–143

    Article  Google Scholar 

  23. Desaulniers G, Desrosiers J, Erdmann A, Solomon MM, and Soumis F (2002) VRP with pickup and delivery.In: Toth P and Vigo D (eds.)The Vehicle Routing Problem, pages 225–242, SIAM Monographs on Discrete Mathematics and Applications, Philadelphia

    Google Scholar 

  24. Desrochers M and Laporte G (1991) Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints.Operations Research Letters 10:27–36

    Article  Google Scholar 

  25. Desrosiers J, Dumas Y, and Soumis F (1986) A dynamic programming solution of the large-scale single-vehicle dial-a-ride problem with time windows.American Journal of Mathematical and Management Sciences 6:301–325

    Google Scholar 

  26. Desrosiers J, Dumas Y, Soumis F, Taillefer S, and Villeneuve D (1991) An algorithm for mini-clustering in handicapped transport.Les Cahiers du GERAD, G–91–02, HEC Montréal

    Google Scholar 

  27. Dumas Y, Desrosiers J, and Soumis F (1991) The pickup and delivery problem with time windows.European Journal of Operational Research 54:7–22

    Article  Google Scholar 

  28. Dumas Y, Desrosiers J, and Soumis F (1989) Large scale multi-vehicle dial-a-ride problems.Les Cahiers du GERAD, G–89–30, HEC Montréal

    Google Scholar 

  29. Dumitrescu I, Ropke S, Cordeau J-F, and Laporte G (2006) The traveling salesman problem with pickup and deliveries: Polyhedral results and branch-and-cut algorithm. Submitted for publication

    Google Scholar 

  30. Fischetti M and Toth P (1989) An additive bounding procedure for combinatorial optimization problems.Operations Research 37:319–328

    Google Scholar 

  31. Fisher ML and Rosenwein MB (1989) An interactive optimization system for bulk-cargo ship scheduling.Naval Research Logistic Quarterly 35:27–42

    Article  Google Scholar 

  32. Gendreau M, Hertz A, and Laporte G (1994) A tabu search heuristic for the vehicle routing problem.Management Science 40:1276–1290

    Google Scholar 

  33. Gribkovskaia I and Laporte G (2007) One-to-many-to-one single vehicle pickup and delivery problems. This volume

    Google Scholar 

  34. Grötschel M and Padberg MW (1985) Polyhedral theory. In: Lawler EL, Lenstra JK, Rinnooy Kan AHG and Shmoys DB (eds.)The Traveling Salesman Problem, pages 251–305, Wiley, Chichester

    Google Scholar 

  35. Hernández-Pérez H and Salazar-González JJ (2004) Heuristics for the one-commodity pickup-and-delivery traveling salesman problem.Transportation Science 38:245–255

    Article  Google Scholar 

  36. Hernández-Pérez H and Salazar-González JJ (2007) The one-commodity pickup-and-delivery traveling salesman problem: Inequalities and algorithms.Networks forthcoming

    Google Scholar 

  37. Jaw J, Odoni AR, Psaraftis HM, and Wilson NHM (1986) A heuristic algorithm for the multi-vehicle advance-request dial-a-ride problem with time-windows.Transportation Research B 20:243–257

    Article  Google Scholar 

  38. Kalantari B, Hill AV, and Arora SR (1985) An algorithm for the traveling salesman problem with pickup and delivery customers.European Journal of Operational Research 22:377–386

    Article  Google Scholar 

  39. Kohl N, Desrosiers J, Madsen OBG, Solomon MM, and Soumis F (1999) 2-path cuts for the vehicle routing problem with time windows.Transportation Science 33:101–116

    Google Scholar 

  40. Landrieu A, Mati Y, and Binder Z (2001) A tabu search heuristic or the single vehicle pickup and delivery problem with time windows.Journal of Intelligent Manufacturing 12:497–508

    Article  Google Scholar 

  41. Laporte G, Nobert Y, and Desrochers M (1985) Optimal routing under capacity and distance restrictions.Operations Research 33:1050–1073

    Google Scholar 

  42. Lawler EL, Lenstra JK, Rinnooy Kan AHG and Shmoys DB (1985)The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, Wiley, Chichester

    Google Scholar 

  43. Levitin G and Abezgaouz R (2003) Optimal routing and multiple-load AGV subject to LIFO loading constraints.Computers & Operations Research 30:397–410

    Article  Google Scholar 

  44. Li H and Lim A (2001) A Metaheuristic for the pickup and delivery problem with time windows.The 13th IEEE Conference on Tools with Artificial Intelligence, ICTAI-2001, Dallas, pages 160–170

    Google Scholar 

  45. Lin S and Kerninghan BW (1973) An effective heuristic algorithm for the traveling-salesman problem.Operations Research 21:498–516

    Google Scholar 

  46. Lu Q and Dessouky MM (2006) A new insertion-based construction heuristic for solving the pickup and delivery problem with time-windows.European Journal of Operational Research 175:672–687

    Article  Google Scholar 

  47. Lysgaard J (2006) Reachability cuts for the vehicle routing problem with time windows.European Journal of Operational Research 175:210–233

    Article  Google Scholar 

  48. Madsen OBG, Ravn HF, and Rygaard JM (1995) A heuristic algorithm for the dial-a-ride problem with time windows, multiple capacities, and multiple objectives.Annals of Operations Research 60:193–208

    Article  Google Scholar 

  49. Mitrović-Minić S, Krishnamurti R, and Laporte G (2004) Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows.Transportation Research Part B 38:669–685

    Article  Google Scholar 

  50. Mitrović-Minić S and Laporte G (2004) Waiting strategies for the dynamic pickup and delivery problem with time windows.Transportation Research Part B 38:635–655

    Article  Google Scholar 

  51. Mladenović N and Hansen P (1997) Variable neighborhood search.Computers & Operations Research 24:1097–1100

    Article  Google Scholar 

  52. Nanry WP and Barnes JW (2000) Solving the pickup and delivery problem with time windows using reactive tabu search.Transportation Research B 34:107–121

    Article  Google Scholar 

  53. Nowak M, Ergun O, and White CC (2006) Pickup and delivery with split loads. Submitted for publication

    Google Scholar 

  54. Pacheco JA (1995) Problemas de rutas con carga y descarga en sistemas LIFO: Soluciones exactas.Estudios de Economía Aplicada 3:69–86

    Google Scholar 

  55. Pankratz G (2005) A grouping genetic algorithm for the pickup and delivery problem with time windows.Operations Research Spectrum 27:21–41

    Article  Google Scholar 

  56. Pisinger D and Ropke S (2007) A general heuristic for vehicle routing problems.Computers & Operations Research 34:2403–2435

    Article  Google Scholar 

  57. Rappoport HK, Levy LS, Golden BL, and Toussaint K (1992) A planning heuristic for military airlift.Interfaces 22(3):73–87

    Google Scholar 

  58. Rappoport HK, Levy LS, Toussaint K, and Golden BL (1994) A transportation problem formulation for the MAC airlift planning problem.Annals of Operations Research 50:505–523

    Article  Google Scholar 

  59. Reinelt G (1991) TSPLIB – A traveling salesman problem library.ORSA Journal on Computing 3:376–384

    Google Scholar 

  60. Rekiek B, Delchambre A, and Saleh HA (2006) Handicapped person transportation problem: An application of the grouping genetic algorithm.Engineering Applications of Artificial Intelligence 19:511–520

    Article  Google Scholar 

  61. Renaud J, Boctor FF, and Laporte G (2002) Perturbation heuristics for the pickup and delivery traveling salesman problem.Computers & Operations Research 29:1129–1141

    Article  Google Scholar 

  62. Ropke S, Cordeau J-F, and Laporte G (2007) Models and branch-and-cut algorithms for pickup and delivery problems with time windows.Networks 49:258–272

    Article  Google Scholar 

  63. Ropke S and Cordeau J-F (2006) Branch-and-cut-and-price for the pickup and delivery problem with time windows. Submitted toTransportation Science

    Google Scholar 

  64. Ropke S and Pisinger D (2006) An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows.Transportation Science 40:455–472

    Article  Google Scholar 

  65. Ruland KS (1994)Polyhedral solution to the pickup and delivery problem.Ph.D. Thesis, Sever Institute, Washington University in St.Louis, MO

    Google Scholar 

  66. Ruland KS and Rodin EY (1997) The pickup and delivery problem: Faces and branch-and-cut algorithm.Computers and Mathematics with Applications 33:1–13

    Article  Google Scholar 

  67. Savelsbergh MWP (1992) The vehicle routing problem with time windows: Minimizing route duration.ORSA Journal on Computing 4:146–154

    Google Scholar 

  68. Savelsbergh MWP and Sol M (1998) Drive: Dynamic routing of independent vehicles.Operations Research 46:474–490

    Article  Google Scholar 

  69. Shaw P (1998) Using constraint programming and local search methods to solve vehicle routing problems. In:CP-98 (Fourth International Conference on Principles and Practice of Constraint Programming), vol. 1520 ofLecture Notes in Computer Science, pages 417–431

    Google Scholar 

  70. Shen Y, Potvin J-Y, Rousseau J-M, and Roy S (1995) A computer assistant for vehicle dispatching with learning capabilities.Annals of Operations Research 61:189–211

    Article  Google Scholar 

  71. Sol M (1994)Column generation for pickup and delivery problems. Ph.D. Thesis, Technische Universiteit Eindhoven

    Google Scholar 

  72. Solanki RS and Southworth F (1991) An execution planning algorithm for military airlift.Interfaces 21(4):121–131

    Google Scholar 

  73. Taillard ÉD (1993) Parallel iterative search methods for vehicle routing problems.Networks 23:661–673

    Article  Google Scholar 

  74. Toth P and Vigo D (1996) Fast local search algorithms for the handicapped persons transportation problem. In: Osman IH, Kelly JP (eds)Meta-Heuristics: Theory and Applications, pages 677–690, Kluwer, Boston

    Google Scholar 

  75. Toth P and Vigo D (1997) Heuristic algorithms for the handicapped persons transportation problem.Transportation Science 31:60–71

    Google Scholar 

  76. Toth P and Vigo D (2002)The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications, Philadelphia

    Google Scholar 

  77. Van der Bruggen LJJ, Lenstra JK, and Schuur PC (1993) Variable-depth search for the single-vehicle pickup and delivery problem with time windows.Transportation Science 27:298–311

    Google Scholar 

  78. Wilson NHM, Sussman J, Wong H, and Higonnet B (1971)Scheduling algorithms for dial-a-ride systems. Technical Report USL TR–70–13, Urban Systems Laboratory, Massachusetts Institute of Technology, Cambridge, MA

    Google Scholar 

  79. Wilson NHM and Weissberg H (1976)Advanced dial-a-ride algorithms research project: Final report. Technical Report R76–20, Department of Civil Engineering, Massachusetts Institute of Technology, Cambridge, MA

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Canada Research Chair in Logistics and Transportation, HEC Montréal, 3000 chemin de la Côte-Sainte-Catherine, Montréal, Canada H3T 2A7

    Jean-Françcois Cordeau

  2. Canada Research Chair in Logistics and Transportation, HEC Montréal, 3000 chemin de la Côte-Sainte-Catherine, Montréal, Canada H3T 2A7

    Gilbert Laporte & Stefan Ropke

Authors
  1. Jean-Françcois Cordeau
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gilbert Laporte
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Stefan Ropke
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jean-Françcois Cordeau .

Editor information

Editors and Affiliations

  1. University of Maryland, College Park, MD, USA

    Bruce Golden  & S. Raghavan  & 

  2. American University, Washington, DC, USA

    Edward Wasil

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Cordeau, JF., Laporte, G., Ropke, S. (2008). Recent Models and Algorithms for One-to-One Pickup and Delivery Problems. In: Golden, B., Raghavan, S., Wasil, E. (eds) The Vehicle Routing Problem: Latest Advances and New Challenges. Operations Research/Computer Science Interfaces, vol 43. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-77778-8_15

Download citation

Publish with us

Policies and ethics

Search

Navigation