摘要
提出一种基于禁忌搜索和蚁群算法的求解最小弱顶点覆盖问题的混合优化算法,用于解决网络流量有效测量点的选择问题。仿真结果表明,比较现有算法,本算法能够找到更小的弱顶点覆盖集,且具有更好的可扩展性和实用性。
This paper proposed a new hybrid optimization algorithm for solving minimum weak vertex cover set problem. The experimental results show that the proposed hybrid optimization algorithm is more expansibility and practicability, and ean find smaller weak vertex cover set than other algorithms.
出处
《计算机应用研究》
CSCD
北大核心
2009年第4期1480-1483,1486,共5页
Application Research of Computers
