Remora optimization algorithm-based adaptive fusion via ant colony optimization for traveling salesman problem
The traditional ant colony optimization (ACO) is easy to fall into local optimal when solving large-scale traveling salesman problem (TSP), and the convergence speed is slow. In order to enhance the local search ability of ACO, speed up the efficiency of ACO and avoid the premature problem, this pap...
Saved in:
| Published in: | Computer Science and Information Systems Vol. 21; no. 4; pp. 1651 - 1672 |
|---|---|
| Main Author: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
01.09.2024
|
| ISSN: | 1820-0214, 2406-1018 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!