A new method for handling the traveling salesman problem based on parallelized genetic ant colony systems

In this paper, we present a new method for handling the traveling salesman problem, called the parallelized genetic ant colony systems (PGACS). The proposed method combines genetic algorithms with new crossover operations, hybrid mutation operations and ant colony systems with communication strategies. We also make an experiment using three well-known data sets of the traveling salesman problem. The experiment results show that the performance of the proposed method is better than the method presented in [2] in both the result and the convergence time.