|
|||||
|
|
| 复杂网络中最短路径问题的求解算法研究 | |
| 引用本文： | 冯震,刘佳,李靖,曹延飞.复杂网络中最短路径问题的求解算法研究[J].自动化技术与应用,2010,29(3):32-35,43. |
| 作者姓名： | 冯震 刘佳 李靖 曹延飞 |
| 作者单位： | 1. 湖北师范学院控制科学与工程系,湖北,黄石,435002 2. 石家庄铁路职业技术学院信息工程系,河北石家庄,050041 3. 石家庄经济学院,河北,石家庄,050031 |
| 基金项目： | 河北省教育厅自然科学项目 |
| 摘 要： | 本文以时间代价作为目标函数,针对复杂网络的优化问题进行研究,给出了目标评价函数模型的建立过程,提出了改进的A＊算法求解复杂网络中最短路径问题的算法,并以城市交通为例,对算法进行了验证,实验结果表明所提出的算法可适用于一般多重图中最短路径问题的快速求解,具有广泛的应用价值。 |
| 关 键 词： | 多重图 A＊算法 最短路径 |
Research on the Algorithm for Shortest Path Problem in Complicated Network |
|
| FENG Zhen,LIU Jia,LI Jing,CAO Yan-fei.Research on the Algorithm for Shortest Path Problem in Complicated Network[J].Techniques of Automation and Applications,2010,29(3):32-35,43. | |
| Authors: | FENG Zhen LIU Jia LI Jing CAO Yan-fei |
| Affiliation: | FENG Zhen1,LIU Jia2,LI Jing2,CAO Yan-fei3(1.Department of Control Science , Engineering Hubei Normal University Huangshi,435002 China,2.Department of Information Engineering Shijiazhuang Institute of Railway Technology Shijiazhuang 050041 China,3.Shijiazhuang Institute of Economics Shijiazhuang 050031 China) |
| Abstract: | Focusing on the optimization problems about complicated network,this paper presents an algorithm to solve the shortest paths problem in complicated network based on A* algorithm,in which the time cost is taken as target function and the establishment of the target function model is given.Experimental results show that the algorithm proposed can be used to solve the shortest paths problems quickly in multi-graph. |
| Keywords: | multi-graph A* algorithm shortest paths |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |
