An ant colony algorithm for solving Max-cut problem

查看全文 作　　者：Lin [1]Gao;Yan [2]Zeng;Anguo [1,3]Dong

机构地区：[1]School of Computer Science and Technology, Xidian University, Xi'an 710071, China;[2]Computer Science Department, Xi'an Institute of Post & Telecommunications, Xi'an 710061, China;[3]School of Science, Chang'an University, Xi'an 710064, China

出　　处：《Progress in Natural Science:Materials International》索引2008年第18卷第9期,共6页

基　　金：National Natural ScienceFoundation of China (Grant No. 60574039);Xi’an AppliedMaterials Innovation Fund (Grant No. XA-AM-200605);SRF for ROCS 摘　　要：Max-cut problem is an NP-complete and classical combinatorial optimization problem that has a wide range of applications in dif-ferent domains, such as bioinformatics, network optimization, statistical physics, and very large scale integration design.In this paper we investigate the capabilities of the ant colony optimization (ACO) heuristic for solving the Max-cut problem and present an AntCut algo-rithm.A large number of simulation experiments show that the algorithm can solve the Max-cut problem more eficiently and efiectively. 关键词：蚂蚁 Max-cut问题运算法则群落最优化

相关文献

参考文献（15）
引证文献（6）
耦合文献（0）

参考文献(15)

引证文献(6)

互联网出版许可证新出网证(渝)字10号全国400电话 - 免长途话费

An ant colony algorithm for solving Max-cut problem

参考文献(15)

引证文献(6)

用户提示