The Minimum Fleetsize for a Suburban Railway System

Franz J. M. Salzborn
Additional contact information
Franz J. M. Salzborn: University of Adelaide, Adelaide, South Australia

Transportation Science, 1970, vol. 4, issue 4, 383-402

Abstract: A mathematical method is developed for minimizing the number of railcars that is needed for the peak operations of a suburban railway system by cutting railcars back from stations along the lines in an optimum way. A secondary objective is the minimization of the total driver time. A mathematical proof is given of the fact that the total number of railcars required is equal to the maximum number of railcars simultaneously in operation; and this theorem leads to the formulation of the minimization problem as a set of linear zero-one-programs. A case study demonstrates the practical usefulness of the method by applying it to an existing railway system.

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

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.4.4.383 (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:4:y:1970:i:4:p:383-402

Access Statistics for this article

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