By Topic

Exact Heuristic 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
$31 $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)
Dongmei Lin ; Center of Inf. & Educ. Technol., Foshan Univ., Foshan ; Xiangbin Wu ; Dong Wang

Natural properties of stochastic searching strategies and operations in metaheuristic algorithms have important influence on convergence performance of various metaheuristic algorithms. Through similarity analysis to two kinds of metaheuristic algorithms, exact heuristic algorithm based on branch-and-cut is put forward according to change trend of similarity between two arbitrary high-quality solutions. In the meanwhile, two conditions were given in this paper because efficiency of branch-and-cut algorithm is closely allied to complexity of solved object. New heuristic algorithm can help metaheuristic algorithms finding superior solutions than other heuristic algorithms, and accelerate metaheuristic algorithms convergence. Simulation experiments show that new heuristic algorithm is efficacious.

Published in:

Young Computer Scientists, 2008. ICYCS 2008. The 9th International Conference for

Date of Conference:

18-21 Nov. 2008