Study of Pseudo-Parallel Genetic Algorithm with Ant Colony Optimization to Solve the TSP
Sheng Li, Huiqin Chen, Zheng Sophia Tang · 2011
Summary The traveling salesman problem (TSP) has attracted many researchers’ attention in the past few decades, and amounts of algorithms based on heuristic algorithms, genetic algorithms, particle swarm optimization, tabu search and memetic algorithms have been presented to solve it, respectively. Unfortunately, their results have not been satisfied at all yet. This paper is devoted to the presentation of a novel hybrid pseudo-parallel genetic algorithm with ant colony optimization (PPGA-ACO). The experimental results on small and large size TSP instances in TSPLIB (traveling salesman problem library) show that PPGAACO is more robust and efficient than the traditional algorithms.