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

Full description

Saved in:
Bibliographic Details
Published in:Journal of physics. Conference series Vol. 1682; no. 1; pp. 12040 - 12045
Main Authors: Yu, Guyang, Shi, Huajun
Format: Journal Article
Language:English
Published: Bristol IOP Publishing 01.11.2020
Subjects:
Greedy algorithms
Physics
Traveling salesman problem
ISSN:1742-6588, 1742-6596
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography: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