Please use this identifier to cite or link to this item:
https://repository.iimb.ac.in/handle/2074/11790
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Sinha, Kumares C | |
dc.contributor.author | Lingaraj, B P | |
dc.contributor.author | Chatterjee, Arun | |
dc.date.accessioned | 2020-04-23T14:24:55Z | - |
dc.date.available | 2020-04-23T14:24:55Z | - |
dc.date.issued | 1976 | |
dc.identifier.issn | 0308-1060 | |
dc.identifier.issn | 1029-0354 | |
dc.identifier.uri | https://repository.iimb.ac.in/handle/2074/11790 | - |
dc.description.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. | |
dc.publisher | Taylor and Francis | |
dc.subject | Optimization Model | |
dc.subject | Headway Determination | |
dc.subject | Transit Planning | |
dc.subject | Optimal Headways | |
dc.subject | Scheduling | |
dc.subject | Chance Constrained Programming | |
dc.title | An optimization model for determining headways for transit routes | |
dc.type | Journal Article | |
dc.identifier.doi | 10.1080/03081067608717095 | |
dc.pages | 81 -90p. | |
dc.vol.no | Vol.3 | - |
dc.issue.no | Iss.2 | - |
dc.journal.name | Transportation Planning and Technology | |
Appears in Collections: | 1974-1979 |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.