基于预处理的高效道路网络拓扑

K. H. Quek, T. Srikanthan
{"title":"基于预处理的高效道路网络拓扑","authors":"K. H. Quek, T. Srikanthan","doi":"10.1109/ITSC.2002.1041270","DOIUrl":null,"url":null,"abstract":"A novel pre-processing technique has been devised to facilitate the removal of redundant links that are unlikely to be associated with the optimum path for a given O-D pair. The technique is highly suited for on-line removal of unwanted links as It relies only on simple logic and arithmetic operations. Our investigations based on simulations using Singapore roadway network show that optimum path computations on the preprocessed network are comparable to that using the entire network Moreover, pruning the network in the manner proposed will inevitably expedite the computations of optimum paths further.","PeriodicalId":365722,"journal":{"name":"Proceedings. The IEEE 5th International Conference on Intelligent Transportation Systems","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Towards efficient roadway network topology with pre-processing\",\"authors\":\"K. H. Quek, T. Srikanthan\",\"doi\":\"10.1109/ITSC.2002.1041270\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A novel pre-processing technique has been devised to facilitate the removal of redundant links that are unlikely to be associated with the optimum path for a given O-D pair. The technique is highly suited for on-line removal of unwanted links as It relies only on simple logic and arithmetic operations. Our investigations based on simulations using Singapore roadway network show that optimum path computations on the preprocessed network are comparable to that using the entire network Moreover, pruning the network in the manner proposed will inevitably expedite the computations of optimum paths further.\",\"PeriodicalId\":365722,\"journal\":{\"name\":\"Proceedings. The IEEE 5th International Conference on Intelligent Transportation Systems\",\"volume\":\"33 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-09-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. The IEEE 5th International Conference on Intelligent Transportation Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITSC.2002.1041270\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. The IEEE 5th International Conference on Intelligent Transportation Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITSC.2002.1041270","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

一种新的预处理技术已经被设计出来,以方便去除多余的链接,这些链接不太可能与给定的O-D对的最佳路径相关联。该技术非常适合在线删除不需要的链接,因为它只依赖于简单的逻辑和算术运算。我们基于新加坡道路网络的模拟研究表明,预处理网络的最优路径计算与使用整个网络的最优路径计算相当,而且,以所提出的方式修剪网络将不可避免地进一步加快最优路径的计算。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Towards efficient roadway network topology with pre-processing
A novel pre-processing technique has been devised to facilitate the removal of redundant links that are unlikely to be associated with the optimum path for a given O-D pair. The technique is highly suited for on-line removal of unwanted links as It relies only on simple logic and arithmetic operations. Our investigations based on simulations using Singapore roadway network show that optimum path computations on the preprocessed network are comparable to that using the entire network Moreover, pruning the network in the manner proposed will inevitably expedite the computations of optimum paths further.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信