Summary
In one-to-onePickup and Delivery Problems (PDPs), the aim is to design a set of least cost vehicle routes starting and ending at a common depot in order to satisfy a set of pickup and delivery requests between location pairs, subject to side constraints. Each request originates at one location and is destined for one other location. These requests apply to the transportation of goods or people, in which case the problem is often called the dial-a-ride problem. In recent years, there have been several significant developments in the area of exact and heuristic algorithms for PDPs. The purpose of this chapter is to report on these developments. It contains two main sections devoted to single vehicle and multi-vehicle problems, respectively. Each section is subdivided into two parts, one on exact algorithms and one on heuristics.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Balas E, Fischetti M, and Pulleyblank WR (1995) The precedence-constrained asymmetric traveling salesman polytope.Mathematical Programming 68:241–265
Bent R and Van Hentenryck P (2006) A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows.Computers & Operations Research 33:875–893
Berbeglia G, Cordeau J-F, Gribkovskaia I, and Laporte G (2007) Static pickup and delivery problems: A classification scheme and survey.TOP 15:1–31
Bianco L, Mingozzi A, and Ricciardelli S (1994) Exact and heuristic procedures for the traveling salesman problem with precedence constraints, based on dynamic programming.INFOR 32:19–31
Bodin LD and Sexton T (1986). The multi-vehicle subscriber dial-a-ride problem.TIMS Studies in Management Science 26:73–86
Borndörfer R, Grötschel M, Klostermeier F, and Küttner C (1997)Telebus Berlin: Vehicle scheduling in a dial-a-ride system. Technical Report SC 97–23, Konrad-Zuse-Zentrum für Informationstechnik Berlin
Brønmo G, Christiansen M, Fagerholt K, and Nygreen B (2007) A multi-start local search heuristic for ship scheduling – a computational study.Computers & Operations Research 34:900–917
Carrabs F (2006)Heuristics and exact approaches for transportation problems with pickup and delivery. Ph.D. Thesis, Universitá di Salermo, Italy
Carrabs F, Cerulli R, and Cordeau J-F (2006) An additive branch-and-bound algorithm for the pickup and delivery traveling salesman problem with LIFO loading. Submitted for publication
Carrabs F, Cordeau J-F, and Laporte G (2006) Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading.INFORMS Journal on Computing forthcoming
Cassani L and Righini G (2004) Heuristic Algorithms for the TSP with rear-loading. Presented at the 35th Annual Conference of the Italian Operations Research Society (AIRO XXXV), Lecce, Italy
Christiansen M and Nygreen B (1998a) A method for solving ship routing problems with inventory constraints.Annals of Operations Research 81:357–378
Christiansen M and Nygreen B (1998b) Modelling path flows for a combined routing and inventory management problem.Annals of Operations Research 82:391–412
Cordeau J-F (2006) A branch-and-cut algorithm for the dial-a-ride problem.Operations Research 54:573–586
Cordeau J-F, Gendreau M, and Laporte G (1997) A tabu search heuristic for periodic and multi-depot vehicle routing problems.Networks 30:105–119
Cordeau J-F, Iori M, Laporte G, and Salazar-González JJ (2006) A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading. Submitted for publication
Cordeau J-F and Laporte G (2003) A tabu search heuristic for the static multi-vehicle dial-a-ride problem.Transportation Research B 37:579–594
Cordeau J-F and Laporte G (2007) The dial-a-ride problem: Models and algorithms.Annals of Operations Research 153:29–46
Cordeau J-F, Laporte G, and Mercier A (2001) A unified tabu search heuristic for vehicle routing problems with time windows.Journal of the Operational Research Society 52:928–936
Cordeau J-F, Laporte G, Potvin J-Y, and Savelsbergh MWP (2007) Transportation on demand. In: Barnhart C and Laporte G (eds.)Transportation, Handbooks in Operations Research and Management Science, Volume 14, pages 429–466, North-Holland, Amsterdam
Croes G (1958) A method for solving traveling salesman problems.Operations Research 6:791–812
Cullen FH, Jarvis JJ, and Ratliff HD (1981) Set partitioning based heuristics for interactive routing.Networks 11:125–143
Desaulniers G, Desrosiers J, Erdmann A, Solomon MM, and Soumis F (2002) VRP with pickup and delivery.In: Toth P and Vigo D (eds.)The Vehicle Routing Problem, pages 225–242, SIAM Monographs on Discrete Mathematics and Applications, Philadelphia
Desrochers M and Laporte G (1991) Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints.Operations Research Letters 10:27–36
Desrosiers J, Dumas Y, and Soumis F (1986) A dynamic programming solution of the large-scale single-vehicle dial-a-ride problem with time windows.American Journal of Mathematical and Management Sciences 6:301–325
Desrosiers J, Dumas Y, Soumis F, Taillefer S, and Villeneuve D (1991) An algorithm for mini-clustering in handicapped transport.Les Cahiers du GERAD, G–91–02, HEC Montréal
Dumas Y, Desrosiers J, and Soumis F (1991) The pickup and delivery problem with time windows.European Journal of Operational Research 54:7–22
Dumas Y, Desrosiers J, and Soumis F (1989) Large scale multi-vehicle dial-a-ride problems.Les Cahiers du GERAD, G–89–30, HEC Montréal
Dumitrescu I, Ropke S, Cordeau J-F, and Laporte G (2006) The traveling salesman problem with pickup and deliveries: Polyhedral results and branch-and-cut algorithm. Submitted for publication
Fischetti M and Toth P (1989) An additive bounding procedure for combinatorial optimization problems.Operations Research 37:319–328
Fisher ML and Rosenwein MB (1989) An interactive optimization system for bulk-cargo ship scheduling.Naval Research Logistic Quarterly 35:27–42
Gendreau M, Hertz A, and Laporte G (1994) A tabu search heuristic for the vehicle routing problem.Management Science 40:1276–1290
Gribkovskaia I and Laporte G (2007) One-to-many-to-one single vehicle pickup and delivery problems. This volume
Grötschel M and Padberg MW (1985) Polyhedral theory. In: Lawler EL, Lenstra JK, Rinnooy Kan AHG and Shmoys DB (eds.)The Traveling Salesman Problem, pages 251–305, Wiley, Chichester
Hernández-Pérez H and Salazar-González JJ (2004) Heuristics for the one-commodity pickup-and-delivery traveling salesman problem.Transportation Science 38:245–255
Hernández-Pérez H and Salazar-González JJ (2007) The one-commodity pickup-and-delivery traveling salesman problem: Inequalities and algorithms.Networks forthcoming
Jaw J, Odoni AR, Psaraftis HM, and Wilson NHM (1986) A heuristic algorithm for the multi-vehicle advance-request dial-a-ride problem with time-windows.Transportation Research B 20:243–257
Kalantari B, Hill AV, and Arora SR (1985) An algorithm for the traveling salesman problem with pickup and delivery customers.European Journal of Operational Research 22:377–386
Kohl N, Desrosiers J, Madsen OBG, Solomon MM, and Soumis F (1999) 2-path cuts for the vehicle routing problem with time windows.Transportation Science 33:101–116
Landrieu A, Mati Y, and Binder Z (2001) A tabu search heuristic or the single vehicle pickup and delivery problem with time windows.Journal of Intelligent Manufacturing 12:497–508
Laporte G, Nobert Y, and Desrochers M (1985) Optimal routing under capacity and distance restrictions.Operations Research 33:1050–1073
Lawler EL, Lenstra JK, Rinnooy Kan AHG and Shmoys DB (1985)The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, Wiley, Chichester
Levitin G and Abezgaouz R (2003) Optimal routing and multiple-load AGV subject to LIFO loading constraints.Computers & Operations Research 30:397–410
Li H and Lim A (2001) A Metaheuristic for the pickup and delivery problem with time windows.The 13th IEEE Conference on Tools with Artificial Intelligence, ICTAI-2001, Dallas, pages 160–170
Lin S and Kerninghan BW (1973) An effective heuristic algorithm for the traveling-salesman problem.Operations Research 21:498–516
Lu Q and Dessouky MM (2006) A new insertion-based construction heuristic for solving the pickup and delivery problem with time-windows.European Journal of Operational Research 175:672–687
Lysgaard J (2006) Reachability cuts for the vehicle routing problem with time windows.European Journal of Operational Research 175:210–233
Madsen OBG, Ravn HF, and Rygaard JM (1995) A heuristic algorithm for the dial-a-ride problem with time windows, multiple capacities, and multiple objectives.Annals of Operations Research 60:193–208
Mitrović-Minić S, Krishnamurti R, and Laporte G (2004) Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows.Transportation Research Part B 38:669–685
Mitrović-Minić S and Laporte G (2004) Waiting strategies for the dynamic pickup and delivery problem with time windows.Transportation Research Part B 38:635–655
Mladenović N and Hansen P (1997) Variable neighborhood search.Computers & Operations Research 24:1097–1100
Nanry WP and Barnes JW (2000) Solving the pickup and delivery problem with time windows using reactive tabu search.Transportation Research B 34:107–121
Nowak M, Ergun O, and White CC (2006) Pickup and delivery with split loads. Submitted for publication
Pacheco JA (1995) Problemas de rutas con carga y descarga en sistemas LIFO: Soluciones exactas.Estudios de Economía Aplicada 3:69–86
Pankratz G (2005) A grouping genetic algorithm for the pickup and delivery problem with time windows.Operations Research Spectrum 27:21–41
Pisinger D and Ropke S (2007) A general heuristic for vehicle routing problems.Computers & Operations Research 34:2403–2435
Rappoport HK, Levy LS, Golden BL, and Toussaint K (1992) A planning heuristic for military airlift.Interfaces 22(3):73–87
Rappoport HK, Levy LS, Toussaint K, and Golden BL (1994) A transportation problem formulation for the MAC airlift planning problem.Annals of Operations Research 50:505–523
Reinelt G (1991) TSPLIB – A traveling salesman problem library.ORSA Journal on Computing 3:376–384
Rekiek B, Delchambre A, and Saleh HA (2006) Handicapped person transportation problem: An application of the grouping genetic algorithm.Engineering Applications of Artificial Intelligence 19:511–520
Renaud J, Boctor FF, and Laporte G (2002) Perturbation heuristics for the pickup and delivery traveling salesman problem.Computers & Operations Research 29:1129–1141
Ropke S, Cordeau J-F, and Laporte G (2007) Models and branch-and-cut algorithms for pickup and delivery problems with time windows.Networks 49:258–272
Ropke S and Cordeau J-F (2006) Branch-and-cut-and-price for the pickup and delivery problem with time windows. Submitted toTransportation Science
Ropke S and Pisinger D (2006) An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows.Transportation Science 40:455–472
Ruland KS (1994)Polyhedral solution to the pickup and delivery problem.Ph.D. Thesis, Sever Institute, Washington University in St.Louis, MO
Ruland KS and Rodin EY (1997) The pickup and delivery problem: Faces and branch-and-cut algorithm.Computers and Mathematics with Applications 33:1–13
Savelsbergh MWP (1992) The vehicle routing problem with time windows: Minimizing route duration.ORSA Journal on Computing 4:146–154
Savelsbergh MWP and Sol M (1998) Drive: Dynamic routing of independent vehicles.Operations Research 46:474–490
Shaw P (1998) Using constraint programming and local search methods to solve vehicle routing problems. In:CP-98 (Fourth International Conference on Principles and Practice of Constraint Programming), vol. 1520 ofLecture Notes in Computer Science, pages 417–431
Shen Y, Potvin J-Y, Rousseau J-M, and Roy S (1995) A computer assistant for vehicle dispatching with learning capabilities.Annals of Operations Research 61:189–211
Sol M (1994)Column generation for pickup and delivery problems. Ph.D. Thesis, Technische Universiteit Eindhoven
Solanki RS and Southworth F (1991) An execution planning algorithm for military airlift.Interfaces 21(4):121–131
Taillard ÉD (1993) Parallel iterative search methods for vehicle routing problems.Networks 23:661–673
Toth P and Vigo D (1996) Fast local search algorithms for the handicapped persons transportation problem. In: Osman IH, Kelly JP (eds)Meta-Heuristics: Theory and Applications, pages 677–690, Kluwer, Boston
Toth P and Vigo D (1997) Heuristic algorithms for the handicapped persons transportation problem.Transportation Science 31:60–71
Toth P and Vigo D (2002)The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications, Philadelphia
Van der Bruggen LJJ, Lenstra JK, and Schuur PC (1993) Variable-depth search for the single-vehicle pickup and delivery problem with time windows.Transportation Science 27:298–311
Wilson NHM, Sussman J, Wong H, and Higonnet B (1971)Scheduling algorithms for dial-a-ride systems. Technical Report USL TR–70–13, Urban Systems Laboratory, Massachusetts Institute of Technology, Cambridge, MA
Wilson NHM and Weissberg H (1976)Advanced dial-a-ride algorithms research project: Final report. Technical Report R76–20, Department of Civil Engineering, Massachusetts Institute of Technology, Cambridge, MA
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Cordeau, JF., Laporte, G., Ropke, S. (2008). Recent Models and Algorithms for One-to-One Pickup and Delivery Problems. In: Golden, B., Raghavan, S., Wasil, E. (eds) The Vehicle Routing Problem: Latest Advances and New Challenges. Operations Research/Computer Science Interfaces, vol 43. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-77778-8_15
Download citation
DOI: https://doi.org/10.1007/978-0-387-77778-8_15
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-77777-1
Online ISBN: 978-0-387-77778-8
eBook Packages: Business and EconomicsBusiness and Management (R0)