Optimal Scheduling Policies for Some Simple Transportation Systems

Arnold Barnett and Daniel J. Kleitman
Additional contact information
Arnold Barnett: Massachusetts Institute of Technology, Cambridge, Massachusetts
Daniel J. Kleitman: Massachusetts Institute of Technology, Cambridge, Massachusetts

Transportation Science, 1973, vol. 7, issue 1, 85-99

Abstract: A transportation system is operated with one vehicle and several service points. Travel times between adjacent stops are random variables whose distribution functions are unchanged over a given period of time. The problem is to devise the scheduling strategy that minimizes average waiting time for passengers of the system. From the calculus of variations, and the principles advanced by Osuna and Newell for dealing with such problems, we are able to obtain a precise and simple statement of optimal policy for systems with one terminal stop at which interval control can be exerted. The special case of a two-stop line is analyzed in detail. An approximate optimal policy for systems with two terminals, very closely related to the one-terminal optimal strategy, is also suggested.

Date: 1973
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.7.1.85 (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:7:y:1973:i:1:p:85-99

Access Statistics for this article

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