路由计算的快速计算方法

Feng Wen, S. Mabu, K. Hirasawa
{"title":"路由计算的快速计算方法","authors":"Feng Wen, S. Mabu, K. Hirasawa","doi":"10.1109/MEC.2011.6025846","DOIUrl":null,"url":null,"abstract":"This paper introduces a speedup method for the optimal route calculation on large size road networks by preprocessing and pre-computing. A hierarchical network structure is constructed by separating a large network into several subnetworks. The boundary nodes partitioned the original network are new nodes in the higher level network. The new road sections on the multilevel network are decided by pre-computing the shortest path between the boundary nodes of each sub-network. A clustering method based on genetic algorithm is proposed. By the proposed method, the number of boundary nodes and road sections between boundary nodes of each sub-network can be reduced greatly. Then, the computational time for route calculation on this hierarchical network can be deceased sharply. Experimental results show that the efficiency of the proposed method.","PeriodicalId":386083,"journal":{"name":"2011 International Conference on Mechatronic Science, Electric Engineering and Computer (MEC)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Fast computation method for route calculation\",\"authors\":\"Feng Wen, S. Mabu, K. Hirasawa\",\"doi\":\"10.1109/MEC.2011.6025846\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper introduces a speedup method for the optimal route calculation on large size road networks by preprocessing and pre-computing. A hierarchical network structure is constructed by separating a large network into several subnetworks. The boundary nodes partitioned the original network are new nodes in the higher level network. The new road sections on the multilevel network are decided by pre-computing the shortest path between the boundary nodes of each sub-network. A clustering method based on genetic algorithm is proposed. By the proposed method, the number of boundary nodes and road sections between boundary nodes of each sub-network can be reduced greatly. Then, the computational time for route calculation on this hierarchical network can be deceased sharply. Experimental results show that the efficiency of the proposed method.\",\"PeriodicalId\":386083,\"journal\":{\"name\":\"2011 International Conference on Mechatronic Science, Electric Engineering and Computer (MEC)\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-09-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 International Conference on Mechatronic Science, Electric Engineering and Computer (MEC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MEC.2011.6025846\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Conference on Mechatronic Science, Electric Engineering and Computer (MEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MEC.2011.6025846","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

本文介绍了一种采用预处理和预计算相结合的大型路网最优路线计算加速方法。分层网络结构是将一个大的网络划分为若干个子网络。在原网络中划分的边界节点是上层网络中的新节点。通过预先计算各子网络边界节点之间的最短路径来确定多层网络上的新路段。提出了一种基于遗传算法的聚类方法。该方法可大大减少各子网络的边界节点数和边界节点间的路段数。这种分层网络的路由计算时间大大缩短。实验结果表明了该方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Fast computation method for route calculation
This paper introduces a speedup method for the optimal route calculation on large size road networks by preprocessing and pre-computing. A hierarchical network structure is constructed by separating a large network into several subnetworks. The boundary nodes partitioned the original network are new nodes in the higher level network. The new road sections on the multilevel network are decided by pre-computing the shortest path between the boundary nodes of each sub-network. A clustering method based on genetic algorithm is proposed. By the proposed method, the number of boundary nodes and road sections between boundary nodes of each sub-network can be reduced greatly. Then, the computational time for route calculation on this hierarchical network can be deceased sharply. Experimental results show that the efficiency of the proposed method.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信