Skip to main content
SpringerLink
Log in

Static pickup and delivery problems: a classification scheme and survey

  • Invited Paper
  • Published:
TOP Aims and scope Submit manuscript

Abstract

Pickup and delivery problems constitute an important class of vehicle routing problems in which objects or people have to be collected and distributed. This paper introduces a general framework to model a large collection of pickup and delivery problems, as well as a three-field classification scheme for these problems. It surveys the methods used for solving them.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Alshamrani A, Mathur K, Ballou RH (2007) Reverse logistics: simultaneous design of delivery routes and return strategies. Comput Oper Res 34:595–619

    Google Scholar 

  • Anderberg MR (1973) Cluster analysis for applications. Academic, New York

    Google Scholar 

  • Angelelli E, Mansini R (2002) The vehicle routing problem with time windows and simultaneous pick-up and delivery. In: Speranza MG, Klose A, Van Wassenhove LN (eds) Quantitative approaches to distribution logistics and supply chain management. Springer, Berlin, pp 249–267

    Google Scholar 

  • Anily S (1996) The vehicle routing problem with delivery and back-haul options. Nav Res Logist 43:415–434

    Google Scholar 

  • Anily S, Bramel J (1999) Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries. Nav Res Logist 46:654–670

    Google Scholar 

  • Anily S, Hassin R (1992) The swapping problem. Networks 22:419–433

    Google Scholar 

  • Anily S, Mosheiov G (1994) The traveling salesman problem with delivery and backhauls. Oper Res Lett 16:11–18

    Google Scholar 

  • Anily S, Gendreau M, Laporte G (1999) The swapping problem on a line. SIAM J Comput 29:327–335

    Google Scholar 

  • Anily S, Gendreau M, Laporte G (2006) The preemptive swapping problem on a tree (submitted for publication)

  • Attalah M, Kosaraju S (1988) Efficient solutions to some transportation problems with applications to minimizing robot arm travel. SIAM J Comput 17:849–869

    Google Scholar 

  • Balas E, Padberg MW (1976) Set partitioning: a survey. SIAM Rev 18:710–760

    Google Scholar 

  • Baldacci R, Hadjiconstantinou EA, Mingozzi A (2003) An exact algorithm for the traveling salesman problem with deliveries and collections. Networks 42:26–41

    Google Scholar 

  • Bartholdi JJ, Platzman LK (1982) An O(nlog n) planar travelling salesman heuristic based on space filling curves. Oper Res Lett 4:121–125

    Google Scholar 

  • Battiti R, Tecchiolli G (1994) The reactive tabu search. ORSA J Comput 6:126–140

    Google Scholar 

  • Beardwood J, Halton JH, Hammersley JM (1959) The shortest path through many points. Proc Camb Philos Soc 55:299–328

    Google Scholar 

  • Bent R, Van Hentenryck P (2006) A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows. Comput Oper Res 33:875–893

    Google Scholar 

  • Beullens P, Van Wassenhove L, Van Oudheusden D (2004) Collection and vehicle routing issues in reverse logistics. In: Dekker R, Fleischmann M, Inderfurth K, Van Wassenhove L (eds) Reverse logistics, quantitative models for closed-loop supply chains. Springer, Berlin, pp 95–134

    Google Scholar 

  • Bianchessi N, Righini G (2007) Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery. Comput Oper Res 34:578–594

    Google Scholar 

  • Bodin LD, Sexton TR (1986) The multi-vehicle subscriber dial-a-ride problem. TIMS Stud Manag Sci 22:73–86

    Google Scholar 

  • Borndörfer R, Klostermeier F, Grötschel M, 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

  • Brandão J (2006) A new tabu search algorithm for the vehicle routing problem with backhauls. Eur J Oper Res 173:540–555

    Google Scholar 

  • Branke J, Middendorf M, Noeth G, Dessouky M (2005) Waiting strategies for dynamic vehicle routing. Transport Sci 39:298–312

    Google Scholar 

  • Brønmo G, Christiansen M, Fagerholt K, Nygreen B (2007) A multistart local search heuristic for ship scheduling— a computational study. Comput Oper Res 34:900–917

    Google Scholar 

  • Carrabs F, Cordeau J-F, Laporte G (2006) Variable neighbourhood search for the pickup and delivery traveling salesman problem with LIFO loading. INFORMS J Comput (forthcoming)

  • Casco DO, Golden BL, Wasil EA (1988) Vehicle routing with backhauls: models, algorithms, and case studies. In: Golden BL, Assad AA (eds) Vehicle routing: methods and studies. North-Holland, Amsterdam, pp 127–147

    Google Scholar 

  • Chalasani P, Motwani R (1999) Approximated capacitated routing and delivery problems. SIAM J Comput 28:2133–2149

    Google Scholar 

  • Chen J-F, Wu T-H (2006) Vehicle routing problem with simultaneous deliveries and pickups. J Oper Res Soc 57:579–587

    Google Scholar 

  • Chisman JA (1975) The clustered traveling salesman problem. Comput Oper Res 2:115–118

    Google Scholar 

  • Christofides N (1976) Worst-case analysis of a new heuristic for the travelling salesman problem. Research report 388, GSIA, Carnegie Mellon University, Pittsburgh, PA

  • Clarke G, Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12:568–581

    Google Scholar 

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

    Google Scholar 

  • Cordeau J-F, Laporte G (2003a) The dial-a-ride problem (DARP): variants, modeling issues and algorithms. 4OR — Q J Belg Fr Ital Oper Res Soc 1:89–101

    Google Scholar 

  • Cordeau J-F, Laporte G (2003b) A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transport Res Part B 37:579–594

    Google Scholar 

  • Cordeau J-F, Laporte G, Mercier A (2001) A unified tabu search heuristic for vehicle routing problems with time windows. J Oper Res Soc 52:928–936

    Google Scholar 

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

  • Cortés CE, Matamala M, Contardo C (2007) The pickup-and-delivery problem with transfers: formulation and a branch-and-cut solution method (submitted for publication)

  • Cullen FH, Jarvis J, Ratliff HD (1981) Set partitioning based heuristic for interactive routing. Networks 11:125–143

    Google Scholar 

  • Deif I, Bodin L (1984) Extension of the Clarke and Wright algorithm for solving the vehicle routing problem with backhauling. In: Kidder A (ed) Proceedings of the Babson conference on software uses in transportation and logistic management, Babson Park, FL

  • Dell’Amico M, Righini G, Salani M (2006) A branch-and-price approach to the vehicle routing problem with simultaneous distribution and collection. Transport Sci 40:235–247

    Google Scholar 

  • Desrosiers J, Dumas Y, Soumis F (1986) A dynamic programming solution of the large-scale single-vehicle dial-a-ride problem with time windows. Am J Math Manag Sci 6:301–325

    Google Scholar 

  • Desrosiers J, Dumas Y, Soumis F, Taillefer S, Villeneuve D (1991) An algorithm for mini-clustering in handicapped transport. Technical Report G-91-02. GERAD, HEC Montréal

  • Dethloff J (2001) Vehicle routing and reverse logistics: the vehicle routing problem with simultaneous delivery and pick-up. Oper Res Spektrum 23:79–96

    Google Scholar 

  • Dror M, Trudeau P (1989) Savings by split delivery routing. Transport Sci 23:141–145

    Google Scholar 

  • Dueck G (1993) New optimization heuristics: the great deluge algorithm and the record-to-record travel. J Comput Phys 104:86–92

    Google Scholar 

  • Duhamel C, Potvin J-Y, Rousseau J-M (1997) A tabu search heuristic for the vehicle routing problem with backhauls and time windows. Transport Sci 31:49–59

    Google Scholar 

  • Dumas Y, Desrosiers J, Soumis F (1989) Large scale multi-vehicle dial-a-ride problems. Research report G-89-30, GERAD, HEC Montréal

  • Dumas Y, Soumis F, Desrosiers J (1990) Optimizing the schedule for a fixed vehicle path with convex inconvenience costs. Transport Sci 24:145–152

    Google Scholar 

  • Dumas Y, Desrosiers J, Soumis F (1991) The pickup and delivery problem with time windows. Eur J Oper Res 54:7–22

    Google Scholar 

  • Fischetti M, Toth P (1989) An additive bounding procedure for combinatorial optimization problems. Oper Res 37:319–328

    Google Scholar 

  • Frederickson G, Guan D (1992) Preemptive ensemble motion planning on a tree. SIAM J Comput 21:1130–1152

    Google Scholar 

  • Frederickson G, Guan D (1993) Nonpreemptive ensemble motion planning on a tree. J Algorithms 15:29–60

    Google Scholar 

  • Frederickson G, Hecht M, Kim C (1978) Approximation algorithms for some routing problems. SIAM J Comput 7:178–193

    Google Scholar 

  • Fu L, Rilett LR (1998) Expected shortest paths in dynamic and stochastic traffic networks. Transport Res Part B 32:449–516

    Google Scholar 

  • Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco

    Google Scholar 

  • Gendreau M, Hertz A, Laporte G (1992) New insertion and postoptimization procedures for the traveling salesman problem. Oper Res 40:1086–1094

    Google Scholar 

  • Gendreau M, Hertz A, Laporte G (1996) The traveling salesman problem with backhauls. Comput Oper Res 23:501–508

    Google Scholar 

  • Gendreau M, Hertz A, Laporte G (1997) An approximation algorithm for the traveling salesman problem with backhauls. Oper Res 45:639–641

    Google Scholar 

  • Gendreau M, Laporte G, Vigo D (1999) Heuristics for the traveling salesman problem with pickup and delivery. Comput Oper Res 26:699–714

    Google Scholar 

  • Ghaziri H, Osman IH (2003) A neural network algorithm for the traveling salesman problem with backhauls. Comput Ind Eng 44:267–281

    Google Scholar 

  • Ghaziri H, Osman IH (2006) Self-organizing feature map for the vehicle routing problem with backhauls. J Sched 9:97–114

    Google Scholar 

  • Glover F (1995) Tabu thresholding: improved search trajectories by non-monotonic search trajectories. ORSA J Comput 7:426–442

    Google Scholar 

  • Goetschalckx M, Jacobs-Blecha C (1989) The vehicle routing problem with backhauls. Eur J Oper Res 42:39–51

    Google Scholar 

  • Golden BL, Bodin LD, Doyle T, Stewart WR Jr (1980) Approximate travelling salesman algorithms. Oper Res 28:694–711

    Google Scholar 

  • Golden BL, Wang Q, Liu L (1988) A multifaceted heuristic for the orienteering problem. Nav Res Logist 35:359–366

    Google Scholar 

  • Gribkovskaia I, Halskau Ø, Myklebost KNB (2001) Models for the pick-up and deliveries from depots with lasso solutions. In: NOFOMA2001, Collaboration in logistics: connecting islands using information technology, pp 279–293

  • Gribkovskaia I, Laporte G, Shlopak A (2006) A tabu search heuristic for a routing problem arising in the servicing of offshore platforms (submitted for publications)

  • Gribkovskaia I, Halskau Ø, Laporte G, Vlček M (2007) General solutions to the single vehicle routing problem with pickups and deliveries. Eur J Oper Res 180:568–584

    Google Scholar 

  • Gélinas S, Desrochers M, Desrosiers J (1995) A new branching strategy for time constrained routing problems with application to backhauling. Ann Oper Res 61:91–109

    Google Scholar 

  • Halse K (1992) Modeling and solving complex vehicle routing problems. PhD thesis, Technical University of Denmark

  • Healy P, Moll R (1980) A new extension of local search applied to the dial-a-ride problem. Transport Sci 14:130–154

    Google Scholar 

  • Hernández-Pérez H, Salazar-González JJ (2003) The one-commodity pickup-and-delivery traveling salesman problem. In: Jünger M, Reinelt G, Rinaldi G (eds) Eureka, You shrink!. Lecture notes in computer science, vol 2570. Springer, Berlin

    Google Scholar 

  • Hernández-Pérez H, Salazar-González JJ (2004a) A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery. Discret Appl Math 145:126–139

    Google Scholar 

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

    Google Scholar 

  • Hoff A, Løkketangen A (2006) Creating lasso-solutions for the traveling salesman problem with pickup and delivery by tabu search. Central Eur J Oper Res 14:125–140

    Google Scholar 

  • Hoff A, Laporte G, Løkketangen A, Gribkovskaia I (2006) Lasso solutions strategies for the vehicle routing problem with pickups and deliveries (submitted for publication)

  • Ioachim I, Desrosiers J, Dumas Y, Solomon MM, Villeneuve D (1995) A request clustering algorithm for door-to-door handicapped transportation. Transport Sci 29:63–78

    Google Scholar 

  • Jaw JJ, Odoni AR, Psaraftis HN, Wilson NHM (1986) A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows. Transport Res Part B 20:243–257

    Google Scholar 

  • Johnson DS, McGeoch LA (1997) The traveling salesman problem: a case study in local optimization. In: Aarts EJL, Lenstra JK (eds) Local search in combinatorial optimization. Wiley, Chilester, pp 215–310

    Google Scholar 

  • Kalantari B, Hill AV, Arora SR (1985) An algorithm for the traveling salesman problem with pickup and delivery customers. Eur J Oper Res 22:377–386

    Google Scholar 

  • Karp RM (1977) Probabilistic analysis of partitioning algorithms for the travelling salesman problem in the plane. Math Oper Res 2:209–224

    Google Scholar 

  • Katoh N, Yano T (2006) An approximation algorithm for the pickup and delivery vehicle routing problem on trees. Discret Appl Math 154:2335–2349

    Google Scholar 

  • Kohonen T (1995) Self-organized formation of topologically correct feature maps. Biol Cybern 43:59–69

    Google Scholar 

  • Kontoravdis G, Bard JF (1995) A GRASP for the vehicle routing problem with time windows. ORSA J Comput 7:10–23

    Google Scholar 

  • Kruskal JB (1956) On the shortest spanning subtree and the traveling salesman problem. Proc Am Math Soc 7:48–50

    Google Scholar 

  • Kubo M, Kasugai H (1990) Heuristic algorithms for the single vehicle dial-a-ride problem. J Oper Res Soc Jpn 33:354–365

    Google Scholar 

  • Lau HC, Liang Z (2002) Pickup and delivery with time windows: algorithms and test case generation. Int J Artif Intell Tools 11:455–472

    Google Scholar 

  • Lin S (1965) Computer solutions of the traveling salesman problem. Bell Syst Tech J 44:2245–2269

    Google Scholar 

  • Lin S, Kernighan BW (1973) An effective heuristic algorithm for the traveling salesman problem. Oper Res 21:498–516

    Google Scholar 

  • Little JDC, Murty KG, Sweeney DW, Karel C (1963) An algorithm for the traveling salesman problem. Oper Res 11:972–989

    Google Scholar 

  • Lübbecke ME (2004) Combinatorially simple pickup and delivery paths. Central Eur J Oper Res 12:405–417

    Google Scholar 

  • Madsen OBG, Ravn HF, Rygaard JM (1995) A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives. Ann Oper Res 60:193–208

    Google Scholar 

  • Mageean J, Nelson JD (2003) The evaluation of demand responsive transport services in Europe. J Transp Geog 6:255–270

    Google Scholar 

  • Miller C, Tucker A, Zemlin R (1960) Integer programming formulation of traveling salesman problems. J Assoc Comput Mach 7:326–329

    Google Scholar 

  • Min H (1989) The multiple the vehicle routing problem with simultaneous delivery and pick-up points. Transport Res Part A 5:377–386

    Google Scholar 

  • Mingozzi A, Giorgi S, Baldacci R (1999) An exact method for the vehicle routing problem with backhauls. Transport Sci 33:315–329

    Google Scholar 

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

    Google Scholar 

  • Mitrović-Minić S, Laporte G (2006) The pickup and delivery problem with time windows and transshipment. INFOR 44:217–227

    Google Scholar 

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

    Google Scholar 

  • Mladenović N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24:1097–1100

    Google Scholar 

  • Montané FAT, Galvão RD (2006) A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service. Comput Oper Res 33:595–619

    Google Scholar 

  • Mosheiov G (1994) The traveling salesman problem with pick-up and delivery. Eur J Oper Res 79:299–310

    Google Scholar 

  • Nagy G, Salhi S (2005) Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries. Eur J Oper Res 162:126–141

    Google Scholar 

  • Nanry WP, Barnes JW (2000) Solving the pickup and delivery problem with time windows using reactive tabu search. Transport Res Part B 34:107–121

    Google Scholar 

  • Nowak MA (2005) The pickup and delivery problem with split loads. PhD thesis, Georgia Institute of Technology

  • Or I (1976) Traveling Salesman-type combinatorial problems and their relation to the logistics of regional blood banking. PhD thesis, Northwestern University, Evanston, IL

  • Osman IH, Wassan NA (2002) A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls. J Sched 5:263–285

    Google Scholar 

  • Oxley JG (1993) Matroid theory. Oxford University Press, New York

  • Pacheco JA (1997) Heurístico para los problemas de rutas con carga y descarga en sistemas LIFO. Qüestiió 21:153–175

    Google Scholar 

  • Padberg MW, Rinaldi G (1991) A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Rev 33:60–100

    Google Scholar 

  • Paquette J, Cordeau J-F, Laporte G (2006) Une étude comparative de divers modèles pour le problème de transport à la demande (submitted for publication)

  • Peano G (1890) Sur une courbe qui remplit toute une aire plaine. Math Ann 36:157–160

    Google Scholar 

  • Potvin J-Y, Duhamel C, Guertin F (1996) A genetic algorithm for vehicle routing with backhauling. Appl Intell 6:345–355

    Google Scholar 

  • Potvin J-Y, Rousseau J-M (1992) Constraint-directed search for the advanced-request dial-a-ride problem with service quality constraints. In: Balci RSO, Zenios S (eds) Computer science and operation research: new developments in their interfaces. Pergamon, Oxford

    Google Scholar 

  • Powell WB, Jaillet P, Odoni AR (2005) Stochastic and dynamic networks and routing. In: Ball MO, Magnanti TL, Monma CL, Nemhauser GL (eds) Network routing. Handbooks in operations research and management science, vol 8. North-Holland, Amsterdam, pp 141–295

    Google Scholar 

  • Privé J, Renaud J, Boctor F, Laporte G (2006) Solving a vehicle-routing problem arising in soft-drink distribution. J Oper Res Soc 57:1045–1052

    Google Scholar 

  • Psaraftis HN (1980) A dynamic programming approach to the single-vehicle, many-to-many immediate request dial-a-ride problem. Transport Sci 14:130–154

    Google Scholar 

  • Psaraftis HN (1983a) Analysis of an O(n 2) heuristic for the single vehicle many-to-many Euclidean dial-a-ride problem. Transport Res B 17:133–145

    Google Scholar 

  • Psaraftis HN (1983b) An exact algorithm for the single-vehicle, many-to-many dial-a-ride problem with time windows. Transport Sci 17:351–357

    Google Scholar 

  • Rekiek B, Delchambre A, Saleh HA (2006) Handicapped person transportation: An application of the grouping genetic algorithm. Eng Appl Artif Intell 19:511–520

    Google Scholar 

  • Robinson RM (1948) Recursion and double recursion. Bull Am Math Soc 54:987–993

    Article  Google Scholar 

  • Ropke S, Cordeau J-F (2007) Branch-and-cut-and-price for the pickup and delivery problem with time windows (submitted for publication)

  • Ropke S, Pisinger D (2006a) An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transport Sci 40:455–472

    Google Scholar 

  • Ropke S, Pisinger D (2006b) A unified heuristic for a large class of vehicle routing problems with backhauls. Eur J Oper Res 171:750–775

    Google Scholar 

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

    Google Scholar 

  • Roy S, Chapleau L, Ferland JA, Lapalme G, Rousseau J-M (1983) The construction of routes and schedules for the transportation of the handicapped. Working paper, Technical Report CRT-308, Université de Montréal

  • Ruland KS, Rodin EY (1997) The pickup and delivery problem: faces and branch-and-cut algorithm. Comput Math Appl 33:1–13

    Google Scholar 

  • Salhi S, Nagy G (1999) A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling. J Oper Res Soc 50:1034–1042

    Google Scholar 

  • Salhi S, Rand GK (1987) Improvements to vehicle routing heuristics. J Oper Res Soc 38:293–295

    Google Scholar 

  • Savelsbergh MWP (1985) Local search in routing problems with time windows. Ann Oper Res 4:285–305

    Google Scholar 

  • Savelsbergh MWP (1990) An efficient implementation of local search algorithms for constrained routing problems. Eur J Oper Res 47:75–85

    Google Scholar 

  • Savelsbergh MWP, Sol M (1995) The general pickup and delivery problem. Transport Sci 29:17–29

    Google Scholar 

  • Savelsbergh MWP, Sol M (1998) DRIVE: dynamic routing of independent vehicles. Oper Res 46:474–490

    Google Scholar 

  • Sexton TR, Bodin LD (1985a) Optimizing single vehicle many-to-many dial-a-ride problem with desired delivery times, I: scheduling. Transport Sci 19:378–410

    Google Scholar 

  • Sexton TR, Bodin LD (1985b) Optimizing single vehicle many-to-many dial-a-ride problem with desired delivery times, II: routing. Transport Sci 19:411–435

    Google Scholar 

  • Stein D (1978) An asymptotic, probabilistic analysis of a routing problem. Math Oper Res 3:89–101

    Google Scholar 

  • Süral H, Bookbinder JH (2003) The single-vehicle routing problem with unrestricted backhauls. Networks 41:127–136

    Google Scholar 

  • Thangiah SR, Potvin J-Y, Sun T (1996) Heuristic approaches to vehicle routing with backhauls and time windows. Comput Oper Res 23:1043–1057

    Google Scholar 

  • Toth P, Vigo D (1996) Fast local search algorithms for the handicapped persons transportation problem. In: Osman H, Kelly J (eds) Meta-heuristics theory and applications. Kluwer, Boston, pp 677–690

    Google Scholar 

  • Toth P, Vigo D (1997) Heuristic algorithms for the handicapped persons transportation problem. Transport Sci 31:60–71

    Google Scholar 

  • Toth P, Vigo D (1999) A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls. Eur J Oper Res 113:528–543

    Google Scholar 

  • Toth P, Vigo D (2002) VRP with backhauls. In: Toth P, Vigo D (eds) The vehicle routing problem. SIAM, Philadelphia, pp 195–224

    Google Scholar 

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

    Google Scholar 

  • Voudouris C, Tsang E (1999) Guided local search and its application to the traveling salesman problem. Eur J Oper Res 113:469–499

    Google Scholar 

  • Wade AC, Salhi S (2002) An investigation into a new class of vehicle routing problems with backhauls. Omega 30:479–487

    Google Scholar 

  • Wang F, Lim A, Xu Z (2006) The one-commodity pickup and delivery traveling salesman problem on a path or a tree. Networks 48:24–35

    Google Scholar 

  • Xu H, Chen Z-L, Rajagopal S, Arunapuram S (2003) Solving a practical pickup and delivery problem. Transport Sci 37:347–364

    Google Scholar 

  • Yano CA, Chan TJ, Richter LK, Cutler T, Murty KG, McGettigan D (1987) Vehicle routing at quality stores. Interfaces 17(2):52–63

    Article  Google Scholar 

  • Zhong Y, Cole MH (2005) A vehicle routing problem with backhauls and time windows: a guided local search solution. Transport Res Part E 41:131–144

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Gerardo Berbeglia & Gilbert Laporte

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

    Jean-François Cordeau

  3. Molde University College, Postbox 2110, 6402, Molde, Norway

    Irina Gribkovskaia

Authors
  1. Gerardo Berbeglia
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jean-François Cordeau
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Irina Gribkovskaia
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Gilbert Laporte
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Gerardo Berbeglia.

Additional information

This invited paper is discussed in the comments available at: http://dx.doi.org/10.1007/s11750-007-0010-7, http://dx.doi.org/10.1007/s11750-007-0011-6, http://dx.doi.org/10.1007/s11750-007-0012-5, http://dx.doi.org/10.1007/s11750-007-0013-4, http://dx.doi.org/10.1007/s11750-007-0014-3.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Berbeglia, G., Cordeau, JF., Gribkovskaia, I. et al. Static pickup and delivery problems: a classification scheme and survey. TOP 15, 1–31 (2007). https://doi.org/10.1007/s11750-007-0009-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11750-007-0009-0

Keywords

Mathematics Subject Classification (2000)

Search

Navigation