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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of physics. Conference series Ročník 1682; číslo 1; s. 12040 - 12045
Hlavní autoři: Yu, Guyang, Shi, Huajun
Médium: Journal Article
Jazyk:angličtina
Vydáno: Bristol IOP Publishing 01.11.2020
Témata:
Greedy algorithms
Physics
Traveling salesman problem
ISSN:1742-6588, 1742-6596
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 greedy algorithm for the TSP. Meanwhile, some relevant theorems and conjectures as well as some problems triggered are discussed as well.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1742-6588
1742-6596
DOI:10.1088/1742-6596/1682/1/012040