An Improved Ant Colony Algorithm for the Shortest Path Problem in Time-Dependent Networks

ICCTP 2009 ◽  
2009 ◽  
Author(s):  
Hui Gao ◽  
Yongqiang Liu ◽  
Qing Chang ◽  
Huagang Xiong
Keyword(s):  
Shortest Path ◽  
Ant Colony Algorithm ◽  
Shortest Path Problem ◽  
Ant Colony ◽  
Time Dependent ◽  
Improved Ant Colony Algorithm

scholarly journals Parallel Ant Colony Algorithm for Shortest Path Problem

2019 ◽  
Author(s):  
Géza Katona ◽  
Balázs Lénárt ◽  
János Juhász
Keyword(s):  
Parallel Computing ◽  
Shortest Path ◽  
Ant Colony Algorithm ◽  
State Of The Art ◽  
Shortest Path Problem ◽  
Ant Colony ◽  
Parameter Study ◽  
Real Network

During travelling, more and more information must be taken into account, and travelers have to make several complex decisions. In order to support these decisions, IT solutions are unavoidable, and as the computational demand is constantly growing, the examination of state-of-the-art methodologies is necessary. In our research, a parallelized Ant Colony algorithm was investigated, and a parameter study on a real network has been made. The aim was to inspect the sensibility of the method and to demonstrate its applicability in a multi-threaded system (e.g. Cloud-based systems). Based on the research, increased effectiveness can be reached by using more threads. The novelty of the paper is the usage of the processors’ parallel computing capability for routing with the Ant Colony algorithm.

Application and Analysis of Improved Ant Colony Algorithm in Physical Fitness Test

2021 ◽  
Vol 7 (5) ◽  
pp. 5009-5017
Author(s):  
Lili Zhang
Keyword(s):  
Physical Fitness ◽  
Shortest Path ◽  
Ant Colony Algorithm ◽  
Ant Colony ◽  
Physical Fitness Test ◽  
Physical Test ◽  
Fitness Test ◽  
Model Based ◽  
Physical Tests ◽  
Improved Ant Colony Algorithm

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.

SH: A Novel Method for the Dynamic and Shortest Path Problem

2010 ◽  
Vol 129-131 ◽  
pp. 1013-1017
Author(s):  
Ya Fei Guo ◽  
Zheng Qin ◽  
Rong Hua Guo ◽  
Lei Ji
Keyword(s):  
Shortest Path ◽  
Heuristic Search ◽  
Large Scale ◽  
Ant Colony Algorithm ◽  
Real Life ◽  
Shortest Path Problem ◽  
Ant Colony ◽  
Current Path ◽  
Novel Method ◽  
Better Than

For the dynamic and shortest path problem, a novel algorithm SH(simulate human) is designed by simulating the process of our searching path in real life. The algorithm adopts the idea of heuristic search and integrates with the ant colony algorithm, in which the saved current path, the idea of “ask once every junction”, the bypassing barrier search and other some related definitions are proposed, as well as the ant colony algorithm is improved, so as to find the better solution and reduce the searching time. The experimental results show that the algorithm runs better than other existing methods. Moreover, it can find the shortest path or the approximate shortest one in a shorter time on road networks of any scales. Especially, SH algorithm is more effective for the large scale road network.

Sign in / Sign up

Export Citation Format

Share Document