关键词: 动态网络 最短路径 遗传算法 蚁群算法

Abstract:

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 netw orks. A new algorithm for the shortest path problem in dynamic networks based on the improved ant colony algorithm is presented. This method can find th  e excellent path based on bigger probability and does not need any constraint condition, which can also solve the problem on continuous and discrete dy  amic networks. The algorithm proposed is proved to be stable by examples.

Key words: （dynamic network, shortest path, genetic algorithm, ant colony algorithm）