An Ant Colony Algorithm for Solving Set-Covering Problems
Ant colony algorithm is an optimized model based on the principle of swarm intelligence. In this paper, we use ant colony algorithm to find the optimization solution of the set-covering problems. In order to speed up the convergence of algorithm, the improved penalty function is used in the process of pheromone update. The experimental results prove that using the ant colony algorithm to solve the problem of set covering is efficient and feasible.
Ant Colony Algorithm Colony Intelligence Set-covering NP-complete Problem
Yang Gao Hongwei Ge
The School of Information Technology, Southern YangTze University Wuxi, Jiangshu, Peoples Republic of China
国际会议
杭州
英文
467-469
2006-10-12（万方平台首次上网日期，不代表论文的发表时间）