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.
Ant colony systems Genetic algorithms Parallelization Traveling salesman problem Parallelized genetic ant colony systems
CHIH-YAO CHIEN SHYI-MING CHEN
Department of Computer Science and Information Engineering, National Taiwan University of Science an Department of Computer Science and Information Engineering, National Taiwan University of Science an
国际会议
2009 International Conference on Machine Learning and Cybernetics(2009机器学习与控制论国际会议)
保定
英文
2828-2833
2009-07-12(万方平台首次上网日期,不代表论文的发表时间)