Congested traffic based on ant colony algorithm for shortest path algorithm
暂无分享,去创建一个
In view of the current traffic network of deficiencies in the path selection research, i.e. only consider static traffic network path selection problem. This paper proposed shortest path algorithm under congestion traffic network which is based on ant colony algorithm and builds the traffic network model based on Petri nets, and use ant colony optimization to find the shortest path for the static traffic network. Then add the weather, road capacity to the model, made it become dynamic traffic network. Using AHP combined with Petri network traffic on the topology map to find the shortest path and make a comparative analysis. The results show that when the road is congestion, path algorithm for dynamic traffic network can be more convenient for travelers to find the route.
[1] Yang Yi,et al. Improved ant colony optimization algorithm for the traveling salesman problems , 2010 .
[2] Richard F. Hartl,et al. An improved Ant System algorithm for theVehicle Routing Problem , 1999, Ann. Oper. Res..
[3] Xiu Ju Liu. Application of Improved Ant Colony Algorithm in QoS Routing Optimization , 2010 .
[4] Christian Blum,et al. An ant colony optimization algorithm for continuous optimization: application to feed-forward neural network training , 2007, Neural Computing and Applications.