Scheduling Dial-a-Ride Transportation Systems

David M. Stein
Additional contact information
David M. Stein: IBM T. J. Watson Research Center, Yorktown Heights, New York

Transportation Science, 1978, vol. 12, issue 3, 232-249

Abstract: 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. The approach yields many qualitative insights and the resulting transportation schemes have many attractive practical features. For example, they have modest computational requirements, are decentralized, and are easy to visualize and implement.

Date: 1978
References: Add references at CitEc
Citations: View citations in EconPapers (22)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.12.3.232 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:12:y:1978:i:3:p:232-249

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().