ScholarLens Back to search
2007•Modern Electronics TechniqueRequires access

Solution of Travelling Salesman Problem by a Kind of Simulated Annealing Algorithm

Liu Xiangbin

Open publisher page 1 citations

Abstract

Travelling Salesman Problem(TSP) is one of the typical NP-hard problems in combinatorial optimization,which is easy to be described but hard to be solved.Its possible amounts of path increase exponentially with the amounts of city,so it is very difficult to solve it.TSP is first introduced in this paper,then the principal of simulated annealing algorithm and its algorithm realization are introduced too.TSP is studied by simulated annealing algorithm and an approximate algorithm which method for solving TSP is better than others,and using Matlab,we complete the program for solving TSP.The simulation of algorithm for travelling salesman problem is given,and the results prove its efficiency.

About this research paper

What this paper is about

Travelling Salesman Problem(TSP) is one of the typical NP-hard problems in combinatorial optimization,which is easy to be described but hard to be solved.Its possible amounts of path increase exponentially with the amounts of city,so it is very difficult to solve it.TSP is first introduced in this paper,then the principal of simulated annealing algorithm and its algorithm realization are introduced too.TSP is studied by simulated annealing algorithm and an approximate algorithm which method for solving TSP is better than others,and using Matlab,we complete the program for solving TSP.The simulation of algorithm for travelling salesman problem is given,and the results prove its efficiency.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Travelling Salesman Problem(TSP) is one of the typical NP-hard problems in combinatorial optimization,which is easy to be described but hard to be solved.Its possible amounts of path increase exponentially with the amounts of city,so it is very difficult to solve it.TSP is first introduced in this paper,then the principal of simulated annealing algorithm and its algorithm realization are introduced too.TSP is studied by simulated annealing algorithm and an approximate algorithm which method for solving TSP is better than others,and using Matlab,we complete the program for solving TSP.The simulation of algorithm for travelling salesman problem is given,and the results prove its efficiency.

Key concepts: Travelling salesman problem, Simulated annealing, 2-opt, Bottleneck traveling salesman problem, Mathematical optimization, Computer science, Lin–Kernighan heuristic, Christofides algorithm

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Solution of Travelling Salesman Problem by a Kind of Simulated Annealing Algorithm — Research Paper | ScholarLens