Ant colony algorithm based on multiple state transition operators

Author(s):  
Wanrong Tan ◽  
Jun Rao ◽  
Jian Gao
2020 ◽  
Vol 39 (4) ◽  
pp. 5329-5338
Author(s):  
Yan Zheng ◽  
Qiang Luo ◽  
Haibao Wang ◽  
Changhong Wang ◽  
Xin Chen

The traditional ant colony algorithm has some problems, such as low search efficiency, slow convergence speed and local optimum. To solve those problems, an adaptive heuristic function is proposed, heuristic information is updated by using the shortest actual distance, which ant passed. The reward and punishment rules are introduced to optimize the local pheromone updating strategy. The state transfer function is optimized by using pseudo-random state transition rules. By comparing with other algorithms’ simulation results in different simulation environments, the results show that it has effectiveness and superiority on path planning.


2009 ◽  
Vol 29 (1) ◽  
pp. 136-138 ◽  
Author(s):  
Wen-jing ZENG ◽  
Tie-dong ZHANG ◽  
Yu-ru XU ◽  
Da-peng JIANG

Sign in / Sign up

Export Citation Format

Share Document