基于层次图模型的最短路径算法

Proceedings of the 2003 IEEE International Conference on Intelligent Transportation Systems Pub Date : 2003-12-19 DOI:10.1109/ITSC.2003.1252736

Wu Yimin, Xu Jianmin, Hu Yucong, Y. Qinghong

{"title":"基于层次图模型的最短路径算法","authors":"Wu Yimin, Xu Jianmin, Hu Yucong, Y. Qinghong","doi":"10.1109/ITSC.2003.1252736","DOIUrl":null,"url":null,"abstract":"This paper discusses a new algorithm for the shortest path founding based on hierarchical graphs. It plots out a flat graph into some sub-graphs, which are abstracted as a high-level graph. The calculation for the shortest path founding begins at the high-level graph. This method shrinks the searching range of the shortest path and reduces the time spending of calculating it. Since the impedance function among sub-graphs can be calculated dynamically, this algorithm can be applied to dynamic traffic inducement system.","PeriodicalId":123155,"journal":{"name":"Proceedings of the 2003 IEEE International Conference on Intelligent Transportation Systems","volume":"228 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A shortest path algorithm based on hierarchical graph model\",\"authors\":\"Wu Yimin, Xu Jianmin, Hu Yucong, Y. Qinghong\",\"doi\":\"10.1109/ITSC.2003.1252736\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper discusses a new algorithm for the shortest path founding based on hierarchical graphs. It plots out a flat graph into some sub-graphs, which are abstracted as a high-level graph. The calculation for the shortest path founding begins at the high-level graph. This method shrinks the searching range of the shortest path and reduces the time spending of calculating it. Since the impedance function among sub-graphs can be calculated dynamically, this algorithm can be applied to dynamic traffic inducement system.\",\"PeriodicalId\":123155,\"journal\":{\"name\":\"Proceedings of the 2003 IEEE International Conference on Intelligent Transportation Systems\",\"volume\":\"228 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-12-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2003 IEEE International Conference on Intelligent Transportation Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITSC.2003.1252736\",\"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 of the 2003 IEEE International Conference on Intelligent Transportation Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITSC.2003.1252736","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

本文讨论了一种新的基于层次图的最短路径建立算法。它将一个平面图划分为若干子图，这些子图抽象为一个高级图。最短路径建立的计算从高级图开始。该方法缩小了最短路径的搜索范围，减少了最短路径的计算时间。由于子图之间的阻抗函数可以动态计算，因此该算法可以应用于动态交通诱导系统。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A shortest path algorithm based on hierarchical graph model

This paper discusses a new algorithm for the shortest path founding based on hierarchical graphs. It plots out a flat graph into some sub-graphs, which are abstracted as a high-level graph. The calculation for the shortest path founding begins at the high-level graph. This method shrinks the searching range of the shortest path and reduces the time spending of calculating it. Since the impedance function among sub-graphs can be calculated dynamically, this algorithm can be applied to dynamic traffic inducement system.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of the 2003 IEEE International Conference on Intelligent Transportation Systems

自引率

0.00%

发文量