Reviews of the Meta-heuristic Algorithms for TSP

Traveling salesman problem(TSP) is the representation of a kind of combination optimization problems, possessing a strong engineering background and practical application value. However, there is no effective corresponding solution to it. Aim at that, the research and application of the most popular meta-heuristic methods such as ant colony algorithm, genetic algorithm, simulated annealing, tabu search, hopfield neural network, particle swarm optimization and immune algorithm, etc. are reviewed. The advantages and disadvantages of each method and the improvement strategies are discussed. The future research direction and suggestion are also given.