Skip to main content
SpringerLink
Log in

Local search heuristics for the probabilistic dial-a-ride problem

  • Regular Article
  • Published:
OR Spectrum Aims and scope Submit manuscript

Abstract

This paper introduces the probabilistic dial-a-ride problem, and describes an efficient request-relocation neighborhood evaluation procedure for the problem. The running time of the procedure is \({\mathcal{O}(n^5)}\) , compared to \({\mathcal{O}(n^6)}\) for a straightforward approach. For solving the problem we embed the suggested evaluation procedure in a pure local search heuristic and in a tabu search heuristic. The quality of the solutions obtained by the two heuristics have been compared experimentally. Computational results confirm that our neighborhood evaluation technique is much faster than the straightforward one, and for cases with 144 users and 4 vehicles it is demonstrated that the computation time can be reduced by a factor larger than 27.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Attanasio A, Cordeau J-F, Ghiani G, Laporte G (2004) Parallel tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem. Parallel Comput 30(3): 377–387

    Article  Google Scholar 

  • Beraldi P, Ghiani G, Laporte G, Musmanno R (2005) Efficient neighborhood search for the probabilistic pickup and delivery travelling salesman problem. Networks 45(4): 195–198

    Article  Google Scholar 

  • Bertsimas DJ (1988) Probabilistic combinatorial optimization problems, PhD thesis. Massachusetts Institute of Technology, Cambridge

  • Bertsimas DJ, Jaillet P, Odoni AR (1990) A priori optimization. Oper Res 38(6): 1019–1033

    Article  Google Scholar 

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

  • Coffin M, Saltzman MJ (2000) Statistical analysis of computational tests of algorithms and heuristics. INFORMS J Comput 12(1): 24–44

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Cordeau J-F, Gendreau M, Laporte G (1997) A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30(2): 105–119

    Article  Google Scholar 

  • Cordeau J-F, Laporte G (2003a) The dial-a-ride problem: variants, modeling issues and algorithms. Quart J Belgian Fr Italian Oper Res Soc 1: 89–101

    Google Scholar 

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

    Article  Google Scholar 

  • Cordeau J-F, Laporte G (2007) The dial-a-ride problem: models and algorithms. Ann Oper Res 153(1): 29–46

    Article  Google Scholar 

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

    Article  Google Scholar 

  • 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 Society for Industrial and Applied Mathematics, pp 225–242

  • Diana M, Dessouky MM (2004) A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows. Transp Res B 38(6): 539–557

    Article  Google Scholar 

  • Gendreau M, Hertz A, Laporte G (1994) A tabu search heuristic for the vehicle routing problem. Manag Sci 40(10): 1276–1290

    Article  Google Scholar 

  • Gendreau M, Laporte G, Séguin R (1996) Stochastic vehicle routing. Eur J Oper Res 88(1): 3–12

    Article  Google Scholar 

  • Glover F (1986) Future paths for integer programming and links to artificial intelligence. Comput Oper Res 13(5): 533–549

    Article  Google Scholar 

  • Glover F (1989) Tabu search - Part 1. ORSA J Comput 1(3): 190–206

    Google Scholar 

  • Glover F (1997) Tabu search and adaptive memory programming—advances, applications and challenges. In: Barr RS, Helgason RV, Kennington JL (eds) Interfaces in computer science and operations research. Kluwer, pp 1–75

  • Glover F, Laguna M (1997) Tabu search. Kluwer, Boston

    Book  Google Scholar 

  • Healy P, Moll R (1995) A new extension of local search applied to the dial-a-ride problem. Eur J Oper Res 83(1): 83–104

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Jaillet P (1985) Probabilistic traveling salesman problem, PhD thesis. Massachusetts Institute of Technology, Cambridge

  • Jaillet P (1988) A priori solution of a traveling salesman problem in which a random subset of the customers are visited. Oper Res 36(6): 929–936

    Article  Google Scholar 

  • 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. Transp Res B 20(3): 243–257

    Article  Google Scholar 

  • Jorgensen RM, Larsen J, Bergvinsdottir KB (2007) Solving the dial-a-ride problem using genetic algorithms. J Oper Res Soc 58(10): 1321–1331

    Article  Google Scholar 

  • Kenyon A (2000) A survey on stochastic location and routing problems. Technical Report 183, Technische Universität Graz, Austria

  • Laporte G, Louveaux FV, Mercure H (1994) A priori optimization of the probabilistic traveling salesman problem. Oper Res 42(3): 543–549

    Article  Google Scholar 

  • Lu Q, Dessouky MM (2004) An exact algorithm for the multiple vehicle pickup and delivery problem. Transp Sci 38(4): 503–514

    Article  Google Scholar 

  • Madsen OB, 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(1–4): 193–208

    Article  Google Scholar 

  • Parragh SN, Doerner KF, Gandibleux X, Hartl RF (2007) Approaching the pareto-frontier of the multi-objective dial-a-ride problem. Presented at ROUTE 2007

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Savelsbergh M (1992) The vehicle routing problem with time windows: minimizing route duration. ORSA J Comput 4: 146–156

    Google Scholar 

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

    Article  Google Scholar 

  • Sexton TR, Bodin LD (1985a) Optimizing single vehicle many-to-many operations with desired delivery times: I. Scheduling. Transp Sci 19(4): 378–410

    Article  Google Scholar 

  • Sexton TR, Bodin LD (1985b) Optimizing single vehicle many-to-many operations with desired delivery times: II. Routing. Transp Sci 19(4): 411–435

    Article  Google Scholar 

  • Taillard ÉD (1993) Parallel iterative search methods for vehicle routing problems. Networks 23(8): 661–673

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Waters CDJ (1989) Vehicle-scheduling problems with uncertainty and omitted customers. J Oper Res Soc 40(12): 1099–1108

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CORAL, Department of Business Studies, Aarhus School of Business, Aarhus University, Fuglesangs Allé 4, 8210, Århus V, Denmark

    Sin C. Ho

  2. Department of Informatics, University of Bergen, Postboks 7800, 5020, Bergen, Norway

    Dag Haugland

Authors
  1. Sin C. Ho
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dag Haugland
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sin C. Ho.

Additional information

This work was supported by the Research Council of Norway under grant 127533/432. This support is gratefully acknowledged. Thanks are also due to two anonymous referees for their valuable comments.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ho, S.C., Haugland, D. Local search heuristics for the probabilistic dial-a-ride problem. OR Spectrum 33, 961–988 (2011). https://doi.org/10.1007/s00291-009-0175-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00291-009-0175-6

Keywords

Search

Navigation