改进蚁群算法在动态交通分配中的应用研究

Study on Application of Improved Ant Algorithm in Dynamic Traffic Assignment

将蚁群算法用于交通分配中最优路径求解,考虑到实际路网中路段的通行时间受到交通量的影响,提出了一种改进的蚁群算法。算法对基本蚁群算法的信息素更新方程和启发信息进行适当改进,即用车辆在路段的行驶时间代替路段长度对信息素进行更新,并在启发信息中引入新的参数以加强搜索方向性。将改进后的蚁群算法结合增量分配法进行应用。用一个算例对算法的有效性进行验证。

Ant algorithm is used to solve the optimal path in traffic assignment, considering travel time on practical road network is affected by traffic volume, an improves ant algorithm was brought forth. , which formulation of pheromone renew and heuristic information in basic ant algorithm is improved properly. The pheromone was renewed by using the travel time of vehicles on the road sections had replaced the length of road sections. To strength search direction a new parameter was introduced into developmental information. Application by combining improved ant algorithm with increment assignment method, a simple numerical example is given to show the new algorithm＇s efficiency.