Towards Optimized Routing Approach for Dynamic Shortest Path Selection in Traffic Networks

T. Zhu, Wang Xiang
{"title":"Towards Optimized Routing Approach for Dynamic Shortest Path Selection in Traffic Networks","authors":"T. Zhu, Wang Xiang","doi":"10.1109/ICACTE.2008.183","DOIUrl":null,"url":null,"abstract":"This paper presents a novel heuristic method for adaptive routing policy which adopts three-step processes with state space reduction mechanism. Firstly, A* algorithm is introduced in the static road network to reduce those definitely useless states. Secondly, based on real-time traffic information and historic information, a heuristic incremental search method is applied to find the most optimal path at each information update period. Thirdly, those useless states from candidate paths are removed. Based on the real traffic data of Beijing, the experimental results illustrate the effectiveness and efficiency of our approach.","PeriodicalId":364568,"journal":{"name":"2008 International Conference on Advanced Computer Theory and Engineering","volume":"116 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Conference on Advanced Computer Theory and Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICACTE.2008.183","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

This paper presents a novel heuristic method for adaptive routing policy which adopts three-step processes with state space reduction mechanism. Firstly, A* algorithm is introduced in the static road network to reduce those definitely useless states. Secondly, based on real-time traffic information and historic information, a heuristic incremental search method is applied to find the most optimal path at each information update period. Thirdly, those useless states from candidate paths are removed. Based on the real traffic data of Beijing, the experimental results illustrate the effectiveness and efficiency of our approach.
交通网络中动态最短路径选择的优化路由方法研究
本文提出了一种新的启发式自适应路由策略求解方法,该方法采用状态空间约简机制的三步过程。首先,在静态道路网络中引入A*算法来减少那些绝对无用的状态。其次,基于实时交通信息和历史信息,采用启发式增量搜索方法,在每个信息更新周期寻找最优路径;第三,剔除候选路径中的无用状态。基于北京市实际交通数据的实验结果验证了该方法的有效性和高效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信