摘要
将消防设施选址问题抽象成集合覆盖问题。应用蚁群算法对集合覆盖问题进行了求解。并针对点的重复覆盖问题对每次迭代的结果进行了启发式改进,消除了冗余的子集。同时采用精英策略,加速了蚁群算法的收敛速度。并将用蚁群算法得到的结果与基于贪心策略得到的结果进行了比较,效果较好。
Covering Model to modeling the facility location problem is applied set, then used Ant Colony Algorithm to solve the Set Covering Model. Also aimed at duplicated covering of a point, a heuristic improvement of the result of each iteration is proposed, which removed the redundancy sub-collection. Additionally, an elitist strategy is introducted to accelerate the speed of convergence. At the end, it proves that the Ant Colony Algorithm is good through comparison it to the greedy method.
出处
《科学技术与工程》
2011年第21期5124-5127,共4页
Science Technology and Engineering
关键词
集合覆盖
蚁群算法
解的启发式改进
精英策略
set covering ant colony algorithm heuristic improvement of solution, elitist strategy
