摘要
以时间代价作为目标函数,针对复杂网络的优化问题进行研究,给出了目标评价函数模型的建立过程,提出了基于改进的A*算法求解复杂网络中最短K条路径问题的算法,并以城市交通为例,对算法进行了验证。实验结果表明所提出的算法可适用于一般多重图中最短K条路径问题的快速求解,具有广泛的应用价值。
Focusing on the optimization problems about complicated network, an algorithm named KSPA （K-Shortest Paths based on A ＊ ） was proposed to solve the K-shortest paths problem in complicated network. The time cost was taken as target function and the establishment of the target function model was given. Experimental results show the KSPA algorithm proposed can be used to solve the K-shortest paths problems quickly in multi-graph.
出处
《计算机应用》
CSCD
北大核心
2008年第4期951-953,956,共4页
journal of Computer Applications
基金
山西省自然科学基金资助项目(20051044)
