THE MULTIPLE VEHICLE DIAL-A-RIDE PROBLEM. FROM THE BOOK COMPUTER-AIDED TRANSIT SCHEDULING

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.

• Availability:
  • Find a library where document is available. Order URL: http://worldcat.org/isbn/038719441X
• Supplemental Notes:
  • Proceedings of the Fourth International Workshop on Computer-Aided Scheduling of Public Transport, Hamburg, July 28-31, 1987.
• Corporate Authors:

  Springer Verlag

  175 5th Avenue
  New York, NY  United States  10010
• Authors:
  • Desrosiers, J
  • Dumas, Y
  • Soumis, F
• Publication Date: 1988

Media Info

• Features: References; Tables;
• Pagination: p. 15-27
• Monograph Title: Computer-Aided Transit Scheduling. Proceedings of the Fourth International Workshop on Computer-Aided Scheduling of Public Transport, Hamburg, Germany, July 28-31, 1987

Subject/Index Terms

• TRT Terms: Algorithms; Bus routes; Computers; Mathematical models; Paratransit services; Scheduling
• Uncontrolled Terms: Computer aided scheduling
• Subject Areas: Operations and Traffic Management; Public Transportation;

Filing Info

• Accession Number: 00484136
• Record Type: Publication
• ISBN: 038719441X
• Files: TRIS
• Created Date: May 31 1989 12:00AM