A Fast Fully Parallel Ant Colony Optimization Algorithm Based on CUDA for Solving TSP
In view of the known problems of parameter sensitivity, local optimum, and slow convergence in the ant colony optimization (ACO), we aim to improve the performance of the ACO. To solve the traveling salesman problem (TSP) quickly with accurate results, we propose a fully parallel ACO (FP-ACO). Based...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2023-01-01
|
| Series: | IET Computers & Digital Techniques |
| Online Access: | http://dx.doi.org/10.1049/2023/9915769 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|