Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1548835 | Progress in Natural Science: Materials International | 2008 | 6 Pages |
Abstract
Max-cut problem is an NP-complete and classical combinatorial optimization problem that has a wide range of applications in different 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 algorithm. A large number of simulation experiments show that the algorithm can solve the Max-cut problem more efficiently and effectively.
Related Topics
Physical Sciences and Engineering
Materials Science
Electronic, Optical and Magnetic Materials
Authors
Lin Gao, Yan Zeng, Anguo Dong,