In 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.
[1]
W. Lampkin,et al.
The Design of Routes, Service Frequencies, and Schedules for a Municipal Bus Undertaking: A Case Study
,
1967
.
[2]
S. C. Wirasinghe,et al.
Nearly optimal parameters for a rail/feeder-bus system on a rectangular grid
,
1980
.
[3]
Jende Augustine Hsu,et al.
Demand Model for Bus Network Design
,
1976
.
[4]
D. F. Dubois,et al.
A Set of Methods in Transportation Network Synthesis and Analysis
,
1979
.
[5]
Hani S. Mahmassani,et al.
Hybrid route generation heuristic algorithm for the design of transit networks
,
1995
.
[6]
Christoph E. Mandl,et al.
Evaluation and optimization of urban public transportation networks
,
1980
.
[7]
L. A. Silman,et al.
Planning the route system for urban buses
,
1974,
Comput. Oper. Res..