优化蚁群算法在最短路径诱导中的应用

最短路径算法在许多应用领域和研究中起着十分重要的作用。现有文献对最短路径问题提出了大量的优化求解方法和算法，大部分研究仅针对固定权值网络，对权值随时间变化等时变情况考虑较少。在通信系统、智能交通系统等实际网络及应用领域中，随着时间的变化，边的权值往往也同时改变。因此，时变网络中最短路径求解问题的研究更具有实用意义。针对一般算法存在的缺陷，现提出三点优化，使算法既能避免陷入局部最优解，又能更快地收敛到全局最优解。

Application of Optimized Ant Colony Algorithm in the Shortest Route Guidance

The shortest path algorithm has played an important role in many applications and researches. There are many literatures concerning optimization and algorithm for the shortest path problem,but most studies were applied to the network of fixed weight values without considering weight value change over time. In the actual network,such as intelligent transportation system and communication system,the weight values may change over time. Therefore,the study of shortest path problem in time-varying network is more valuable. In response to the defects of the general algorithm,this paper puts forward some improvements to converge faster the short-est path problem to the global optimal solution by avoiding the local optimal solution.