Skip to main content
SpringerLink
Log in

A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

The paper describes a system for the solution of a static dial-a-ride routing and scheduling problem with time windows (DARPTW). The problem statement and initialization of the development project was made by the Copenhagen Fire-Fighting Service (CFFS). The CFFS needed a new system for scheduling elderly and disabled persons, involving about 50.000 requests per year. The problem is characterized by, among other things, multiple capacities and multiple objectives. The capacities refer to the fact that a vehicle may be equipped with e.g. normal seats, children seats or wheel chair places. The objectives relate to a number of concerns such as e.g. short driving time, high vehicle utilization or low costs. A solution algorithm REBUS based on an insertion heuristics was developed. The algorithm permits in a flexible way weighting of the various goals such that the solution reflects the user's preferences. The algorithm is implemented in a dynamic environment intended for on-line scheduling. Thus, a new request for service is treated in less than 1 second, permitting an interactive user interface.

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

  1. L.D. Bodin, B.L. Golden, A. Assad and M.O. Ball, Routing and scheduling of vehicles and crews: The state of the art, Computers and Operations Research 10(1983)63–211.

    Google Scholar 

  2. L.L. Christensen and J.K. Jensen, Transportation of patients — a dynamic dial-a-ride system (in Danish), Report EP 25/91, IMSOR, The Institute of Mathematical Statistics and Operations Research, The Technical University of Denmark, DK-2800 Lyngby, Denmark (1991).

  3. C. Daganzo, An approximate analytic model of many-to-many demand responsive transportation systems, Transportation Research 12(1978)325–333.

    Google Scholar 

  4. J. Desrosiers, Y. Dumas and F. Soumis, A dynamic programming solution of the large-scale single-vehicle dial-a-ride problem with time windows, The American Journal of Mathematical and Management Sciences 6(1986)301–325.

    Google Scholar 

  5. I. Ioachim, J. Desrosiers, Y. Dumas and M.M. Solomon, A request clustering algorithm for door-to-door transportation, GERAD Report-91-50, 5255 Avenue Decelles, Montréal, Canada H3T 1V6 (1991).

  6. J.-J. Jaw, A.R. Odoni, H.N. Psaraftis and N.H.M. Wilson, A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows, Transportation Research 20B(1986)243–257.

    Google Scholar 

  7. H.N. Psaraftis, A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem, Transportation Science 14(1980)130–154.

    Google Scholar 

  8. H.N. Psaraftis, An exact algorithm for the single vehicle many-to-many dial-a-ride problem with time windows, Transportation Science 17(1983)351–357.

    Google Scholar 

  9. H.N. Psaraftis,k-interchange procedures for local search in a precedence-constrained routing problem, European Journal of Operational Research 13(1983)391–402.

    Google Scholar 

  10. H.N. Psaraftis, Analysis of anO(N 2) heuristic for the single vehicle many-to-many Euclidean dial-a-ride problem, Transportation Research 17B(1983)133–145.

    Google Scholar 

  11. H.N. Psaraftis, Scheduling large-scale advance request dial-a-ride systems, The American Journal of Mathematical and Management Sciences 6(1986)327–368.

    Google Scholar 

  12. S. Roy, J.M. Rousseau, G. Lapalme and J.A. Ferland, Routing and scheduling for the transportation of disabled persons — the algorithm, CRT Report 412A, Université de Montréal, Montréal, Québec, Canada H3C 3J7 (1985).

  13. T. Sexton and L. Bodin, Optimizing single vehicle many-to-many operations with desired delivery times: I. Scheduling, Transportation Science 19(1986)378–410.

    Google Scholar 

  14. T. Sexton and L. Bodin, Optimizing single-vehicle many-to-many operations with desired delivery times: II. Routing, Transportation Science 19(1986)411–435.

    Google Scholar 

  15. T. Sexton and Y. Choi, Pick-up and delivery with partial loads with “soft” time windows, The American Journal of Mathematical and Management Sciences 6(1986)369–388.

    Google Scholar 

  16. D.M. Stein, An asymptotic, probabilistic analysis of a routing problem, Mathematics of Operations Research 3(1978)89–101.

    Google Scholar 

  17. D.M. Stein, Scheduling dial-a-ride transportation systems, Transportation Science 12(1978)232–249.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IMM, Institute of Mathematical Modelling, The Technical University of Denmark, Building 321, DK-2800, Lyngby, Denmark

    Oli B. G. Madsen, Hans F. Ravn & Jens Moberg Rygaard

Authors
  1. Oli B. G. Madsen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hans F. Ravn
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jens Moberg Rygaard
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

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. Ann Oper Res 60, 193–208 (1995). https://doi.org/10.1007/BF02031946

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02031946

Keywords

Search

Navigation