ScholarLens Back to search
2003•Unpublished venueRequires access

Solving TSP with Simulated Annealing Algorithm

Shang Gao

Open publisher page 1 citations

Abstract

TSP (Traveling Salesman Problem) is a typical NP-Complete problem. The simulated annealing algorithm (SA) is a better method for solving TSP. The simulated annealing algorithm is an iterative search procedure based on a neighborhood structure. The quality of the annealing solution is very sensitive to the way that the trial solutions are selected. In order to search neighborhood of the trial solution, six strategies are put forward. By analysis and test, it is proved that Strategy F is a simple and effective algorithm.

About this research paper

What this paper is about

TSP (Traveling Salesman Problem) is a typical NP-Complete problem. The simulated annealing algorithm (SA) is a better method for solving TSP. The simulated annealing algorithm is an iterative search procedure based on a neighborhood structure. The quality of the annealing solution is very sensitive to the way that the trial solutions are selected. In order to search neighborhood of the trial solution, six strategies are put forward. By analysis and test, it is proved that Strategy F is a simple and effective algorithm.

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

TSP (Traveling Salesman Problem) is a typical NP-Complete problem. The simulated annealing algorithm (SA) is a better method for solving TSP. The simulated annealing algorithm is an iterative search procedure based on a neighborhood structure. The quality of the annealing solution is very sensitive to the way that the trial solutions are selected. In order to search neighborhood of the trial solution, six strategies are put forward. By analysis and test, it is proved that Strategy F is a simple and effective algorithm.

Key concepts: Simulated annealing, Travelling salesman problem, Adaptive simulated annealing, Mathematical optimization, Algorithm, Annealing (glass), Computer science, Hill climbing

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Solving TSP with Simulated Annealing Algorithm — Research Paper | ScholarLens