The Feeder-bus Network-design Problem
作者:
KuahGeok Koon,
PerlJossef,
期刊:
Journal of the Operational Research Society
(Taylor Available online 1989)
卷期:
Volume 40,
issue 8
页码: 751-767
ISSN:0160-5682
年代: 1989
DOI:10.1057/jors.1989.127
出版商: Taylor&Francis
关键词: heuristics;network;public transport
数据来源: Taylor
摘要:
AbstractThe potential for improving the cost-effectiveness of public transport operations by designing better integrated feeder-bus/rail rapid transit systems has been widely recognized. This paper defines the feeder-bus network-design problem (FBNDP) as that of designing a feeder-bus network to access an existing rail system. The FBNDP is considered under two different demand patterns, many-to-one (M-to-1) and many-to-many (M-to-M). We present a mathematical programming model for the M-to-1 FBNDP, and show that it can be generalized to the M-to-M FBNDP. The FBNDP is a large and difficult vehicle-routeing-type problem with an additional decision variable—operating frequency. A heuristic model is presented, which generalizes the‘savings approach’to incorporate operating frequency. The computational analysis shows that the proposed heuristic provides reasonable feeder-bus networks and consistent responses to‘what if’questions. A comparison indicates that the proposed heuristic provides solutions that are superior to manually designed networks. The advantages of this heuristic are particularly significant under variable demand.
点击下载:
PDF (6805KB)
返 回