.png){kind=icon}
Return
Population declining ant colony optimization algorithm and its applications
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2008.07.013.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Population declining ant colony optimization (PDACO) algorithm is proposed and applied to the traveling salesman problem (TSP) and multiuser detection in this paper. Ant colony optimization (ACO) algorithms have already successfully been used in combinatorial optimization, however, as the pheromone accumulates, we may not get a global optimum because it stops searching early. PDACO can enlarge searching range through increasing the initial population of the ant colony, and the population declines in successive iterations. So, the performance of PDACO is superior with the same computational complexity. PDACO is applied to TSP and multiuser detection. Via computer simulations it is shown that PDACO has better performance in solving these two problems than ACO algorithms. (C) 2008 Elsevier Ltd. All rights reserved.
Keywords:
Artificial intelligence
Ant colony optimization
Traveling salesman problem
CDMA
Multiuser detection
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.5
Papers:
3.0W
Citations:
10.2W
Organization
Cited Papers
ShareSave
ShareSaveShareSaveShareSaveShareSaveShareSaveA Highly Stereoselective Synthesis of (Z)-N-Aryl(alkyl)-2-arylidine-2,3-dihydro-1,4-benzoxazines through Palladium Catalyzed Reactions.png)
Synlett
SynlettIF0
PREAI
ShareSave
View more