Advertisement

Journal für Betriebswirtschaft

, Volume 58, Issue 2, pp 81–117 | Cite as

A survey on pickup and delivery problems

Part II: Transportation between pickup and delivery locations
  • Sophie N. Parragh
  • Karl F. Doerner
  • Richard F. Hartl
State-of-the-art-Artikel

Abstract

This paper is the second part of a comprehensive survey on routing problems involving pickups and deliveries. Basically, two problem classes can be distinguished. The first part dealt with the transportation of goods from the depot to linehaul customers and from backhaul customers to the depot. The second part now considers all those problems where goods are transported between pickup and delivery locations, denoted as Vehicle Routing Problems with Pickups and Deliveries (VRPPD). These are the Pickup and Delivery Vehicle Routing Problem (PDVRP – unpaired pickup and delivery points), the classical Pickup and Delivery Problem (PDP – paired pickup and delivery points), and the Dial-A-Ride Problem (DARP – passenger transportation between paired pickup and delivery points and user inconvenience taken into consideration). Single as well as multi vehicle mathematical problem formulations for all three VRPPD types are given, and the respective exact, heuristic, and metaheuristic solution methods are discussed.

Keywords

Pickup and delivery vehicle routing Pickup and delivery problem Dial-a-ride problem Transportation Survey 

Zusammenfassung

Der vorliegende Artikel ist Teil II einer umfassenden Überblicksarbeit in zwei Teilen über pickup and delivery Probleme. Grundsätzlich können zwei Problemklassen unterschieden werden. Der erste Teil dieser Arbeit beschäftigte sich mit dem Transport von Gütern von einem Depot zu Auslieferungs-Kunden (linehaul customers) und von Rückladungs-Kunden (backhaul customers) zu einem Depot. Der zweite Teil behandelt nun all jene Probleme, die sich mit dem Transport zwischen Abhol- und Auslieferungsorten befassen, im Folgenden als Vehicle Routing Problems with Pickups and Deliveries (VRPPD) bezeichnet. Diese Problemklasse umfasst das Pickup and Delivery Vehicle Routing Problem , ungepaarte Abhol- und Auslieferungsorte, das klassische Pickup and Delivery (PDP), gepaarte Abhol- und Auslierferungsorte, und das Dial-A-Ride Problem (DARP), Personentransport zwischen gepaarten Abhol- und Ablieferungsorten unter Berück- sichtigung von serviceorientierten Kriterien. Die jeweiligen Problemtypen werden zuerst anhand von mathema- tischen Einfahrzeug- und Mehrfahrzeugproblemformulierungen definiert. Im Anschluss werden die in der Literatur beschriebenen Lösungsmethoden diskutiert.

Schlagworte

