2006•Modern Electronics TechniqueRequires access

Simulated Annealing Algorithm and the Application for Solving TSP

Li Guo

Abstract

TSP is a famous NP-hard problem in the theory of combination optimization.Simulated annealing algorithm is an effective method for solving TSP.Simulated annealing algorithm and Metropolis algorithm are introduced.TSP is studied by simulated annealing algorithm and an approximate algorithm which method for solving TSP(NP) is better than others.This algorithm description is beneficial to computer programming.

About this research paper

What this paper is about

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

Key concepts: Simulated annealing, Adaptive simulated annealing, Algorithm, Travelling salesman problem, Computer science, Mathematical optimization, Mathematics