TOP

, Volume 15, Issue 1, pp 1–31 | Cite as

Static pickup and delivery problems: a classification scheme and survey

  • Gerardo Berbeglia
  • Jean-François Cordeau
  • Irina Gribkovskaia
  • Gilbert Laporte
Invited Paper

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.

Keywords

Vehicle routing Stacker crane Swapping problem Backhauls Dial-a-ride problem 

Mathematics Subject Classification (2000)

90-02 90B06 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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
  2. Anderberg MR (1973) Cluster analysis for applications. Academic, New York Google Scholar
  3. 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
  4. Anily S (1996) The vehicle routing problem with delivery and back-haul options. Nav Res Logist 43:415–434 Google Scholar
  5. 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
  6. Anily S, Hassin R (1992) The swapping problem. Networks 22:419–433 Google Scholar
  7. Anily S, Mosheiov G (1994) The traveling salesman problem with delivery and backhauls. Oper Res Lett 16:11–18 Google Scholar
  8. Anily S, Gendreau M, Laporte G (1999) The swapping problem on a line. SIAM J Comput 29:327–335 Google Scholar
  9. Anily S, Gendreau M, Laporte G (2006) The preemptive swapping problem on a tree (submitted for publication) Google Scholar
  10. 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
  11. Balas E, Padberg MW (1976) Set partitioning: a survey. SIAM Rev 18:710–760 Google Scholar
  12. 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
  13. 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
  14. Battiti R, Tecchiolli G (1994) The reactive tabu search. ORSA J Comput 6:126–140 Google Scholar
  15. Beardwood J, Halton JH, Hammersley JM (1959) The shortest path through many points. Proc Camb Philos Soc 55:299–328 Google Scholar
  16. 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
  17. 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
  18. 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
  19. Bodin LD, Sexton TR (1986) The multi-vehicle subscriber dial-a-ride problem. TIMS Stud Manag Sci 22:73–86 Google Scholar
  20. 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 Google Scholar
  21. 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
  22. Branke J, Middendorf M, Noeth G, Dessouky M (2005) Waiting strategies for dynamic vehicle routing. Transport Sci 39:298–312 Google Scholar
  23. 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
  24. 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) Google Scholar
  25. 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
  26. Chalasani P, Motwani R (1999) Approximated capacitated routing and delivery problems. SIAM J Comput 28:2133–2149 Google Scholar
  27. Chen J-F, Wu T-H (2006) Vehicle routing problem with simultaneous deliveries and pickups. J Oper Res Soc 57:579–587 Google Scholar
  28. Chisman JA (1975) The clustered traveling salesman problem. Comput Oper Res 2:115–118 Google Scholar
  29. Christofides N (1976) Worst-case analysis of a new heuristic for the travelling salesman problem. Research report 388, GSIA, Carnegie Mellon University, Pittsburgh, PA Google Scholar
  30. 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
  31. Cordeau J-F (2006) A branch-and-cut algorithm for the dial-a-ride problem. Oper Res 54:573–586 Google Scholar
  32. 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
  33. 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
  34. 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
  35. 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) Google Scholar
  36. 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) Google Scholar
  37. Cullen FH, Jarvis J, Ratliff HD (1981) Set partitioning based heuristic for interactive routing. Networks 11:125–143 Google Scholar
  38. 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 Google Scholar
  39. 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
  40. 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
  41. 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 Google Scholar
  42. 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
  43. Dror M, Trudeau P (1989) Savings by split delivery routing. Transport Sci 23:141–145 Google Scholar
  44. Dueck G (1993) New optimization heuristics: the great deluge algorithm and the record-to-record travel. J Comput Phys 104:86–92 Google Scholar
  45. 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
  46. Dumas Y, Desrosiers J, Soumis F (1989) Large scale multi-vehicle dial-a-ride problems. Research report G-89-30, GERAD, HEC Montréal Google Scholar
  47. 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
  48. Dumas Y, Desrosiers J, Soumis F (1991) The pickup and delivery problem with time windows. Eur J Oper Res 54:7–22 Google Scholar
  49. Fischetti M, Toth P (1989) An additive bounding procedure for combinatorial optimization problems. Oper Res 37:319–328 Google Scholar
  50. Frederickson G, Guan D (1992) Preemptive ensemble motion planning on a tree. SIAM J Comput 21:1130–1152 Google Scholar
  51. Frederickson G, Guan D (1993) Nonpreemptive ensemble motion planning on a tree. J Algorithms 15:29–60 Google Scholar
  52. Frederickson G, Hecht M, Kim C (1978) Approximation algorithms for some routing problems. SIAM J Comput 7:178–193 Google Scholar
  53. Fu L, Rilett LR (1998) Expected shortest paths in dynamic and stochastic traffic networks. Transport Res Part B 32:449–516 Google Scholar
  54. Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco Google Scholar
  55. Gendreau M, Hertz A, Laporte G (1992) New insertion and postoptimization procedures for the traveling salesman problem. Oper Res 40:1086–1094 Google Scholar
  56. Gendreau M, Hertz A, Laporte G (1996) The traveling salesman problem with backhauls. Comput Oper Res 23:501–508 Google Scholar
  57. Gendreau M, Hertz A, Laporte G (1997) An approximation algorithm for the traveling salesman problem with backhauls. Oper Res 45:639–641 Google Scholar
  58. 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
  59. Ghaziri H, Osman IH (2003) A neural network algorithm for the traveling salesman problem with backhauls. Comput Ind Eng 44:267–281 Google Scholar
  60. Ghaziri H, Osman IH (2006) Self-organizing feature map for the vehicle routing problem with backhauls. J Sched 9:97–114 Google Scholar
  61. Glover F (1995) Tabu thresholding: improved search trajectories by non-monotonic search trajectories. ORSA J Comput 7:426–442 Google Scholar
  62. Goetschalckx M, Jacobs-Blecha C (1989) The vehicle routing problem with backhauls. Eur J Oper Res 42:39–51 Google Scholar
  63. Golden BL, Bodin LD, Doyle T, Stewart WR Jr (1980) Approximate travelling salesman algorithms. Oper Res 28:694–711 Google Scholar
  64. Golden BL, Wang Q, Liu L (1988) A multifaceted heuristic for the orienteering problem. Nav Res Logist 35:359–366 Google Scholar
  65. 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 Google Scholar
  66. 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) Google Scholar
  67. 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
  68. 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
  69. Halse K (1992) Modeling and solving complex vehicle routing problems. PhD thesis, Technical University of Denmark Google Scholar
  70. 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
  71. 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
  72. 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
  73. 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
  74. 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
  75. 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) Google Scholar
  76. 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
  77. 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
  78. 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
  79. 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
  80. Karp RM (1977) Probabilistic analysis of partitioning algorithms for the travelling salesman problem in the plane. Math Oper Res 2:209–224 Google Scholar
  81. 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
  82. Kohonen T (1995) Self-organized formation of topologically correct feature maps. Biol Cybern 43:59–69 Google Scholar
  83. Kontoravdis G, Bard JF (1995) A GRASP for the vehicle routing problem with time windows. ORSA J Comput 7:10–23 Google Scholar
  84. Kruskal JB (1956) On the shortest spanning subtree and the traveling salesman problem. Proc Am Math Soc 7:48–50 Google Scholar
  85. 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
  86. 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
  87. Lin S (1965) Computer solutions of the traveling salesman problem. Bell Syst Tech J 44:2245–2269 Google Scholar
  88. Lin S, Kernighan BW (1973) An effective heuristic algorithm for the traveling salesman problem. Oper Res 21:498–516 Google Scholar
  89. Little JDC, Murty KG, Sweeney DW, Karel C (1963) An algorithm for the traveling salesman problem. Oper Res 11:972–989 Google Scholar
  90. Lübbecke ME (2004) Combinatorially simple pickup and delivery paths. Central Eur J Oper Res 12:405–417 Google Scholar
  91. 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
  92. Mageean J, Nelson JD (2003) The evaluation of demand responsive transport services in Europe. J Transp Geog 6:255–270 Google Scholar
  93. Miller C, Tucker A, Zemlin R (1960) Integer programming formulation of traveling salesman problems. J Assoc Comput Mach 7:326–329 Google Scholar
  94. 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
  95. Mingozzi A, Giorgi S, Baldacci R (1999) An exact method for the vehicle routing problem with backhauls. Transport Sci 33:315–329 Google Scholar
  96. 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
  97. Mitrović-Minić S, Laporte G (2006) The pickup and delivery problem with time windows and transshipment. INFOR 44:217–227 Google Scholar
  98. 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
  99. Mladenović N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24:1097–1100 Google Scholar
  100. 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
  101. Mosheiov G (1994) The traveling salesman problem with pick-up and delivery. Eur J Oper Res 79:299–310 Google Scholar
  102. 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
  103. 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
  104. Nowak MA (2005) The pickup and delivery problem with split loads. PhD thesis, Georgia Institute of Technology Google Scholar
  105. Or I (1976) Traveling Salesman-type combinatorial problems and their relation to the logistics of regional blood banking. PhD thesis, Northwestern University, Evanston, IL Google Scholar
  106. 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
  107. Oxley JG (1993) Matroid theory. Oxford University Press, New York Google Scholar
  108. Pacheco JA (1997) Heurístico para los problemas de rutas con carga y descarga en sistemas LIFO. Qüestiió 21:153–175 Google Scholar
  109. 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
  110. 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) Google Scholar
  111. Peano G (1890) Sur une courbe qui remplit toute une aire plaine. Math Ann 36:157–160 Google Scholar
  112. Potvin J-Y, Duhamel C, Guertin F (1996) A genetic algorithm for vehicle routing with backhauling. Appl Intell 6:345–355 Google Scholar
  113. 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
  114. 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
  115. 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
  116. 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
  117. 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
  118. 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
  119. 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
  120. Robinson RM (1948) Recursion and double recursion. Bull Am Math Soc 54:987–993 CrossRefGoogle Scholar
  121. Ropke S, Cordeau J-F (2007) Branch-and-cut-and-price for the pickup and delivery problem with time windows (submitted for publication) Google Scholar
  122. 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
  123. 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
  124. 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
  125. 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 Google Scholar
  126. Ruland KS, Rodin EY (1997) The pickup and delivery problem: faces and branch-and-cut algorithm. Comput Math Appl 33:1–13 Google Scholar
  127. 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
  128. Salhi S, Rand GK (1987) Improvements to vehicle routing heuristics. J Oper Res Soc 38:293–295 Google Scholar
  129. Savelsbergh MWP (1985) Local search in routing problems with time windows. Ann Oper Res 4:285–305 Google Scholar
  130. Savelsbergh MWP (1990) An efficient implementation of local search algorithms for constrained routing problems. Eur J Oper Res 47:75–85 Google Scholar
  131. Savelsbergh MWP, Sol M (1995) The general pickup and delivery problem. Transport Sci 29:17–29 Google Scholar
  132. Savelsbergh MWP, Sol M (1998) DRIVE: dynamic routing of independent vehicles. Oper Res 46:474–490 Google Scholar
  133. 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
  134. 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
  135. Stein D (1978) An asymptotic, probabilistic analysis of a routing problem. Math Oper Res 3:89–101 Google Scholar
  136. Süral H, Bookbinder JH (2003) The single-vehicle routing problem with unrestricted backhauls. Networks 41:127–136 Google Scholar
  137. 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
  138. 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
  139. Toth P, Vigo D (1997) Heuristic algorithms for the handicapped persons transportation problem. Transport Sci 31:60–71 Google Scholar
  140. 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
  141. 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
  142. 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
  143. 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
  144. Wade AC, Salhi S (2002) An investigation into a new class of vehicle routing problems with backhauls. Omega 30:479–487 Google Scholar
  145. 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
  146. Xu H, Chen Z-L, Rajagopal S, Arunapuram S (2003) Solving a practical pickup and delivery problem. Transport Sci 37:347–364 Google Scholar
  147. Yano CA, Chan TJ, Richter LK, Cutler T, Murty KG, McGettigan D (1987) Vehicle routing at quality stores. Interfaces 17(2):52–63 CrossRefGoogle Scholar
  148. 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

Copyright information

© Sociedad de Estadística e Investigación Operativa 2007

Authors and Affiliations

  • Gerardo Berbeglia
    • 1
  • Jean-François Cordeau
    • 2
  • Irina Gribkovskaia
    • 3
  • Gilbert Laporte
    • 1
  1. 1.Canada Research Chair in Distribution ManagementHEC MontréalMontrealCanada
  2. 2.Canada Research Chair in Logistics and TransportationHEC MontréalMontrealCanada
  3. 3.Molde University CollegeMoldeNorway

Personalised recommendations