By Topic

Heuristic Simulated Annealing Genetic Algorithm for Traveling Salesman Problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Luo Delin ; Sch. of Inf. Sci. & Technol., Xiamen Univ., Xiamen, China ; Zhang Lixiao ; Xu Zhihui

Traveling Salesman Problem (TSP) is a kind of hard problem in the mathematic field. It is very hard to solve using deterministic algorithms. So it often resorts to heuristic stochastic search algorithms. In this paper, a Heuristic Simulated Annealing Genetic Algorithm (HSAGA) is presented to solve TSP problem, in which Genetic Algorithm (GA) functions as global search strategy while the designed Heuristic Simulated Annealing (HSA) algorithm acts as local search strategy applied on partial optimal solutions at each iteration. The function of HSA is to enhance the search effectiveness over the solution space and to avoid getting stuck into local optimal trap. Simulation results demonstrate that the effectiveness of the presented algorithm.

Published in:

Computer Science & Education (ICCSE), 2011 6th International Conference on

Date of Conference:

3-5 Aug. 2011