Citation

Sinha KC, Lingaraj BP, Chatterjee A. Transp. Plann. Tech. 1976; 3(2): 81-90.

Copyright

(Copyright © 1976, Informa - Taylor and Francis Group)

DOI

10.1080/03081067608717095

PMID

unavailable

Abstract

The paper presents a technique for determining headways for transit routes, which is the first task in the overall scheduling procedure. Based on an optimization approach, a chance constrained programming model is developed. The scope of using vehicles of different sizes and operating costs is built into the model, which attempts to minimize the total operating cost. The uncertainty associated with demand forecasts is expressed as a chance constraint that specifies the desired level of reliability with respect to the satisfaction of demand. The model also includes a constraint related to the management policy regarding the minimum service to be provided on a transit route. The deterministic equivalent of the model is solved by linear programming and its application is demonstrated with an example problem. This report was prepared as part of a program of Research and Training in Urban Transportation at Marquette University sponsored by the Urban Mass Transportation Administration of the U.S. Department of Transportation. The results and views expressed are not necessarily concurred in by the sponsoring agency.