Tourenplanung Vehicle Routing mit Pickups und Deliveries Dial-a-Ride Problem Überblicksartikel 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aldaihani M, Dessouky MM (2003) Hybrid scheduling methods for paratransit operations. Comput Ind Eng 45:75–96Google Scholar
  2. 2.
    Alfa AS (1986) Scheduling of vehicles for transportation of elderly. Transport Plan Tech 11:203–212Google Scholar
  3. 3.
    Ambrosini M, Caruso T, Foresti S, Righini G (2004) A GRASP for the pickup and delivery problem with rear loading. Tech. Rep. Note del Polo – Ricerca n.65, DTI, University of MilanGoogle Scholar
  4. 4.
    Anily S, Bramel J (1999) Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries. Naval Res Logist 46:654–670Google Scholar
  5. 5.
    Archetti C, Mansini R, Speranza MG (2005) Complexity and reducibility of the skip delivery problem. Transport Sci 39:182–187Google Scholar
  6. 6.
    Archetti C, Speranza MG (2004) Vehicle routing in the 1-skip collection problem. J Oper Res Soc 55:717–727Google Scholar
  7. 7.
    Ascheuer N, Escudero LF, Grötschel M, Stoer M (1993) A cutting plane approach to the sequential ordering problem (with applications to job scheduling in manufacturing). SIAM J Optim 3:25–42Google Scholar
  8. 8.
    Ascheuer N, Krumke SO, Rambau J (2000) Online dial-a-ride problems: Minimizing the completion time. In: STACS 2000: 17th Annual Symposium on Theoretical Aspects of Computer Science, Lille, France, February 2000. Proceedings. Springer, Berlin-Heidelberg, LNCS, 639–650Google Scholar
  9. 9.
    Assad AA (1988) Modeling and implementation issues in vehicle routing. In: Vehicle Routing: Methods and Studies. North-Holland, Amsterdam, Studies in management science and systems, vol. 16, 7–45Google Scholar
  10. 10.
    Attanasio A, Cordeau JF, Ghiani G, Laporte G (2004) Parallel tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem. Parallel Comput 30:377–387Google Scholar
  11. 11.
    Baldacci R, Maniezzo V, Mingozzi A (2004) An exact method for the car pooling problem based on Lagrangean column generation. Oper Res 52:422–439Google Scholar
  12. 12.
    Baugh JW, Krishna G, Kakivaya R, Stone JR (1998) Intractability of the dial-a-ride problem and a multiobjective solution using simulated annealing. Eng Optim 30:91–123Google Scholar
  13. 13.
    Belisle JP, Desrosiers J, Dumas Y, Rousseau JM, Roy S, Soumis F (1986) The impact on vehicle routing of various operational rules of a tansportation system for handicapped. In: Third International Conference on Mobility and Transportation of Handicapped Persons, Office of the Secretary of Transportation, Washington, DC 20590, 6.47–6.50Google Scholar
  14. 14.
    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–893Google Scholar
  15. 15.
    Berbeglia G, Cordeau JF, Gribkovskaia I, Laporte G (2007) Static pickup and delivery problems: A classification scheme and survey. TOP 15:1–31Google Scholar
  16. 16.
    Bodin L, Sexton T (1986) The multi-vehicle subscriber dial-a-ride problem. TIMS Stud Manag Sci 22:73–86Google Scholar
  17. 17.
    Borndörfer R, Grötschel M, Klostermeier F, Küttner C (1997) Telebus Berlin: Vehicle scheduling in a dial-a-ride system. Tech. Rep. SC 97-23, Konrad-Zuse-Zentrum für Informationstechnik BerlinGoogle Scholar
  18. 18.
    Böse J, Gutenschwager K, Voss S (1999) Application of tabu search in an online sequencing problem: A case study of an intermodal station. In: Ribeiro CC (ed.) Proc. of the Third Metaheuristics International Conference MIC 99, Universidade Catolica do Rio de Janeiro, Angra dos Reis (1999). 91–95Google Scholar
  19. 19.
    Böse J, Reiners T, Steenken D, Voss S (2000) Vehicle dispatching at seaport container terminals using evolutionary algorithms. In: Sprague RH (ed.) Proc. 33rd Annual Hawaii Internat. Conf. System Sci., IEEE. Piscataway, NJ. 1–10Google Scholar
  20. 20.
    Bronmo G, Christiansen M, Fagerholt K, Nygreen B (2007) A multi-start local search heuristic for ship scheduling – a computational study. Comput Oper Res 34:900–917Google Scholar
  21. 21.
    Caramia M, Italiano GF, Oriolo G, Pacifici A, Perugia A (2002) Routing a fleet of vehicles for dynamic combined pickup and deliveries services. In: Chamoni P, Leisten R, Martin A, Minnemann J, Stadtler H (eds.) Operations Research Proceedings 2001. Springer, Berlin, Germany, 3–8Google Scholar
  22. 22.
    Caricato P, Ghiani G, Grieco A, Guerriero E (2003) Parallel tabu search for a pickup and delivery problem under track contention. Parallel Comput 29:631–639Google Scholar
  23. 23.
    Carlson RC (1976) Anatomy of a systems failure: Dial-a-ride in Santa Clara County, California. Transportation 5:3–16Google Scholar
  24. 24.
    Carlton WB (1995) A tabu search approach to the general vehicle routing problem. Ph.D. thesis, University of Texas at AustinGoogle Scholar
  25. 25.
    Carrabs F, Cordeau JF, Laporte G (2007) Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading. INFORMS J Comput 19:618–632Google Scholar
  26. 26.
    Castelli L, Coslovich L, Pesenti R, Ukovich W (2002) Improving techniques for an on-line dial-a-ride problem with time windows and capacity constraints. In: Proceedings of the 13th Mini-EURO Conference and 9th Meeting of the EURO Working Group on Transportation, Bari, Italy – June 10-13 2002Google Scholar
  27. 27.
    Chalasani P, Motwani R (1999) Approximating capacitated routing and delivery problems. SIAM J Comput 28:2133–2149Google Scholar
  28. 28.
    Christiansen M (1999) Decomposition of a combined inventory and time constrained ship routing problem. Transport Sci 33:3–16Google Scholar
  29. 29.
    Christiansen M, Fagerholt K (2002) Robust ship scheduling with multiple time windows. Naval Res Logist 49:611–625Google Scholar
  30. 30.
    Christiansen M, Fagerholt K, Ronen D (2004) Ship routing and scheduling: status and perspectives. Transport Sci 38:1–18Google Scholar
  31. 31.
    Christiansen M, Nygreen B (1998a) A method for solving ship routing problems with inventory constraints. Ann Oper Res 81:357–387Google Scholar
  32. 32.
    Christiansen M, Nygreen B (1998b) Modeling path flows for a combined ship routing and inventory management problem. Ann Oper Res 82:391–412Google Scholar
  33. 33.
    Christiansen M, Nygreen B (2005) Robust inventory ship routing by column generation. In: Desaulniers G, Desrosiers J, Solomon MM (eds.) Column generation. Springer, New York, 197–224Google Scholar
  34. 34.
    Christofides N (1975) Worst-case analysis of a new heuristic for the travelling salesman problem. Tech. Rep. Report 388, Graduate School of Industrial Administration, Carnegie-Mellon UniversityGoogle Scholar
  35. 35.
    Coja-Oghlan A, Krumke SO, Nierhoff T (2005) A hard dial-a-ride problem that is easy on average. J Sched 8:197–210Google Scholar
  36. 36.
    Colorni A, Dorigo M, Maffioli F, Maniezzo V, Righini G, Trubian M (1996) Heuristics from nature for hard combinatorial optimization problems. Int Trans Oper Res 3:1–21Google Scholar
  37. 37.
    Colorni A, Righini G (2001) Modeling and optimizing dynamic dial-a-ride problems. Int Trans Oper Res 8:155–166Google Scholar
  38. 38.
    Cordeau JF (2006) A branch-and-cut algorithm for the dial-a-ride problem. Oper Res 54:573–586Google Scholar
  39. 39.
    Cordeau JF, Desaulniers G, Desrosiers J, Solomon MM, Soumis F (2002) VRP with time windows. In: Toth P, Vigo D (eds.) The Vehicle Routing Problem. SIAM, Philadelphia, PA, SIAM Monographs on Discrete Mathematics and Applications, vol. 9, 175–193Google Scholar
  40. 40.
    Cordeau JF, 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. Tech. Rep. OR-06-01, DEIS, University of BolognaGoogle Scholar
  41. 41.
    Cordeau JF, Laporte G (2003a) The dial-a-ride problem (DARP): Variants modeling issues and algorithms. 4OR 1:89–101Google Scholar
  42. 42.
    Cordeau JF, Laporte G (2003b) A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transport Res B-Meth 37:579–594Google Scholar
  43. 43.
    Cordeau JF, Laporte G (2007) The dial-a-ride problem: Models and algorithms. Ann Oper Res 152:29–46Google Scholar
  44. 44.
    Cordeau JF, Laporte G, Potvin JY, Savelsbergh MWP (2004) Transportation on demand. In: Handbooks in Operations Research and Management Science, Elsevier, North-Holland, Amsterdam. (to appear)Google Scholar
  45. 45.
    Cordeau JF, Laporte G, Ropke S (2007) Recent models and algorithms for one-to-one pickup and delivery problems. In: Golden B, Raghavan R, Wasil E (eds.) The Vehicle Routing Problem: Latest Advances and New Challenges. (to appear)Google Scholar
  46. 46.
    Coslovich L, Pesenti R, Ukovich W (2006a) Minimizing fleet operating costs for a container transportation company. Eur J Oper Res 171:776–786Google Scholar
  47. 47.
    Coslovich L, Pesenti R, Ukovich W (2006b) A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem. Eur J Oper Res 175:1605–1615Google Scholar
  48. 48.
    Creput JC, Koukam A, Kozlak J, Lukasik J (2004) An evolutionary approach to pickup and delivery problem with time windows. In: Bubak M, van Albada GD, Sloot PMA, Dongarra JJ (eds.) Computational Science – ICCS 2004: 4th International Conference, Krakow, Poland, June 6-9, 2004, Proceedings. Springer, 1102–1108Google Scholar
  49. 49.
    Cullen F, Jarvis J, Ratliff D (1981) Set partitioning based heuristics for interactive routing. Networks 11:125–143Google Scholar
  50. 50.
    Currie RH, Salhi S (2003) Exact and heuristic methods for a full-load, multi-terminal, vehicle scheduling problem with backhauling and time windows. J Oper Res Soc 54:390–400Google Scholar
  51. 51.
    Currie RH, Salhi S (2004) A tabu search heuristic for a full-load, multi-terminal, vehicle scheduling problem with backhauling and time windows. J Math Model Algorithm 3:225–243Google Scholar
  52. 52.
    Daganzo CF (1978) An approximate analytic model of many-to-many demand responsive transportation systems. Transport Res 12:325–333Google Scholar
  53. 53.
    Daganzo CF (1984) Checkpoint dial-a-ride systems. Transport Res B-Meth 18:315–327Google Scholar
  54. 54.
    de Meulemeester L, Laporte G, Louveaux FV, Semet F (1997) Optimal sequencing of skip collections and deliveries. J Oper Res Soc 48:57–64Google Scholar
  55. 55.
    Derigs U, Döhmer T (2008) Indirect search for the vehicle routing problem with pickup and delivery and time windows. OR Spectrum 30:149–165Google Scholar
  56. 56.
    Desaulniers G, Desrosiers J, Erdmann A, Solomon MM, Soumis F (2002) VRP with pickup and delivery. In: Toth P, Vigo D (eds.) The Vehicle Routing Problem. SIAM, Philadelphia, PA, SIAM Monographs on Discrete Mathematics and Applications, vol. 9, 225–242Google Scholar
  57. 57.
    Desrochers M, Lenstra JK, Savelsbergh MWP, Soumis F (1988) Vehicle routing with time windows: Optimization and approximation. In: Golden BL, Assad AA (eds.) Vehicle Routing: Methods and Studies. Elsevier (North-Holland), Amsterdam, 65–84Google Scholar
  58. 58.
    Desrosiers J, Dumas Y (1988) The shortest path for the construction of vehicle routes with pick-up, delivery and time constraints. In: Eiselt H, Pederzoli G (eds.) Advances in Optimization and Control. Springer, Heidelberg Berlin, Lecture Notes in Economics and Mathematical Systems, 144–157Google Scholar
  59. 59.
    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–325Google Scholar
  60. 60.
    Desrosiers J, Dumas Y, Soumis F (1988) The multiple vehicle dial-a-ride-problem. In: Daduna J, Wren A (eds.) Computer-Aided Transit Scheduling. Lecture Notes in Economics and Mathematical Systems. Springer, Berlin, vol. 308, 15–27Google Scholar
  61. 61.
    Desrosiers J, Dumas Y, Soumis F, Taillefer S, Villeneuve D (1991) An algorithm for mini-clustering in handicapped transport. Tech. Rep. G-91-02, HEC, Montréal, CanadaGoogle Scholar
  62. 62.
    Dial R (1995) Autonomous dial-a-ride transit introductory overview. Transport Res C-Emer 3:261–275Google Scholar
  63. 63.
    Diana M (2004) Innovative systems for the transportation disadvantaged: towards more efficient and operationally usable planning tools. Transport Plan Tech 27:315–331Google Scholar
  64. 64.
    Diana M (2006) The importance of information flows temporal attributes for the efficient scheduling of dynamic demand responsive transport services. J Adv Transport 40:23–46CrossRefGoogle Scholar
  65. 65.
    Diana M, Dessouky M, Xia N (2006) A model for the fleet sizing of demand responsive transportation services with time windows. Transport Res B-Meth 40:651–666Google Scholar
  66. 66.
    Diana M, Dessouky MM (2004) A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows. Transport Res B-Meth 38:539–557Google Scholar
  67. 67.
    Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 1:269–271Google Scholar
  68. 68.
    Doerner K, Hartl RF, Reimann M (2001) Ants solve time constrained pickup and delivery problems with full truckloads. In: Operations Research Proceedings 2000. 395–400Google Scholar
  69. 69.
    Dror M, Fortin D, Roucairol C (1998) Redistribution of self-service electric cars: A case of pickup and delivery. Tech. Rep. W.P. 3543, INRIA-Rocquencourt, Rocquencourt, FranceGoogle Scholar
  70. 70.
    Dumas Y, Desrosiers J, Soumis F (1989) Large scale multi-vehicle dial-a-ride problems. Tech. Rep. G-89-30, HEC, Montréal, CanadaGoogle Scholar
  71. 71.
    Dumas Y, Desrosiers J, Soumis F (1991) The pickup and delivery problem with time windows. Eur J Oper Res 54:7–22Google Scholar
  72. 72.
    Dumitrescu I (2005) Polyhedral results for the pickup and delivery travelling salesman problem. Tech. Rep. CRT-2005-27, CRT, Université Montréal, CanadaGoogle Scholar
  73. 73.
    Elmberg CM (1978) Dial-a-ride with customer operated dispatching. Transportation 7:35–43Google Scholar
  74. 74.
    Escudero LF (1988) An inexact algorithm for the sequential ordering problem. Eur J Oper Res 37:232–253Google Scholar
  75. 75.
    Fabri A, Recht P (2006) On dynamic pickup and delivery vehicle routing with several time windows and waiting times. Transport Res B-Meth 40:335–350Google Scholar
  76. 76.
    Fagerholt K (2001) Ship scheduling with soft time windows: An optimisation based approach. Eur J Oper Res 131:559–571Google Scholar
  77. 77.
    Fagerholt K, Christiansen M (2000a) A combined ship scheduling and allocation problem. J Oper Res Soc 51:834–842Google Scholar
  78. 78.
    Fagerholt K, Christiansen M (2000b) A travelling salesman problem with allocation, time window and precedence constraints – an application to ship scheduling. Int Trans Oper Res 7:231–244Google Scholar
  79. 79.
    Feuerstein E, Stougie L (2001) On-line single-server dial-a-ride problems. Theor Comput Sci 268:91–105Google Scholar
  80. 80.
    Fleischmann B, Gnutzmann S, Sandvoß E (2004) Dynamic vehicle routing based on online traffic information. Transport Sci 38:420–433Google Scholar
  81. 81.
    Fu L (2002a) Scheduling dial-a-ride paratransit under time varying, stochastic congestion. Transport Res B-Meth 36:485–506Google Scholar
  82. 82.
    Fu L (2002b) A simulation model for evaluating advanced dial-a-ride paratransit systems. Transport Res A-Pol 36:291–307Google Scholar
  83. 83.
    Gambardella LM, Dorigo M (2000) Ant colony system hybridized with a new local search for the sequential ordering problem. INFORMS J Comput 12:237–255Google Scholar
  84. 84.
    Garey RM, Johnson DS (1979) Computers and intractability. A guide to the theory of NP-completeness. Bell Laboratories, Murray Hill, NJGoogle Scholar
  85. 85.
    Gendreau M, Guertin F, Potvin J, Seguin R (2006) Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries. Transport Res C-Emer 14:157–174Google Scholar
  86. 86.
    Gendreau M, Laporte G, Vigo D (1999) Heuristics for the traveling salesman problem with pickup and delivery. Comput Oper Res 26:699–714Google Scholar
  87. 87.
    Gendreau M, Potvin JY (1998) Dynamic vehicle routing and dispatching. In: Crainic T, Laporte G (eds.) Fleet Management and Logistics. Kluwer, New York, 115–126Google Scholar
  88. 88.
    Ghiani G, Guerriero F, Laporte G, Musmanno R (2003) Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies. Eur J Oper Res 151:1–11Google Scholar
  89. 89.
    Glover F (1996) Ejection chains, reference structures and alternating path methods for traveling salesman problems. Descrete Appl Math 65:223–253Google Scholar
  90. 90.
    Gronalt M, Hartl RF, Reimann M (2003) New savings based algorithms for time constrained pickup and delivery of full truckloads. Eur J Oper Res 151:520–535Google Scholar
  91. 91.
    Gronalt M, Hirsch P (2007) Log-truck scheduling with a tabu search strategy. In: Doerner KF, Gendreau M, Greistorfer P, Gutjahr W, Hartl RF, Reimann M (eds.) Metaheuristics: Progress in Complex Systems Optimization. Springer, New York, Operations Research/Computer Science Interfaces, vol. 39, 65–88Google Scholar
  92. 92.
    Gutenschwager K, Böse J, Voss S (2003) Effiziente Prozesse im kombinierten Verkehr – Ein neuer Lösungsansatz zur Disposition von Portalkränen. Logistik Management 5:62–73Google Scholar
  93. 93.
    Gutenschwager K, Niklaus C, Voss S (2004) Dispatching of an electronic monorail system: Applying metaheuristics to an online pickup and delivery problem. Transport Sci 38:434–446Google Scholar
  94. 94.
    Hauptmeier D, Krumke SO, Rambau J (2000) The online dial-a-ride problem under reasonable load. In: Algorithms and Complexity: 4th Italian Conference, CIAC 2000, Rome, Italy, March 2000. Proceedings. Springer, LNCS, 125–136Google Scholar
  95. 95.
    Healy P, Moll R (1995) A new extension of local search applied to the dial-a-ride problem. Eur J Oper Res 83:83–104Google Scholar
  96. 96.
    Hernández-Pérez H, Salazar-González JJ (2003) The one-commodity pickup-and-delivery travelling salesman problem. In: Jünger M, Reinelt G, Rinaldi G (eds.) Combinatorial Optimization – Eureka, You Shrink! Springer, LNCS, vol. 2570, 89–104Google Scholar
  97. 97.
    Hernández-Pérez H, Salazar-González JJ (2004a) A branch-and cut algorithm for the traveling salesman problem with pickup and delivery. Discrete Appl Math 145:126–139Google Scholar
  98. 98.
    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–255Google Scholar
  99. 99.
    Ho SC, Haugland D (2004) Local search heuristics for the probabilistic dial-a-ride problem. Tech. Rep. 286, University of BergenGoogle Scholar
  100. 100.
    Horn MET (2002a) Fleet scheduling and dispatching for demand-responsive passenger services. Transport Res C-Emer 10:35–63Google Scholar
  101. 101.
    Horn MET (2002b) Multi-modal and demand-responsive passenger transport systems: a modelling framework with embedded control systems. Transport Res A-Pol 36:167–188Google Scholar
  102. 102.
    Hunsaker B, Savelsbergh MWP (2002) Efficient feasibility testing for dial-a-ride problems. Oper Res Lett 30:169–173Google Scholar
  103. 103.
    Imai A, Nishimura E, Current J (2007) A Lagrangian relaxation-based heuristic for the vehicle routing with full container load. Eur J Oper Res 176:87–105Google Scholar
  104. 104.
    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–78Google Scholar
  105. 105.
    Jaillet P, Stafford M (2001) Online searching. Oper Res 49:501–515Google Scholar
  106. 106.
    Jaw J, 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 B-Meth 20:243–257Google Scholar
  107. 107.
    Jih WR, Hsu YJ (1999) Dynamic vehicle routing using hybrid genetic algorithms. In: Proceedings of the 1999 IEEE International Conference on Robotics and Automation. IEEE Computer Society, Los Alamitos, CA, 453–458Google Scholar
  108. 108.
    Jordan W (1987) Truck backhauling on networks with many terminals. Transport Res B-Meth 21:183–193Google Scholar
  109. 109.
    Jordan WC, Burns LD (1984) Truck backhauling on two terminal networks. Transport Res B-Meth 18:487–503Google Scholar
  110. 110.
    Jorgensen RM, Larsen J, Bergvinsdottir KB (2007) Solving the dial-a-ride problem using genetic algorithms. J Oper Res Soc 58:1321–1331Google Scholar
  111. 111.
    Jung S, Haghani A (2000) A genetic algorithm for a pick-up and delivery problem with time windows. Transport Res Rec 1733:1–7Google Scholar
  112. 112.
    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–386Google Scholar
  113. 113.
    Kikuchi S (1984) Scheduling of demand-responsive transit vehicles. J Transp Eng 110:511–520Google Scholar
  114. 114.
    Kikuchi S, Rhee J (1989) Scheduling algorithms for demand-responsive transportation system. J Transp Eng 115:630–645Google Scholar
  115. 115.
    Krumke SO, de Paepe WE, Poensgen D, Lipmann M, Marchetti-Spaccamela A, Stougie L (2005) On minimizing the maximum flow time in the online dial-a-ride problem. In: Approximation and Online Algorithms: Third International Workshop, WAOA 2005, Palma de Mallorca, Spain, October 6-7, 2005, Revised Selected Papers. Springer, LNCS, 258–269Google Scholar
  116. 116.
    Kubo M, Kasugai H (1990) Heuristic algorithms for the single vehicle dial-a-ride problem. J Oper Res Soc Japan 33:354–365Google Scholar
  117. 117.
    Landrieu A, Mati Y, Binder Z (2001) A tabu search heuristic for the single vehicle pickup and delivery problem with time windows. J Intell Manuf 12:497–508Google Scholar
  118. 118.
    Lau HC, Liang Z (2001) Pickup and delivery with time windows : Algorithms and test case generation. In: IEEE Computer Society, eds, 13th IEEE International Conference on Tools with Artificial Intelligence (ICTAI’01). 333–340Google Scholar
  119. 119.
    Lau HC, Liang Z (2002) Pickup and delivery with time windows : Algorithms and test case generation. Int J Artif Intell Tools 11:455–472Google Scholar
  120. 120.
    le Blanc I, van Krieken M, Krikke H, Fleuren H (2006) Vehicle routing concepts in the closed-loop container network of ARN – a case study. OR Spectrum 28:53–71Google Scholar
  121. 121.
    Li H, Lim A (2001) A metaheuristic for the pickup and delivery problem with time windows. In: 13th IEEE International Conference on Tools with Artificial Intelligence (ICTAI’01). IEEE Computer Society, Los Alamitos, CA, 333–340Google Scholar
  122. 122.
    Li H, Lim A, Huang J (2001) Local search with annealing-like restarts to solve the VRPTW. Tech. rep., Department of Computer Science, National University of SingaporeGoogle Scholar
  123. 123.
    Lim A, Wang F, Xu Z (2005) The capacitated traveling salesman problem with pickups and deliveries on a tree. In: Deng X, Du D (eds.) Algorithms and Computation: 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005. Proceedings. 1061–1070Google Scholar
  124. 124.
    Lim H, Lim A, Rodrigues B (2002) Solving the pickup and delivery problem with time windows using squeaky wheel optimization with local search. In: American Conference on Information Systems, AMICS 2002, Dallas, USAGoogle Scholar
  125. 125.
    Lin S (1965) Computer solutions of the traveling salesman problem. AT&T Tech J 44:2245–2269Google Scholar
  126. 126.
    Lipmann M, Lu X, de Paepe WE, Sitters RA, Stougie L (2004) On-line dial-a-ride problems under a restricted information model. Algorithmica 40:319–329Google Scholar
  127. 127.
    Little J, Murty K, Sweeney D, Karel C (1963) An algorithm for the traveling salesman problem. Oper Res 11:972–989Google Scholar
  128. 128.
    Lokin FCJ (1978) Procedures for traveling salesman problems with additional constraints. Eur J Oper Res 3:135–141Google Scholar
  129. 129.
    Lu Q, Dessouky MM (2004) An exact algorithm for the multiple vehicle pickup and delivery problem. Transport Sci 38:503–514Google Scholar
  130. 130.
    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:672–687Google Scholar
  131. 131.
    Lübbecke ME (2004) Combinatorially simple pickup and delivery paths. Cent Eur J Oper Res 12:405–417Google Scholar
  132. 132.
    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–208Google Scholar
  133. 133.
    Mageean J, Nelson JD (2003) The evaluation of demand responsive transport services in Europe. J Transport Geogr 11:255–270Google Scholar
  134. 134.
    Malca F, Semet F (2004) A tabu search algorithm for a dynamic pickup and delivery vehicle routing problem. In: Triennal Symposium on Transportation Analysis, Le Gosier, Guadeloupe, France, juin.Google Scholar
  135. 135.
    Maniezzo V, Carbonaro A, Hildmann H (2004) An ANTS heuristic for the long-term car pooling problem. In: Onwuboulu G, Babu B (eds.) New Optimization Techniques in Engineering. Springer, Heidelberg Berlin, 411–430Google Scholar
  136. 136.
    Melachrinoudis E, Ilhan AB, Min H (2007) A dial-a-ride problem for client transportation in a health-care organization. Comput Oper Res 34:742–759Google Scholar
  137. 137.
    Mitrović-Minić S (1998) Pickup and delivery problem with time windows: A survey. Tech. Rep. SFU CMPT TR 1998-12, School of Computing Science, Simon Fraser University, Burnaby, BC, CanadaGoogle Scholar
  138. 138.
    Mitrović-Minić S, Krishnamurti R, Laporte G (2004) Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows. Transport Res B-Meth 38:669–685Google Scholar
  139. 139.
    Mitrović-Minić S, Laporte G (2004) Waiting strategies for the dynamic pickup and delivery problem with time windows. Transport Res B-Meth 38:635–655Google Scholar
  140. 140.
    Mitrović-Minić S, Laporte G (2006) The pickup and delivery problem with time windows and transshipment. INFOR 44:217–227Google Scholar
  141. 141.
    Mosheiov G (1994) The traveling salesman problem with pickup and delivery. Eur J Oper Res 79:299–310Google Scholar
  142. 142.
    Nanry WP, Barnes W (2000) Solving the pickup and delivery problem with time windows using reactive tabu search. Transport Res B-Meth 34:107–121Google Scholar
  143. 143.
    Noda I (2005) Scalability of dial-a-ride systems: A case study to assess utilities of ubiquitous mass user support. In: Ishida T, Gasser L, Nakashima H (eds.) Massively Multi-Agent Systems I: First International Workshop, MMAS 2004, Kyoto, Japan, December 10-11, 2004, Revised Selected and Invited Papers. Massively Multi-agent Systems in Public Space. Springer, LNCS, 323–334Google Scholar
  144. 144.
    Noda I, Ohta M, Shinoda K, Kumad Y, Nakashima H (2003) Evaluation of usability of dial-a-ride systems by social simulation. In: Hales D, Edmonds B, Norling E, Rouchier J (eds.) Multi-Agent-Based Simulation III. MABS Techniques for Real World Modelling. Springer, LNCS, 167–181Google Scholar
  145. 145.
    Palmer K, Dessouky MM, Abdelmaguid T (2004) Impacts of management practices and advanced technologies on demand responsive transit systems. Transport Res A-Pol 38:495–509Google Scholar
  146. 146.
    Pankratz G (2005a) Dynamic vehicle routing by means of a genetic algorithm. Int J Phys Distrib Logist Manag 35:362–383Google Scholar
  147. 147.
    Pankratz G (2005b) A grouping genetic algorithm for the pickup and delivery problem with time windows. OR Spectrum 27:21–41Google Scholar
  148. 148.
    Parragh SN, Cordeau JF, Doerner KF, Hartl RF (2008) Algorithms for the heterogeneous dial-a-ride problem. Working paperGoogle Scholar
  149. 149.
    Parragh SN, Doerner KF, Gandibleux X, Hartl RF (2007) A heuristic two-phase solution approach for the multi-objective dial-a-ride problem. Working paperGoogle Scholar
  150. 150.
    Pisinger D, Ropke S (2007) A general heuristic for vehicle routing problems. Comput Oper Res 34:2403–2435Google Scholar
  151. 151.
    Popken DA (2006) Controlling order circuity in pickup and delivery problems. Transport Res E-Log 42:431–443Google Scholar
  152. 152.
    Potvin JY, Rousseau JM (1992) Constrained-directed search for the advance request dial-a-ride problem with service quality constraints. In: Balci O, Shrada R, Zenios ZA (eds.) Computer Science and Operations Research: New Developments in their Interfaces. Pergamon Press, Oxford, 457–574Google Scholar
  153. 153.
    Potvin JY, Rousseau JM (1993) A parallel route building algorithm for the vehicle routing and scheduling problem with time windows. Eur J Oper Res 66:331–340Google Scholar
  154. 154.
    Potvin JY, Shen Y, Dufour G, Rousseau JM (1995) Learning techniques for an expert vehicle dispatching system. Expert Systems with Applications 8:101–109Google Scholar
  155. 155.
    Powell WB, Jaillet P, Odoni A (1995) Stochastic and dynamic networks and routing. In: Ball MO, Magnanti TL, Monma CL, Nemhauser GL (eds.) Network Routing. Elsevier (North-Holland), Amsterdam, Handbooks in Operations Research and Management Science, vol. 8, 141–296Google Scholar
  156. 156.
    Powell WB, Snow W, Cheung RK (2000a) Adaptive labeling algorithms for the dynamic assignment problem. Transport Sci 34:50–66Google Scholar
  157. 157.
    Powell WB, Towns MT, Marar A (2000b) On the value of optimal myopic solutions for dynamic routing and scheduling problems in the presence of user noncompliance. Transport Sci 34:67–85Google Scholar
  158. 158.
    Psaraftis HN (1980) A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem. Transport Sci 14:130–154Google Scholar
  159. 159.
    Psaraftis HN (1983a) Analysis of an O|n2| heuristic for the single vehicle many-to-many Euclidean dial-a-ride problem. Transport Res B-Meth 17:133–145Google Scholar
  160. 160.
    Psaraftis HN (1983b) An exact algorithm for the single vehicle many to many dial-a-ride problem with time windows. Transport Sci 17:351–357Google Scholar
  161. 161.
    Psaraftis HN (1983c) k-interchange procedures for local search in a precedence-constrained routing problem. Eur J Oper Res 13:391–402Google Scholar
  162. 162.
    Psaraftis HN (1986) Scheduling large-scale advance-request dial-a-ride systems. Am J Math Manag Sci 6:327–367Google Scholar
  163. 163.
    Psaraftis HN (1988) Dynamic vehicle routing problems. In: Golden BL, Assad AA (eds.) Vehicle Routing: Methods and Studies. Elsevier (North-Holland), Amsterdam, 223–248Google Scholar
  164. 164.
    Rebibo KK (1974) A computer controlled dial-a-ride system. traffic control and transportation systems. In: Proceedings of 2nd IFAC/IFIP/IFORS Symposium Monte Carlo, September 1974. North-Holland, AmsterdamGoogle Scholar
  165. 165.
    Recker WW (1995) The household activity pattern problem: General formulation and solution. Transport Res B-Meth 29:61–77Google Scholar
  166. 166.
    Regan AC, Mahmassani HS, Jaillet P (1996a) Dynamic decision making for commercial fleet operations using real-time information. Transport Res Rec 1537:91–97Google Scholar
  167. 167.
    Regan AC, Mahmassani HS, Jaillet P (1996b) Dynamic dispatching strategies under real-time information for carrier fleet management. In: Lesort JB (ed.) Transportation and Traffic Theory. Pergamon, U.K., 737–756Google Scholar
  168. 168.
    Regan AC, Mahmassani HS, Jaillet P (1998) Evaluation of dynamic fleet management systems: Simulation framework. Transport Res Rec 1645:176–184Google Scholar
  169. 169.
    Reinelt G (1991) TSPLIB-A traveling salesman problem library. ORSA J Comp 3:376–384Google Scholar
  170. 170.
    Rekiek B, Delchambre A, Saleh HA (2006) Handicapped person transportation: An application of the grouping genetic algorithm. Eng Appl Artif Intel 19:511–520Google Scholar
  171. 171.
    Renaud J, Boctor FF, Laporte G (1996) A fast composite heuristic for the symmetric traveling salesman problem. INFORMS J Comput 8:134–143Google Scholar
  172. 172.
    Renaud J, Boctor FF, Laporte G (2002) Perturbation heuristics for the pickup and delivery traveling salesman problem. Comput Oper Res 29:1129–1141Google Scholar
  173. 173.
    Renaud J, Boctor FF, Ouenniche J (2000) A heuristic for the pickup and delivery traveling salesman problem. Comput Oper Res 27:905–916Google Scholar
  174. 174.
    Ropke S, Cordeau JF (2006) Branch-and-cut-and-price for the pickup and delivery problem with time windows. Tech. Rep. CRT-2006-21, CRT, Université Montréal, CanadaGoogle Scholar
  175. 175.
    Ropke S, Cordeau JF, Laporte G (2007) Models and branch-and-cut algorithms for pickup and delivery problems with time windows. Networks 49:258–272Google Scholar
  176. 176.
    Ropke S, Pisinger D (2006a) An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transport Sci 40:455–472Google Scholar
  177. 177.
    Ropke S, Pisinger D (2006b) A unified heuristic for a large class of vehicle routing problems with backhauls. Eur J Oper Res 171:750–775Google Scholar
  178. 178.
    Roy S, Rousseau J, Lapalme G, Ferland J (1985a) Routing and scheduling for the transportation of disabled persons : The algorithm. Tech. Rep. TP 5596E, CRT, Montréal, CanadaGoogle Scholar
  179. 179.
    Roy S, Rousseau JM, Lapalme G, Ferland J (1985b) Routing and scheduling for the transportation of disabled persons : The tests. Tech. Rep. TP 5598E, CRT, Montréal, CanadaGoogle Scholar
  180. 180.
    Ruland KS, Rodin EY (1997) The pickup and delivery problem: Faces and branch-and-cut algorithm. Comput Math Appl 33:1–13Google Scholar
  181. 181.
    Russell RA, Challinor PE (1988) Effective methods for petroleum tank truck dispatching. Comput Oper Res 15:323–331Google Scholar
  182. 182.
    Savelsbergh MWP, Sol M (1995) The general pickup and delivery problem. Transport Sci 29:17–29Google Scholar
  183. 183.
    Savelsbergh MWP, Sol M (1998) DRIVE: Dynamic routing of independent vehicles. Oper Res 46:474–490Google Scholar
  184. 184.
    Schönberger J, Kopfer H, Mattfeld DC (2003) A combined approach to solve the pickup and delivery selection problem. In: Leopold-Wildburger U, Rendl F, Wäscher G (eds.) Operations Research Proceedings 2002. Springer, Berlin-Heidelberg-New York, 150–155Google Scholar
  185. 185.
    Sexton T, Bodin LD (1985a) Optimizing single vehicle many-to-many operations with desired delivery times: I. Scheduling. Transport Sci 19:378–410Google Scholar
  186. 186.
    Sexton T, Bodin LD (1985b) Optimizing single vehicle many-to-many operations with desired delivery times: II. Routing. Transport Sci 19:411–435Google Scholar
  187. 187.
    Sexton TR, Choi YM (1986) Pickup and delivery of partial loads with ’’soft’’ time windows. Am J Math Manag Sci 6:369–398Google Scholar
  188. 188.
    Shang JS, Cuff CK (1996) Multicriteria pickup and delivery problem with transfer opportunity. Comput Ind Eng 30:631–645Google Scholar
  189. 189.
    Shen Y, Potvin JY, Rousseau JM, Roy S (1995) A computer assistant for vehicle dispatching with learning capabilities. Ann Oper Res 61:189–211Google Scholar
  190. 190.
    Shinoda K, Noda I, Ohta M, Kumada Y, Nakashima H (2003) Is dial-a-ride bus reasonable in large scale towns? Evaluation of usability of dial-a-ride systems by simulation. In: Kurumatani K, Chen SH, Ohuchi A (eds.) Multiagent for Mass User Support: First International Workshop, MAMUS-03 Acapulco, Mexico, August 2003. Springer, LNCS, 105–119Google Scholar
  191. 191.
    Sigurd M, Pisinger D, Sig M (2004) Scheduling transportation of live animals to avoid the spread of diseases. Transport Sci 38:197–209Google Scholar
  192. 192.
    Solomon M (1987) Algorithms for the vehicle routing problem with time windows. Oper Res 35:254–265Google Scholar
  193. 193.
    Stein DM (1978a) An asymptotic probabilistic analysis of a routing problem. Math Oper Res 3:89–101Google Scholar
  194. 194.
    Stein DM (1978b) Scheduling dial-a-ride transportation systems. Transport Sci 12:232–249Google Scholar
  195. 195.
    Swihart MR, Papstavrou JD (1999) A stochastic and dynamic model for the single-vehicle pick-up and delivery problem. Eur J Oper Res 114:447–464Google Scholar
  196. 196.
    Teixeira DB, Karash KH (1975) An evaluation of councils on aging dial-a-ride systems in Massachusetts. Transportation 4:105–121Google Scholar
  197. 197.
    Teodorovic D, Radivojevic G (2000) A fuzzy logic approach to dynamic dial-a-ride problem. Fuzzy Set Sys 116:23–33Google Scholar
  198. 198.
    Thangiah SR, Awan A (2006) Real-time split-delivery pickup and delivery time window problems with transfer. Tech. Rep. SRT90-2006, Artificial Intelligence Robotics Lab, Slippery Rock University, PAGoogle Scholar
  199. 199.
    Toth P, Vigo D (1996) Fast local search algorithms for the handicapped persons transportation problem. In: Osman IH, Kelly JP (eds.) Metaheuristics: Theory and Applications. Kluwer, Boston, MA, 677–690Google Scholar
  200. 200.
    Toth P, Vigo D (1997) Heuristic algorithms for the handicapped persons transportation problem. Transport Sci 31:60–71Google Scholar
  201. 201.
    Uchimura K, Saitoh T, Takahashi H (1999) The dial-a-ride problem in a public transit system. Electron Commun Jpn 82:30–38Google Scholar
  202. 202.
    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–311CrossRefGoogle Scholar
  203. 203.
    Van Hentenryck P, Bent R (2006) Online stochastic combinatorial optimization. MIT Press, Cambridge, MAGoogle Scholar
  204. 204.
    Wang F, Lim A, Xu Z (2006) The one-commodity pickup and delivery travelling salesman problem on a path or a tree. Networks 48:24–35Google Scholar
  205. 205.
    Wang X, Regan AC (2002) Local truckload pickup and delivery with hard time window constraints. Transport Res B-Meth 36:97–112Google Scholar
  206. 206.
    Wilson H, Colvin N (1977) Computer control of the Rochester dial-a-ride system. Tech. Rep. R-77-31, Department of Civil Engineering. MIT Cambridge, MAGoogle Scholar
  207. 207.
    Wilson H, Sussman J, Wang H, Higonnet B (1971) Scheduling algorithms for dial-a-ride system. Tech. Rep. USL TR-70-13, Urban Systms Laboratory, MIT, Cambridge, MA.Google Scholar
  208. 208.
    Wilson H, Weissberg H (1967) Advanced dial-a-ride algorithms research project: Final report. Tech. Rep. R76-20, Department of Civil Engineering. MIT, Cambridge, MAGoogle Scholar
  209. 209.
    Wolfler Calvo R, Colorni A (2007) An effective and fast heuristic for the dial-a-ride problem. 4OR 5:61–73Google Scholar
  210. 210.
    Wolfler Calvo R, De Luigi F, Haastrup P, Maniezzo V (2004) A distributed geographic information system for the daily car pooling problem. Comput Oper Res 31:2263–2278Google Scholar
  211. 211.
    Wong KI, Bell MGH (2006) Solution of the dial-a-ride problem with multi-dimensional capacity constraints. Int Trans Oper Res 13:195–208Google Scholar
  212. 212.
    Xiang Z, Chu C, Chen H (2006) A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints. Eur J Oper Res 174:1117–1139Google Scholar
  213. 213.
    Xiang Z, Chu C, Chen H (2008) The study of a dynamic dial-a-ride problem under time dependent stochastic environments. Eur J Oper Res 185:534–551Google Scholar
  214. 214.
    Xu H, Chen ZL, Rajagopal S, Arunapuram S (2003) Solving a practical pickup and delivery problem. Transport Sci 37:347–364Google Scholar
  215. 215.
    Yang J, Jaillet P, Mahmassani H (2004) Real-time multivehicle truckload pickup and delivery problems. Transport Sci 38:135–148Google Scholar
  216. 216.
    Yang J, Jaillet P, Mahmassani HS (1998) On-line algorithms for truck fleet assignment and scheduling under real-time information. Transport Res Rec 1667:107–113Google Scholar
  217. 217.
    Yi F, Tian L (2005) On the online dial-a-ride problem with time-windows. In: Megiddo N, Xu Y, Zhu B (eds.) Algorithmic Applications in Management: First International Conference, AAIM 2005, Xian, China, June 22-25, 2005. Proceedings. Springer, LNCS, 85–94Google Scholar

Copyright information

© © Wirtschaftsuniversität Wien, Austria 2008

Authors and Affiliations

  • Sophie N. Parragh
    • 1
  • Karl F. Doerner
    • 1
  • Richard F. Hartl
    • 1
  1. 1.Institut für BetriebswirtschaftslehreUniversität WienWienAustria

Personalised recommendations