Name
Abstract | ||
|---|---|---|
The ant colony optimization (ACO) algorithm is a type of classical swarm intelligence algorithm that is especially suitable for combinatorial optimization problems. To further improve the convergence speed without affecting the solution quality, in this paper, a novel strengthened pheromone update mechanism is designed that strengthens the pheromone on the edges, which had never been done before, utilizing dynamic information to perform path optimization. In addition, to enhance the global search capability, a novel pheromone-smoothing mechanism is designed to reinitialize the pheromone matrix when the ACO algorithm's search process approaches a defined stagnation state. The improved algorithm is analyzed and tested on a set of benchmark test cases. The experimental results show that the improved ant colony optimization algorithm performs better than compared algorithms in terms of both the diversity of the solutions obtained and convergence speed. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.ins.2017.12.047 | Information Sciences |
Keywords | Field | DocType |
Ant colony optimization,Swarm intelligence,Pheromone update mechanism,Pheromone smoothing mechanism,Constraint satisfaction problem,Traveling salesman problem | Convergence (routing),Ant colony optimization algorithms,Combinatorial optimization problem,Matrix (mathematics),Swarm intelligence,Algorithm,Test case,Mathematics | Journal |
Volume | ISSN | Citations |
433 | 0020-0255 | 6 |
PageRank | References | Authors |
0.44 | 24 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jiaxu Ning | 1 | 141 | 9.00 |
| Qin Zhang | 2 | 47 | 13.66 |
| Changsheng Zhang | 3 | 199 | 15.90 |
| Bin Zhang | 4 | 213 | 41.40 |