A TSP algorithm based on link degree
The fundamentality of the traveling salesman problem (TSP) is the choice of an edge in the next step. This paper proposes a concept of link degree, which can display the potentiality of an edge to belong to the shortest Hamiltonian cycle in a more effectively manner and, on this basis, it presents a...
Saved in:
| Published in: | Journal of physics. Conference series Vol. 1682; no. 1; pp. 12040 - 12045 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Bristol
IOP Publishing
01.11.2020
|
| Subjects: | |
| ISSN: | 1742-6588, 1742-6596 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!