带杂交算子的蚁群算法求解动态网络中的最短路径问题

动态网络与传统的网络模型相比更具有现实意义，具有广泛的应用领域。本文对动态网络模型进行了描述，用实例证明了著名的Dijkstra算法在动态网络中不能有效地求解最短路径问题，提出了一种用带杂交算子的蚁群算法来求解动态网络最短路径问题的新算法。此算法不仅能够以较大的概率找到最优解而且对网络没有任何约束条件，即对离散
散和连续的动态网络模型都有效，而且用实例证明了算法的稳定性。

An Ant Colony Algorithm with Crossover Operators for the Shortest Path Problem in Dynamic Networks

Time-dependent dynamic networks are more practical or significant compared with traditional network models. An illumination of dynamic networks is given, and instances are adopted to prove that the famous Dijkstra algorithm cannot be effectively used to solve the shortest path problems in dynamic networks. A new algorithm for the shortest path problem in dynamic networks based on the improved ant colony algorithm is presented. This method can find the excellent path based on bigger probability and does not need any constraint condition, which can also solve the problem on continuous and discrete dynamic networks. The algorithm proposed is proved to be stable by examples.