Minimum Cost Schedules for a Public Transportation Route II. Examples

V. F. Hurdle
Additional contact information
V. F. Hurdle: University of California, Berkeley, California

Transportation Science, 1973, vol. 7, issue 2, 138-157

Abstract: A fleet of vehicles carries passengers in one direction on a public transportation route, then returns to the dispatch point after a travel time T . The arrival rate of passengers is a known deterministic function of time and the objective is to devise a schedule that minimizes the total cost for passenger waiting time and vehicle operations. The optimal schedules for a number of hypothetical examples are found by applying principles derived in Part I and a procedure is given for constructing suboptimal schedules in cases where it is difficult to construct the optimal schedule.

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

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.7.2.138 (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:2:p:138-157

Access Statistics for this article

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