Ant colony optimization and the minimum cut problem

Proceedings of the 12th Annual Genetic and Evolutionary Computation Conference, GECCO '10

Volumn , Issue , 2010, Pages 1393-1400

  Kötzing, Timo ^a   Lehre, Per Kristian ^b   Neumann, Frank ^a   Oliveto, Pietro S ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

Ant colony optimization; Min cut

Indexed keywords

ACO ALGORITHMS; ANT-COLONY OPTIMIZATION; COMBINATORIAL OPTIMIZATION PROBLEMS; LOCAL OPTIMA; METAHEURISTIC; MIN-CUT; MINIMUM CUT; MINIMUM SPANNING TREE PROBLEM; OPTIMAL SOLUTIONS; POLYNOMIAL-TIME; RUN-TIME ANALYSIS; RUNTIMES;

CLUSTERING ALGORITHMS; COMBINATORIAL OPTIMIZATION; EVOLUTIONARY ALGORITHMS; OPTIMAL SYSTEMS; POLYNOMIAL APPROXIMATION; TREES (MATHEMATICS);

ARTIFICIAL INTELLIGENCE;

EID: 77955909560     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1830483.1830741     Document Type: Conference Paper

References (21)

1. N. Attiratanasunthron andJ. Fakcharoenphol. A running time analysis of an ant colony optimization algorithm for shortest paths in directed acyclic graphs. Information Processing Letters, 105(3): 88-92, 2008.
2. B. Doerr, F. Neumann, D. Sudholt, andC. Witt. On the runtime analysis of the 1-ANT ACO algorithm. In GECCO '07: Proceedings of the Genetic and Evolutionary Computation Conference, pages 33-40, New York, 2007. ACM Press.
3. M. Dorigo andC. Blum. Ant colony optimization theory: A survey. Theoretical Computer Science, 344: 243-278, 2005.
4. M. Dorigo andT. Stützle. Ant Colony Optimization. MIT Press, Cambrigde, MA, 2004.
5. S. Droste, T. Jansen, andI. Wegener. On the analysis of the (1+1) evolutionary algorithm. Theoretical Computer Science, 276:51-81, 2002.
6. A. Duarte, A. Sánchez, F. Fernández, andR. Cabido. A low-level hybridization between memetic algorithm and VNS for the max-cut problem. In GECCO '05: Proceedings of the 2005 conference on Genetic and evolutionary computation, pages 999-1006, 2005.
7. S. Gerke, D. Schlatter, A. Steger, andA. Taraz. The random planar graph process. Random Structures and Algorithms, 32(2): 236-261, 2008.
8. W. J. Gutjahr. First steps to the runtime complexity analysis of Ant Colony Optimization. Computers and Operations Research, 35(9): 2711-2727, 2008.
9. W. J. Gutjahr andG. Sebastiani. Runtime analysis of ant colony optimization with best-so-far reinforcement. Methodology and Computing in Applied Probability, 10: 409-433, 2008.
10. C. Horoba andD. Sudholt. Running time analysis of ACO systems for shortest path problems. In T. Stützle, M. Birattari, and H. H. Hoos, editors, SLS, volume 5752 of Lecture Notes in Computer Science, pages 76-91. Springer, 2009.
11. T. Jansen andI. Wegener. Evolutionary algorithms how to cope with plateaus of constant fitness and when to reject strings of the same fitness. IEEE Transactions on Evolutionary Computation, 5(6): 589-599, 2001.
12. D. R. Karger andC. Stein. A new approach to the minimum cut problem. J. ACM, 43(4): 601-640, 1996.
13. F. Neumann, J. Reichel, andM. Skutella. Computing minimum cuts by randomized search heuristics. In C. Ryan and M. Keijzer, editors, GECCO '08: Proceedings of the 10th annual conference on Genetic and evolutionary computation, pages 779-786. ACM, 2008. Journal version appears in Algorithmica.
14. F. Neumann, D. Sudholt, andC. Witt. Analysis of different MMAS ACO algorithms on unimodal functions and plateaus. Swarm Intelligence, 3(1): 35-68, 2009.
15. F. Neumann andC. Witt. Ant colony optimization and the minimum spanning tree problem. In V. Maniezzo, R. Battiti, and J.-P. Watson, editors, LION, volume 5313 of Lecture Notes in Computer Science, pages 153-166. Springer, 2007.
16. F. Neumann andC. Witt. Runtime analysis of a simple ant colony optimization algorithm. Algorithmica, 54(2): 243-255, 2009.
17. P. S. Oliveto, J. He, andX. Yao. Time complexity of evolutionary algorithms for combinatorial optimization: A decade of results. International Journal of Automation and Computing, 4(3): 281-293, 2007.
18. J. Puchinger, G. R. Raidl, andG. Koller. Solving a real-world glass cutting problem. In Proc. of Evo COP '04, pages 165-176. Springer, 2004.
19. V. Vazirani. Appromixation Algorithms. Springer, 2001.
20. I. Wegener. Methods for the analysis of evolutionary algorithms on pseudo-Boolean functions. In R. Sarker, X. Yao, and M. Mohammadian, editors, Evolutionary Optimization, pages 349-369. Kluwer, Dordrecht, Netherlands, 2002.
21. Y. Zhou. Runtime analysis of an ant colony optimization algorithm for TSP instances. IEEE Transactions on Evolutionary Computation, 13(5): 1083-1092, 2009.