Dynamic Density Clustering Ant Colony Algorithm With Filtering Recommendation Backtracking Mechanism
Ant colony system has a good performance in solving Traveling Salesman Problem (TSP), but it tends to fall into local optimum and is deficient in convergence speed. To address this problem, a dynamic density clustering ant colony algorithm with a filtering recommendation backtracking mechanism is pr...
| Main Authors: | , , |
|---|---|
| 格式: | 文件 |
| 语言: | English |
| 出版: |
IEEE
2020-01-01
|
| 丛编: | IEEE Access |
| 主题: | |
| 在线阅读: | https://ieeexplore.ieee.org/document/9118883/ |