Show simple item record

contributor authorPrabhat Shrivastav
contributor authorS. L. Dhingra
date accessioned2017-05-08T22:05:16Z
date available2017-05-08T22:05:16Z
date copyrightAugust 2001
date issued2001
identifier other18664526.pdf
identifier urihttp://yetl.yabesh.ir/yetl/handle/yetl/70939
description abstractIn this paper a heuristic algorithm is discussed for development of feeder routes to railway stations. The heuristic algorithm is a part of a model that has been developed for operational integration of suburban railway stations and public buses. The model has two distinct components, the first part is development of feeder routes for public buses to suburban railway stations and the second part is determination of optimally coordinated schedules of feeder bus services for the given schedules of suburban trains. The second part of the model is beyond the scope of this paper. Andheri and Vileparle suburban railway stations on a western railway line in Mumbai, India were taken as study areas, and extensive data collection was done at these railway stations. Various nodes and their potential demands from these railway stations were identified, and the demand-deviated feeder routes were developed for Bombay Electric Supply and Transport buses, which are being used as public buses in Mumbai, India.
publisherAmerican Society of Civil Engineers
titleDevelopment of Feeder Routes for Suburban Railway Stations Using Heuristic Approach
typeJournal Paper
journal volume127
journal issue4
journal titleJournal of Transportation Engineering, Part A: Systems
identifier doi10.1061/(ASCE)0733-947X(2001)127:4(334)
treeJournal of Transportation Engineering, Part A: Systems:;2001:;Volume ( 127 ):;issue: 004
contenttypeFulltext


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record