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...
Egile Nagusiak: | , , |
---|---|
Formatua: | Artikulua |
Hizkuntza: | English |
Argitaratua: |
IEEE
2020-01-01
|
Saila: | IEEE Access |
Gaiak: | |
Sarrera elektronikoa: | https://ieeexplore.ieee.org/document/9118883/ |