.png){kind=icon}
.png){kind=icon}
Return
Dynamically induced clustering ant colony algorithm based on a coevolutionary chain
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2022.109231.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
To improve the accuracy and stability of the ant colony algorithm, a dynamically induced clustering ant colony algorithm based on a coevolutionary chain is proposed. First, the pheromone distribution left by ants in small data clusters are divided based on density is used to induce subsequent ants to make selections, thus balancing the convergence speed and solution accuracy. Second, when the algorithm stalls, the coevolutionary chain increases the diversity and stability of the algorithm through population coevolution and dimensionality reduction on chain loops, assisting helping the algorithm get rid of the local optimum. Simulation experiments and rank-sum test analysis showed that the improved ant colony algorithm can effectively balance convergence speed and solution accuracy, and it has better stability. (c) 2022 Elsevier B.V. All rights reserved.
Keywords:
Ant colony algorithm
Induced clustering
Coevolutionary chain
TSP
Journal
K
IF:
7.6
Papers:
1.2W
Citations:
4.5W