Ant colony algorithm for solving Max-cut problem

Progress in Natural Science

Volumn 18, Issue 9, 2008, Pages 1173-1178

  Gao, Lin ^a   Zeng, Yan ^b   Dong, Anguo ^a,c  

^a XIDIAN UNIVERSITY   (China)

^b XI AN UNIVERSITY OF POSTS AND TELECOMMUNICATIONS   (China)

^c CHANG'AN UNIVERSITY   (China)

Author keywords

Algorithm; Ant colony optimization; Max cut problem

Indexed keywords

COMBINATORIAL OPTIMIZATION; PROBLEM SOLVING; STATISTICAL PHYSICS;

ALGORITHM FOR SOLVING; ANT COLONIES ALGORITHM; COMBINATORIAL OPTIMIZATION PROBLEMS; DIFFERENT DOMAINS; MAX-CUT PROBLEM; NETWORK OPTIMIZATION; NP COMPLETE; OPTIMIZATION HEURISTICS; STATISTICAL PHYSICS; VERY LARGE SCALE INTEGRATION DESIGNS;

ANT COLONY OPTIMIZATION;

EID: 52249101984     PISSN: 10020071     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.pnsc.2008.04.006     Document Type: Article

References (15)

1. M. Dorigo V. Maniezzo A. Colorni The Ant system: optimization by a colony of cooperating agents IEEE Trans Syst Man Cybern B 26 1 1996 29 41
2. M. Dorigo L.M. Gambardella Ant colonies for the traveling salesman problem Biosystems 43 2 1997 73 81
3. E.G. Talbi O. Roux C. Fonlupt Parallel ant colonies for the quadratic assignment problem Future Gen Comput Syst 17 4 2001 441 449
4. W.X. Xing J.X. Xie Modern optimization methods 2001 Tsinghua University Press Beijing
5. Dorigo M, Stützle T. The ant colony optimization meta-heuristic: algorithms, applications, and advances. Technical Report IRIDIA-2000-32, Universit’e Libre de Bruxelles, 2000.
6. L. Lovasz On the Shannon capacity of a graph IEEE Trans Inform Theory 25 1979 1 7
7. N.Z. Shor Quadratic optimization problems Sov J Comput Syst Sci 25 1987 1 11
8. M.X. Goemans D.P. Williams Improved approximation algorithms for Max-Cut and satisfiability problems using semidefinite programming J ACM 42 1995 1115 1145
9. Wu LY, Zhang XS, Zhang JL. Application of discrete Hopfield-type neural network for max-cut problem. In: Proceedings of ICONIP, 2001. p. 1439–44.
10. Ono T, Hirata T. Spectrum method for the MaxCut problem. In: MIC2003, the fifth metaheuristics international conference, Kyoto, Japan, 2003. p. 25–8.
11. C.R. Wang Graph theory 3rd ed. 2004 Beijing Institute of Technology Press Beijing
12. D.E. Goldberg Simple genetic algorithms and the minimal deception problem Genetic algorithms and simulated annealing 1987 Pitman London 74 88
13. Blum C, Sampels M. Ant colony optimization for FOP shop scheduling: a case study on different pheromone representations. In: Proc Congr Evol Comput (CEC), vol. 2. Los Alamitos, CA, 2002. p. 1558–63.
14. Montgomery J, Randall M, Hendtlass T. Search bias in constructive metaheuristics and implication for ant colony optimization. In: Lecture notes in computer science. Proceedings of the fourth international workshop, Ant Colony Opt Swarm Intell (ANTS), 2004. p. 391–8.
15. C. Blum M. Dorigo Search bias in ant colony optimization: on the role of competition-balanced systems IEEE Trans Evolut Comput 9 2 2005 159 174