The Shortest Path of City's Road Network Based on the Improved Ant Colony Algorithm

Author(s):  
Jun Bi ◽  
Qiuping Xu
2011 ◽  
Vol 121-126 ◽  
pp. 1296-1300 ◽  
Author(s):  
Jun Bi ◽  
Jie Zhang ◽  
Wen Le Xu

The shortest path between the start node and end node plays an important role in city’s road traffic network analysis system. The basic ant colony system algorithm which is a novel simulated evolutionary algorithm is studied to solve the shortest path problem. But the basic ant colony system algorithm is easy to run into the local optimum solution for shortest path. In order to solve the problem, the improved ant colony system algorithm is proposed. The improvement methods for selection strategy, local search, and information quantity modification of basic ant colony system are discussed in detail. The experiments are done in Beijing road network in China. The results of experiments show that comparing with the basic ant colony algorithm, the improved algorithm can easily converge at the global optimum for the shortest path.


2014 ◽  
Vol 2014 ◽  
pp. 1-9
Author(s):  
Yunpeng Wang ◽  
Yuqin Feng ◽  
Wenxiang Li ◽  
William Case Fulcher ◽  
Li Zhang

We present an improved ant colony algorithm-based approach to assess the vulnerability of a road network and identify the critical infrastructures. This approach improves computational efficiency and allows for its applications in large-scale road networks. This research involves defining the vulnerability conception, modeling the traffic utility index and the vulnerability of the road network, and identifying the critical infrastructures of the road network. We apply the approach to a simple test road network and a real road network to verify the methodology. The results show that vulnerability is directly related to traffic demand and increases significantly when the demand approaches capacity. The proposed approach reduces the computational burden and may be applied in large-scale road network analysis. It can be used as a decision-supporting tool for identifying critical infrastructures in transportation planning and management.


2021 ◽  
Vol 7 (5) ◽  
pp. 5009-5017
Author(s):  
Lili Zhang

Objectives: The ant colony algorithm is an algorithm that the Italian scholar sums up by studying the living habits of the creatures, and algorithm model established by inspiration according to ants finding things in the shortest path. Methods: In this paper, through the establishment of algorithm model based on an ant colony algorithm, all kinds of problems in physical fitness test were solved, which makes the physical test more efficient and convenient. Results: Through the testing and use of the algorithm model, it is found that the ant colony algorithm established in this paper can meet the requirements, can plan the information of physical fitness test as a whole, Conclusion: and help to deal with the problems of physical tests, so it is a good performance algorithm.


Sign in / Sign up

Export Citation Format

Share Document