A GIS-based method to identify cost-effective routes for rural deviated fixed route transit
A GIS-based method to identify cost-effective routes for rural deviated fixed route transit
复制标题
DOI：
10.1002/atr.1428
复制
发表时间：
2016-12
影响因子：
2.3
通讯作者：
Hongtai Yang;C. Cherry;R. Zaretzki;Megan S. Ryerson;Xiaobo Liu;Zhijian Fu
中科院分区：
文献类型：
--
作者：
Hongtai Yang;C. Cherry;R. Zaretzki;Megan S. Ryerson;Xiaobo Liu;Zhijian Fu
摘要 连接农村和城市地区的偏离固定路线交通 (DFRT) 服务是美国不断发展的交通模式。开发路线设计框架的研究很少。本文提出了一种探索最具成本效益的 DFRT 路线的方法。输入包括潜在的 DFRT 需求分布和道路网络。启发式方法用于通过从城市核心开始并以一定的长度增量向所有网络方向延伸来构建可能的路线。选择所有落在用户期望的长度范围内的DFRT路线。比较这些路线的成本效益（由每次乘客出行的运营成本定义）。选择最具成本效益的路线并在 GIS 地图中呈现。案例研究说明了田纳西州几个大都市区的方法。最具成本效益的路线长度视具体情况而定；一些路线（例如从纳什维尔出发的路线）在短距离时最具成本效益，而其他路线（例如从孟菲斯出发的路线）在长距离时最具成本效益。政府机构可以使用该方法来确定给定路线长度或运营成本预算的每位乘客运营成本最低的路线。版权所有 © 2016 约翰·威利父子有限公司
Summary Deviated fixed route transit (DFRT) service connecting rural and urban areas is a growing transportation mode in the USA. Little research has been done to develop frameworks for route design. A methodology to explore the most cost-effective DFRT route is presented in this paper. The inputs include potential DFRT demand distribution and a road network. A heuristic is used to build possible routes by starting at urban cores and extending in all network directions in certain length increments. All the DFRT routes falling in the length range desired by the users are selected. The cost effectiveness of those routes, defined by operating cost per passenger trip, is compared. The most cost-effective route is selected and presented in a GIS map. A case study illustrates the methodology in several Tennessee metropolitan regions. The most cost-effective route length is case specific; some routes (e.g. those out of our Nashville case) are most cost effective when short, while others (e.g. those out of Memphis) are most cost effective when long. Government agencies could use the method to identify routes with the lowest operating cost per passenger given a route length or an operating cost budget. Copyright © 2016 John Wiley & Sons, Ltd.