Combining 3-Opt and Improved Discrete Cuckoo Search Algorithm for the Traveling Salesman Problem
The traveling salesman problem (TSP) is a well-known NP-hard combinatorial optimization problem. In TSP, the objective is to find the shortest distance to the most appropriate route to the starting city. Finding an optimal solution in a reasonable time becomes difficult as the number of cities incre...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2024-01-01
|
| Series: | Discrete Dynamics in Nature and Society |
| Online Access: | http://dx.doi.org/10.1155/2024/1953277 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|