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
Search this article
Abstract
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.
Journal
-
- IEEJ Transactions on Electronics, Information and Systems
-
IEEJ Transactions on Electronics, Information and Systems 132 (12), 2043-2050, 2012
The Institute of Electrical Engineers of Japan
- Tweet
Keywords
Details 詳細情報について
-
- CRID
- 1390001204608469248
-
- NII Article ID
- 10031129681
-
- NII Book ID
- AN10065950
-
- ISSN
- 13488155
- 03854221
-
- NDL BIB ID
- 024253850
-
- Text Lang
- en
-
- Data Source
-
- JaLC
- NDL
- Crossref
- CiNii Articles
-
- Abstract License Flag
- Disallowed