2011•Journal of Hubei Radio & Television UniversityRequires access

Simulated annealing algorithm for TSP

Zhu Jing-l

Abstract

Traveling salesman problem,that TSP(Travelling Salesman Problem),is a combinatorial optimization problem.Computational complexity with the NPC.This paper analyzes the simulated annealing algorithm model to study the simulated annealing algorithm for TSP of the algorithm,and gives the simulated annealing algorithm for TSP on the specific implementation.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 2 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: Travelling salesman problem, Simulated annealing, Adaptive simulated annealing, Bottleneck traveling salesman problem, Combinatorial optimization, Algorithm, Mathematical optimization, Computer science