A TWO-STATE ANT COLONY ALGORITHM FOR SOLVING THE MINIMUM GRAPH BISECTION PROBLEM

DOI10.1142/S1469026809002710zbMath1185.68500OpenAlexW2053513490MaRDI QIDQ3401072

Rong-Long Wang, Kozo Okazaki

Publication date: 28 January 2010

Published in: International Journal of Computational Intelligence and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1469026809002710

zbMATH Keywords

genetic algorithmant colony optimizationcombinatorial optimization problemsminimum graph bisection problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68M99)

Cites Work

• Model-based search for combinatorial optimization: A critical survey
• A hybrid genetic algorithm for the three-index assignment problem
• Adaptive design optimization of wireless sensor networks using genetic algorithms
• Some simplified NP-complete graph problems
• Spectral methods for graph bisection problems.
• D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
• First steps to the runtime complexity analysis of ant colony optimization
• Ant colonies for the quadratic assignment problem
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• Multiple-way network partitioning
• Hill Climbing with Multiple Local Optima
• An Efficient Heuristic Procedure for Partitioning Graphs