Optimization Models and Heuristic Method Based on Simulated Annealing Strategy for Traveling Salesman Problem

Abstract:

Article Preview

The traveling salesman problem (TSP) is a problem in combinatorial optimization studied in operations research and theoretical computer science. In this paper, we presented a novel heuristic simulated annealing algorithm for solving TSP. The algorithm is fully operational in the genetic role of crossover operator, and mutation operator, to achieve a balance between speed and accuracy. The experiment results show that the algorithm is better than the traditional method.

Info:

Periodical:

Edited by:

Shengyi Li, Yingchun Liu, Rongbo Zhu, Hongguang Li, Wensi Ding

Pages:

1180-1184

DOI:

10.4028/www.scientific.net/AMM.34-35.1180

Citation:

X. Hao "Optimization Models and Heuristic Method Based on Simulated Annealing Strategy for Traveling Salesman Problem", Applied Mechanics and Materials, Vols. 34-35, pp. 1180-1184, 2010

Online since:

October 2010

Authors:

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.