期刊名称:International Journal of Computer Science and Network Security
印刷版ISSN:1738-7906
出版年度:2010
卷号:10
期号:3
页码:235-240
出版社:International Journal of Computer Science and Network Security
摘要: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.