2005•Journal of China Institute of MetrologyRequires access

Solving traveling salesman problem by simulated annealing algorithm

Xiehua Sun

Abstract

This paper improves the simulated annealing algorithm for solving traveling salesman problem(TSP). We add a different method for producing new solutions of TSP, and revise the corresponding function for computing the length. Using Turbo C, we complete the program for solving TSP. Running the program indicates the improved algorithm is useful.

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, 2-opt, Bottleneck traveling salesman problem, Computer science, Algorithm, Mathematical optimization, Mathematics