An Ant System with Two Colonies and Its Application to Traveling Salesman Problem
-
- Wang Rong-Long
- Graduate School of Engineering, University of Fukui
-
- Zhou Xiao-Fan
- Graduate School of Engineering, University of Fukui
-
- Zhao Li-Qing
- Graduate School of Engineering, University of Fukui
-
- Xia Ze-Wei
- Graduate School of Engineering, University of Fukui
この論文をさがす
抄録
An ant system with two colonies is proposed for the combinatorial optimization problems. The proposed method is inspired by the knowledge that there are many colonies of ants in the natural world. The proposed two-colony mechanism plays an important role in enhancing the diversification while maintaining the intensification of the algorithm. At first, ants perform solution search procedure by cooperating with each others in the same colony until no better solution is found after a certain time period. Then, communication between the two colonies is performed to build new pheromone distributions for each colony, and ants start their search procedure again in each separate colony, based on the new pheromone distribution. Furthermore, in order to enhance the quality of the iteratively found solutions, a local search algorithm is also adopted. The proposed algorithm is tested by simulating the Traveling Salesman Problem (TSP). Simulation results show that the proposed method performs better than the traditional ACO algorithms.
収録刊行物
-
- 電気学会論文誌C(電子・情報・システム部門誌)
-
電気学会論文誌C(電子・情報・システム部門誌) 132 (12), 2043-2050, 2012
一般社団法人 電気学会
- Tweet
キーワード
詳細情報 詳細情報について
-
- CRID
- 1390001204608469248
-
- NII論文ID
- 10031129681
-
- NII書誌ID
- AN10065950
-
- ISSN
- 13488155
- 03854221
-
- NDL書誌ID
- 024253850
-
- 本文言語コード
- en
-
- データソース種別
-
- JaLC
- NDL
- Crossref
- CiNii Articles
-
- 抄録ライセンスフラグ
- 使用不可