Comparison of various algorithms based on TSP solving

The traveling salesman problem (TSP) is a classic combinatorial optimization problem. As a hot research problem, it has been applied in many fields. Since there is currently no algorithm with good performance that can perfectly solve this problem, for the solution of the traveling salesman problem,...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of physics. Conference series Ročník 2083; číslo 3; s. 32007 - 32013
Hlavný autor:	Zhang, JianChen
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	IOP Publishing 01.11.2021
Predmet:	branch and bound method dynamic programming method genetic algorithm greedy method traveling salesman problem
ISSN:	1742-6588, 1742-6596
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Popis
Shrnutí:	The traveling salesman problem (TSP) is a classic combinatorial optimization problem. As a hot research problem, it has been applied in many fields. Since there is currently no algorithm with good performance that can perfectly solve this problem, for the solution of the traveling salesman problem, this article first establishes a mathematical model of the traveling salesman problem, and uses four solving methods for the same case: the greedy method, Branch and bound method, dynamic programming method and genetic algorithm, analyze the applicability and accuracy of different algorithms in the same case.
ISSN:	1742-6588 1742-6596
DOI:	10.1088/1742-6596/2083/3/032007