An analytic investigation into the fundamental aspects of scheduling "Dial-a-Ride" transportation systems is conducted. Based upon simple mathematical models that focus on the combinatorial nature of the problem, a class of algorithms is derived for which performance can be measured in a precise asymptotic probabilistic sense. It is concluded that the approach yields many qualitative insights and the resulting transportation schemes have modest computational requirements, are decentralized, and are easy to visualize and implement.

  • Availability:
  • Corporate Authors:

    Operations Research Society of America

    428 East Preston Street
    Baltimore, MD  United States  21202
  • Authors:
    • STEIN, D M
  • Publication Date: 1978-8

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00195331
  • Record Type: Publication
  • Source Agency: Engineering Index
  • Files: TRIS
  • Created Date: Aug 28 1981 12:00AM