摘要
本文以时间代价作为目标函数,针对复杂网络的优化问题进行研究,给出了目标评价函数模型的建立过程,提出了改进的A*算法求解复杂网络中最短路径问题的算法,并以城市交通为例,对算法进行了验证,实验结果表明所提出的算法可适用于一般多重图中最短路径问题的快速求解,具有广泛的应用价值。
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.
出处
《自动化技术与应用》
2010年第3期32-35,43,共5页
Techniques of Automation and Applications
基金
河北省教育厅自然科学项目(编号Z2009460)
关键词
多重图
A＊算法
最短路径
multi-graph
A＊ algorithm
shortest paths
