.png){kind=icon}
返回
Study on hybrid PS-ACO algorithm
.png){kind=icon}
PRE
AI
DOI：10.1007/s10489-009-0179-6.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Ant colony optimization (ACO) algorithm is a recent meta-heuristic method inspired by the behavior of real ant colonies. The algorithm uses parallel computation mechanism and performs strong robustness, but it faces the limitations of stagnation and premature convergence. In this paper, a hybrid PS-ACO algorithm, ACO algorithm modified by particle swarm optimization (PSO) algorithm, is presented. The pheromone updating rules of ACO are combined with the local and global search mechanisms of PSO. On one hand, the search space is expanded by the local exploration; on the other hand, the search process is directed by the global experience. The local and global search mechanisms are combined stochastically to balance the exploration and the exploitation, so that the search efficiency can be improved. The convergence analysis and parameters selection are given through simulations on traveling salesman problems (TSP). The results show that the hybrid PS-ACO algorithm has better convergence performance than genetic algorithm (GA), ACO and MMAS under the condition of limited evolution iterations.
Keyword:
Ant colony optimization
Particle swarm optimization
Hybrid PS-ACO
TSP
期刊
IF:
3.5
论文数:
7.6K
被引数:
1.7W
机构
引用论文
分享收藏Genetic algorithms for the travelling salesman problem:: A review of representations and operators用于旅行商问题的遗传算法:: 表示和运算符的回顾
PREAI
分享收藏Recruitment and retention of African American patients for clinical research: An exploration of response rates in an urban psychiatric hospital.招募和保留非裔美国患者进行临床研究: 城市精神病医院响应率的探索。
OAAI
OAAI分享收藏Visible region absorption in TMDs/phosphorene heterostructures for use in solar energy conversion applications.png)
RSC AdvancesOAAI
RSC AdvancesIF0
OAAI分享收藏 没有更多内容
没有更多内容