SPACING OF INTERSECTIONS IN HIERARCHICAL ROAD NETWORKS

SPACING OF INTERSECTIONS IN HIERARCHICAL ROAD NETWORKS
复制标题

DOI:
10.15807/jorsj.61.272
复制
发表时间:
2018-10
影响因子:
--
通讯作者:
M. Miyagawa
M. Miyagawa
中科院分区:
--
文献类型:
--
作者:
M. Miyagawa

文献摘要

被引文献

相似文献

本文提出了一个分析模型,用于检查交叉口的间距,连接不同级别的道路在一个分层网络。针对一个包含主干道和次干道两种道路类型的网格路网,得到了平均行程时间的解析表达式。行程时间定义为自由行程时间与交叉口延误之和。解析表达式给出了次要道路和主要道路上的旅行时间之间的权衡的基本性质。最后得到使平均行程时间最小的最优交叉口模式。结果表明,道路长度,交叉口延误,旅行速度,城市的大小如何影响最优模式。该模型也适用于东京的道路网络。该模型明确考虑了高等级道路的可达性和交叉口延误之间的权衡,是有用的分层道路网络设计。
This paper presents an analytical model for examining the spacing of intersections that connect different levels of roads in a hierarchical network. An analytical expression for the average travel time is obtained for a grid road network with two road types: minor and major roads. The travel time is defined as the sum of the free travel time and the delay at intersections. The analytical expression gives basic properties of the tradeoff between the travel time on minor and major roads. The optimal pattern of intersections that minimizes the average travel time is then obtained. The result demonstrates how the road length, the intersection delay, the travel speed, and the size of the city affect the optimal pattern. The model is also applied to the road network of Tokyo. The proposed model explicitly considers the tradeoff between the accessibility to higher level roads and the delay at intersections, and is useful for hierarchical road network design.