SPACING OF INTERSECTIONS IN HIERARCHICAL ROAD NETWORKS

M. Miyagawa
{"title":"SPACING OF INTERSECTIONS IN HIERARCHICAL ROAD NETWORKS","authors":"M. Miyagawa","doi":"10.15807/JORSJ.61.272","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":51107,"journal":{"name":"Journal of the Operations Research Society of Japan","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2018-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.15807/JORSJ.61.272","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of the Operations Research Society of Japan","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.15807/JORSJ.61.272","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Decision Sciences","Score":null,"Total":0}
引用次数: 4

Abstract

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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
分层道路网中交叉口的间距
本文提出了一个分析模型,用于检查在分层网络中连接不同层次道路的交叉口间距。得到了具有主干道和次要干道两种道路类型的栅格路网的平均行驶时间解析表达式。通行时间定义为自由通行时间与交叉口延误时间之和。解析式给出了在主干道和次要干道上的通行时间权衡的基本性质。得到了使平均行驶时间最小的最优交叉口布局。结果表明,道路长度、交叉口延迟、行驶速度和城市规模对最优模式的影响。该模型也适用于东京的道路网络。该模型明确地考虑了高层道路可达性与交叉口延迟之间的权衡,对分层道路网络设计具有实用价值。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Journal of the Operations Research Society of Japan
Journal of the Operations Research Society of Japan 管理科学-运筹学与管理科学
CiteScore
0.70
自引率
0.00%
发文量
12
审稿时长
12 months
期刊介绍: The journal publishes original work and quality reviews in the field of operations research and management science to OR practitioners and researchers in two substantive categories: operations research methods; applications and practices of operations research in industry, public sector, and all areas of science and engineering.
期刊最新文献
IMPLEMENTING ARROW–DEBREU EQUILIBRIA IN APPROXIMATELY COMPLETE SECURITY MARKETS A RIEMANNIAN-GEOMETRICAL APPROACH TO STRICTLY CONVEX QUADRATIC PROGRAMMING WITH CONVEXITY-PRESERVING METRIC PARAMETERIZATION A SUBGEOMETRIC CONVERGENCE FORMULA FOR TOTAL-VARIATION ERROR OF THE LEVEL-INCREMENT TRUNCATION APPROXIMATION OF M/G/1-TYPE MARKOV CHAINS MIXED-INTEGER DC PROGRAMMING BASED ALGORITHMS FOR THE CIRCULAR PACKING PROBLEM A HYBRID ALGORITHM FOR THE ADWORDS PROBLEM
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1