Young Computer Scientists, International Conference for (2008)

Nov. 18, 2008 to Nov. 21, 2008

ISBN: 978-0-7695-3398-8

pp: 9-13

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICYCS.2008.43

ABSTRACT

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.

INDEX TERMS

traveling salesman problem, heuristic algorithm, branch-and-cut, exact algorithm, local search algorithm

CITATION

D. Wang, D. Lin and X. Wu, "Exact Heuristic Algorithm for Traveling Salesman Problem,"

*2008 9th International Conference for Young Computer Scientists(ICYCS)*, Hunan, 2008, pp. 9-13.

doi:10.1109/ICYCS.2008.43

CITATIONS