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

Full description

Saved in:

Bibliographic Details
Published in:	Journal of physics. Conference series Vol. 2083; no. 3; pp. 32007 - 32013
Main Author:	Zhang, JianChen
Format:	Journal Article
Language:	English
Published:	IOP Publishing 01.11.2021
Subjects:	branch and bound method dynamic programming method genetic algorithm greedy method 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 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