A TWO-STATE ANT COLONY ALGORITHM FOR SOLVING THE MINIMUM GRAPH BISECTION PROBLEM
2009 ◽
Vol 08
(04)
◽
pp. 487-498
◽
Keyword(s):
The graph bisection problem is an important problem in printed circuit board layout and communication networks. Since it is known to be NP-complete, approximation algorithm have been considered. In this paper, we propose a so-called two-state ant colony algorithm for efficiently solving the problem. In the proposed algorithm two kinds of pheromone and two kinds of heuristic information are introduced to reinforce the search ability. The proposed algorithm is tested on a large number of instances and is compared with a heuristic algorithm and a genetic algorithm. The experimental results show that the proposed approach is superior to its competitors.
2012 ◽
Vol 224
◽
pp. 47-50
2019 ◽
pp. 220-231
Keyword(s):
2017 ◽
Vol 5
(4)
◽
pp. 34
2001 ◽
Vol 48
(1)
◽
pp. 235-238
◽
Keyword(s):
2003 ◽
Vol 11
(3)
◽
pp. 243-254
◽