To search, Click below search items.


All Published Papers Search Service


A Memory-based Ant Colony Algorithm for the Bipartite Subgraph Problem


Rong-Long Wang, Li-Qing Zhao


Vol. 10  No. 3  pp. 235-240


An innovative ant colony algorithm called memory-based ant colony algorithm is proposed to solve the bipartite subgraph problem. In the proposed algorithm, artificial ant has memory of solution found previously, and can use it to construct a new solution. Besides, in the proposed algorithm two kinds of pheromone and two kinds of heuristic information are also adopted to reinforce the search ability. The proposed algorithm is tested on a large number of instances and compared with other algorithms. The experimental results show that the proposed algorithm is superior to its competitors.


Bipartite subgraph problem, ant colony optimization, NP-complete problem, combinatorial optimization problems