zbMATH — the first resource for mathematics

Dynamic pickup and delivery problems. (English) Zbl 1176.90048
Summary: In the last decade, there has been an increasing body of research in dynamic vehicle routing problems. This article surveys the subclass of those problems called dynamic pickup and delivery problems, in which objects or people have to be collected and delivered in real-time. It discusses some general issues as well as solution strategies.

90B06 Transportation, logistics and supply chain management
90B35 Deterministic scheduling theory in operations research
90C35 Programming involving graphs or networks
Full Text: DOI
[1] Anily, S.; Hassin, R., The swapping problem, Networks, 22, 419-433, (1992) · Zbl 0763.90080
[2] Ascheuer, N., Krumke, S.O., Rambau, J., 2000. Online dial-a-ride problems: Minimizing the completion time. In: STACS 2000. Lecture Notes in Computer Science, vol. 1770. Springer, Berlin, pp. 639-650. · Zbl 0971.68621
[3] Attanasio, A.; Cordeau, J.-F.; Ghiani, G.; Laporte, G., Parallel tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem, Parallel computing, 30, 377-387, (2004)
[4] Beaudry, A., Laporte, G., Melo, T., Nickel, S., in press. Dynamic transportation of patients in hospitals. OR Spectrum. · Zbl 1181.90173
[5] Berbeglia, G.; Cordeau, J.-F.; Gribkovskaia, I.; Laporte, G., Static pickup and delivery problems: A classification scheme and survey, Top, 15, 1-31, (2007) · Zbl 1121.90001
[6] Borodin, A.; El-Yaniv, R., Online computation and competitive analysis, (2005), Cambridge University Press Cambridge
[7] Branke, J.; Middendorf, M.; Noeth, G.; Dessouky, M., Waiting strategies for dynamic vehicle routing, Transportation science, 39, 298-312, (2005)
[8] Cordeau, J.-F.; Laporte, G., The dial-a-ride problem: models and algorithms, Annals of operations research, 153, 29-46, (2007) · Zbl 1157.90353
[9] Cordeau, J.-F.; Laporte, G.; Potvin, J.-Y.; Savelsbergh, M.W.P., Transportation on demand, (), 429-466
[10] Coslovich, L.; Pesenti, R.; Ukovich, W., A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem, European journal of operational research, 175, 1605-1615, (2006) · Zbl 1142.90323
[11] Feuerstein, E.; Stougie, L., On-line single-server dial-a-ride problems, Theoretical computer science, 268, 91-105, (2001) · Zbl 0984.68003
[12] Gendreau, M.; Guertin, F.; Potvin, J.-Y.; Séguin, R., Neighborhood search heuristics for a dynamic vehicle dispatching problem with Pick-ups and deliveries, Transportation research part C, 14, 157-174, (2006)
[13] Ghiani, G.; Guerriero, F.; Laporte, G.; Musmanno, R., Real-time vehicle routing: solution concepts, algorithms and parallel computing strategies, European journal of operational research, 151, 1-11, (2003) · Zbl 1033.90014
[14] Ghiani, G.; Manni, E.; Quaranta, A.; Triki, C., Anticipatory algorithms for same-day courier dispatching, Transportation research part E, 45, 96-106, (2009)
[15] Gutenschwager, K.; Niklaus, C.; Voß, S., Dispatching of an electric monorail system: applying metaheuristics to an online pickup and delivery problem, Transportation science, 38, 434-446, (2004)
[16] Hauptmeier, D., Krumke, S.O., Rambau, J., 2000. The online dial-a-ride problem under reasonable load. In: Proceedings of Algorithms and Complexity, Fourth Italian Conference. Lecture Notes in Computer Science, vol. 1767. Springer, Berlin, pp. 125-136. · Zbl 0971.68636
[17] Horn, M.E.T., Fleet scheduling and dispatching for demand-responsive passenger services, Transportation research part C, 10, 35-63, (2002)
[18] Hvattum, L.M.; Løkketangen, A.; Laporte, G., Solving a dynamic and stochastic vehicle routing problem with a sample scenario hedging heuristic, Transportation science, 40, 421-438, (2006)
[19] Hvattum, L.M.; Løkketangen, A.; Laporte, G., A branch-and-regret heuristic for stochastic and dynamic vehicle routing problems, Networks, 49, 330-340, (2007) · Zbl 1141.90337
[20] Ichoua, S.; Gendreau, M.; Potvin, J.-Y., Diversion issues in real-time vehicle dispatching, Transportation science, 34, 426-438, (2000) · Zbl 0991.90529
[21] Ichoua, S.; Gendreau, M.; Potvin, J.-Y., Exploiting knowledge about future demands for real-time vehicle dispatching, Transportation science, 40, 211-225, (2006)
[22] Jaillet, P.; Wagner, M.R., Online routing problems: value of advanced information as improved competitive ratios, Transportation science, 40, 200-210, (2006)
[23] Jaillet, P.; Wagner, M.R., Online vehicle routing problems: A survey, (), 221-237 · Zbl 1187.90055
[24] Jaw, J.J.; Odoni, A.R.; Psaraftis, H.N.; Wilson, N.H.M., A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows, Transportation research part B, 20, 243-257, (1986)
[25] Larsen, A., 2001. The dynamic vehicle routing problem. Ph.D. Thesis, Institute of Mathematical Modelling, Technical University of Denmark.
[26] Lipmann, M.; Lu, X.; de Paepe, W.E.; Sitters, R.A.; Stougie, L., On-line dial-a-ride problems under restricted information model, Algorithmica, 40, 319-329, (2004) · Zbl 1070.90072
[27] Lund, K., Madsen, O.B.G., Solomon, M.M., 1996. Vehicle routing problems with varying degrees of dynamism. Technical Report, Institute of Mathematical Modelling, Technical University of Denmark.
[28] Madsen, O.B.G.; Ravn, H.F.; Rygaard, J.M., A heuristic algorithm for a dial-a-ride problem with time windows multiple capacities and multiple objectives, Annals of operations research, 60, 193-208, (1995) · Zbl 0839.90033
[29] Mes, M.; van der Heijden, M.; van Harten, A., Comparison of agent-based scheduling to look-ahead heuristics for real-time transportation problems, European journal of operational research, 181, 59-75, (2007) · Zbl 1121.90023
[30] Mitrović-Minić, S.; Krishnamurti, R.; Laporte, G., Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows, Transportation research part B, 38, 669-685, (2004)
[31] Mitrović-Minić, S.; Laporte, G., Waiting strategies for the dynamic pickup and delivery problem with time windows, Transportation research part B, 38, 635-655, (2004)
[32] Powell, W.B., An operational planning model for the dynamic vehicle allocation problem with uncertain demands, Transportation research part B, 21, 217-232, (1987)
[33] Powell, W.B.; Bouzanene-Ayari, B.; Simpo, H.P., Dynamic models for freight transportation, (), 285-365
[34] Powell, W.B.; Sheffi, Y.; Nickerson, K.S.; Butterbaugh, K.; Atherton, S., Maximizing profits for north American Van lines’ truckload division: A new framework for pricing and operations, Interfaces, 18, 1, 21-41, (1988)
[35] Psaraftis, H.N., A dynamic programming approach to the single-vehicle many-to-many immediate request dial-a-ride problem, Transportation science, 14, 130-154, (1980)
[36] Psaraftis, H.N., Dynamic vehicle routing problems, (), 223-248
[37] Pureza, V.; Laporte, G., Waiting and buffering strategies for the dynamic pickup and delivery problem with time windows, Infor, 46, 165-175, (2008)
[38] Regan, A.C.; Mahmassani, H.S.; Jaillet, P., Evaluation of dynamic fleet management systems, Transportation research record, 1645, 176-184, (1998)
[39] Sáez, D.; Cortés, C.; Núñez, A., Hybrid adaptive predictive control for the multi-vehicle dynamic Pick-up and delivery problem based on genetic algorithms and fuzzy clustering, Computers and operations research, 35, 3412-3438, (2008) · Zbl 1159.90314
[40] Savelsbergh, M.W.P.; Sol, M., DRIVE: dynamic routing of independent vehicles, Operations research, 46, 474-490, (1998) · Zbl 0987.90511
[41] Swihart, M.R.; Papastavrou, J.D., A stochastic and dynamic model for the single-vehicle Pick-up and delivery problem, European journal of operational research, 114, 447-464, (1999) · Zbl 0949.90006
[42] Thomas, B.W., Waiting strategies for anticipating service requests from known customer locations, Transportation science, 41, 319-331, (2007)
[43] Tjokroamidjojo, D.; Kutanoglu, E.; Taylor, G.D., Quantifying the value of advance load information in truckload trucking, Transportation research part E, 42, 340-357, (2006)
[44] Van Hentenryck, P.; Bent, R.W., Online stochastic combinatorial optimization, Operations research, 52, 977-987, (2004) · Zbl 1165.90600
[45] Waisanen, H.A.; Shah, D.; Dahleh, M.A., A dynamic pickup and delivery problem in mobile networks under information constraints, IEEE transactions on automatic control, 53, 1419-1433, (2008) · Zbl 1367.90034
[46] Waisanen, H.A., Shah, D., Dahleh, M.A., submitted for publication. Fundamental performance limits for multi-stage vehicle routing problems.
[47] Xiang, Z.; Chu, C.; Chen, H., The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments, European journal of operational research, 185, 534-551, (2008) · Zbl 1137.90339
[48] Yang, J.; Jaillet, P.; Mahmassani, H.S., On-line algorithms for truck fleet assignment and scheduling under real-time information, Transportation research record, 1667, 107-113, (1998)
[49] Yang, J.; Jaillet, P.; Mahmassani, H.S., Real-time multivehicle truckload pickup and delivery problems, Transportation science, 38, 135-148, (2004)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.