Skip to main content
SpringerLink
Log in
Book cover

Computer-Aided Transit Scheduling pp 15–27Cite as

The Multiple Vehicle DIAL-A-RIDE Problem

  • Conference paper

Part of the book series: Lecture Note in Economics Mathematical Systems ((LNE,volume 308))

Abstract

This article examines the use of mathematical optimization algorithms to construct vehicle routes in a large scale multi-vehicle many-to-many system in the context of the transportation of the handicapped. The main contributions of this paper are the innovative concept of the mini-clusters, the generalisation of the column generation algorithm for the m-TSP with time windows (Desrosiers, Soumis and Desrochers [11]) to solve problems with several depots and availability constraints, and in addition, a method of decomposition into time slices to handle very large problems.

The multiple vehicle many-to-many routing problem is presented in the context of a dial-a-ride system. It is solved by mini-clustering first and optimal routing second. A heuristic mini-cluster algorithm groups together nearby customers who can be efficiently served by the same vehicle route segment. An optimal column generation algorithm then constructs routes corresponding to drivers’ workdays by stringing together these vehicle route segments. Problems with up to 200 customers and 85 mini-clusters are easily solved. Larger problems are solved by dividing the day into time slices and applying the algorithm several times.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Armstrong, G.R.; Garfinkel, R.S.: Dynamic programming solution of the single and multiple pick-up and delivery problem with application to dial-a-ride. Working Paper #162, College of Business Administration, University of Tennessee, Knoxville, Tennessee 1982

    Google Scholar 

  2. Bélisle, J.P.; Soumis, F.; Roy, S.; Desrosiers, J., Dumas, Y.; Rousseau, J.M.: The impact on vehicle routing of various operational rules of a transportation system for handicapped Persons. Third International Conference on Mobility and Transport of Elderly and Handicapped Persons, Office of the Secretary of Transportation, Washington D.C. 1986, 6.47-6.50.

    Google Scholar 

  3. Bodin, L.; Golden, B.; Assad, A.; Ball, M.: Routing and scheduling of vehicles and crews — The state of the art. Computers & Operation Research 10 (1983), 63–211.

    Article  Google Scholar 

  4. Bodin, L.; Sexton, T.: The multi-vehicle subscriber dial-a-ride problem. The delivery of urban services, TIMS Studies in the Management Sciences 22 (1986), 73–86.

    Google Scholar 

  5. Desrochers, M.; Soumis, F.: A generalized permanent labelling algorithm for the shortest path problem with time windows. Publication #394A, Centre de recherche sur les transports, Université de Montréal, Montréal 1985

    Google Scholar 

  6. Desrochers, M.; Soumis, F.: A reoptimization algorithm for the shortest path problem with Time windows. Publication #397A, Centre de recherche sur les transports, Université de Montréal, Montréal 1985

    Google Scholar 

  7. Desrochers, M.; Lenstra, J.K.; Savelsbergh, M.W.P.; Soumis, F.: Vehicle routing with time windows: Optimization and approximation. (Forthcoming in TIMS Studies in the Management Science) 1987

    Google Scholar 

  8. Desrosiers, J.; Dumas, Y.; Soumis, F.: 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 (1986), 301–325.

    Google Scholar 

  9. Desrosiers, J.; Pelletier, J.P.; Soumis, F.: Plus court chemin avec contraintes d’horaires. R.A.I.R.O. Recherche opérationnelle 17 (1984), 357–377.

    Google Scholar 

  10. Desrosiers, J.; Sauve, M.; Soumis, F.: Lagrangian relaxation methods for solving the minimum fleet size multiple traveling salesman problem with time windows. Publication #396, Centre de recherche sur les transports, Université de Montréal, Montréal (Forthcoming in Management Science) 1985

    Google Scholar 

  11. Desrosiers, J.; Soumis, F.; Desrochers, M.: Routing with time windows by column generation. Networks 14 (1984), 545–565.

    Article  Google Scholar 

  12. Dumas, Y.: Confection d’itinéraires de véhicules en vue du transport de plusieurs origines à plusieurs destinations. Publication #434, Centre de recherche sur les transports, Université de Montréal, Montréal 1985

    Google Scholar 

  13. Jaw, J.; Odoni, A.; Psaraftis, H.; Wilson, N.: A heuristic algorithm for the multi-vehicle advanced request dial-a-ride problem with time windows. Transportation Research 20B (1986), 243–257.

    Google Scholar 

  14. Kolen, A.; Rinnooy Kan, A.; Trienekens, H.: Vehicle routing with time windows. Working Paper, Erasmus University, Rotterdam 1985

    Google Scholar 

  15. Land, A. H.; Powell, S.: Fortran codes for mathematical programming: Linear, quadratic and discrete. John Wiley & Sons; London 1973.

    Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  18. Psaraftis, H.: Analysis of an O(N 2) heuristic for the single vehicle many-to-Many Euclidian dial-a-ride problem. Transportation Research, 17B (1983), 133–145.

    Google Scholar 

  19. Roy, S.; Rousseau, J.M.; Lapalme, G.; Ferland, J.A.: Routing and Scheduling for the transportation of disabled person — The Algorithm. TP 5596E, Transport Canada, Transport Development Centre, Montréal 1984

    Google Scholar 

  20. Roy, S.; Rousseau, J.M.; Lapalme, G.; Ferland, J.A.: Routing and scheduling for the transportation of disabled persons — The Tests. TP 5598E, Transport Canada, Transport Development Centre, Montréal 1984

    Google Scholar 

  21. Savelsbergh, M.: Local search in routing problem with time windows. Report OS-R8409, Center for Mathematics and Computer Science, Amsterdam 1984

    Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  24. Solomon, M.: On the worst-case performance of some heuristics for the vehicle Routing and scheduling problem with time window constraints. Networks 16 (1986), 161–174.

    Article  Google Scholar 

  25. Solomon, M.: Algorithms for the vehicle routing and scheduling problem with time window constraints. (Forthcoming in Operations Research) 1986

    Google Scholar 

  26. Solomon, M.; Desrosiers, J.: Time Window constrained routing and scheduling Problems: A Survey. (Forthcoming in Transportation Science) 1987

    Google Scholar 

  27. Sorensen, B.: Interactive distribution planning. Ph.D. Thesis, The Institute of Mathematical Statistics and Operations Research, Lyngby 1986

    Google Scholar 

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

    Article  Google Scholar 

  29. Swersey, A.J.; Ballard, W.: Scheduling school buses. Management Science 30 (1984), 844–853.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Ecole des Hautes Études Commerciales, Montréal, Québec, Canada

    Jacques Desrosiers

  2. Centre de recherche sur les transports, Montréal, Québec, Canada

    Yvan Dumas

  3. École Polytechnique, Montréal, Québec, Canada

    François Soumis

Authors
  1. Jacques Desrosiers
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yvan Dumas
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. François Soumis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. TREUARBEIT Unternehmensberatung GmbH, New-York-Ring 13, D-2000, Hamburg, Germany

    Joachim R. Daduna

  2. Operational Research Unit School of Computer Studies, University of Leeds, Leeds, LS2 9JT, Great Britain

    Anthony Wren (Senior Lecturer) (Senior Lecturer)

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Desrosiers, J., Dumas, Y., Soumis, F. (1988). The Multiple Vehicle DIAL-A-RIDE Problem. In: Daduna, J.R., Wren, A. (eds) Computer-Aided Transit Scheduling. Lecture Note in Economics Mathematical Systems, vol 308. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-85966-3_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-85966-3_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19441-5

  • Online ISBN: 978-3-642-85966-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation