A NEW METHOD FOR HANDLING THE TRAVELING SALESMAN PROBLEM BASED ON PARALLELIZED GENETIC ANT COLONY SYSTEMS

被引:6
作者
Chien, Chih-Yao [1 ]
Chen, Shyi-Ming [1 ]
机构
[1] Natl Taiwan Univ Sci & Technol, Dept Comp Sci & Informat Engn, Taipei, Taiwan
来源
PROCEEDINGS OF 2009 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-6 | 2009年
关键词
Ant colony systems; Genetic algorithms; Parallelization; Traveling salesman problem; Parallelized genetic ant colony systems; OPTIMIZATION;
D O I
10.1109/ICMLC.2009.5212601
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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 121 in both the result and the convergence time.
引用
收藏
页码:2828 / 2833
页数:6
相关论文
共 17 条
[1]  
ADACHI N, 1995, P 1 INT C GEN ALG EN
[2]  
[Anonymous], 1975, Ann Arbor
[3]  
[Anonymous], 1992, THESIS DIPARTIMENTO
[4]   Ant colony system with communication strategies [J].
Chu, SC ;
Roddick, JF ;
Pan, JS .
INFORMATION SCIENCES, 2004, 167 (1-4) :63-76
[5]  
DEITEL HM, 2001, C PROGRAM, P158
[6]   Ant colonies for the travelling salesman problem [J].
Dorigo, M ;
Gambardella, LM .
BIOSYSTEMS, 1997, 43 (02) :73-81
[7]  
Dorigo M., 1997, IEEE Transactions on Evolutionary Computation, V1, P53, DOI 10.1109/4235.585892
[8]   A PARALLEL TABU SEARCH ALGORITHM FOR LARGE TRAVELING SALESMAN PROBLEMS [J].
FIECHTER, CN .
DISCRETE APPLIED MATHEMATICS, 1994, 51 (03) :243-267
[9]  
HOPFIELD JJ, 1985, BIOL CYBERN, V52, P141
[10]   OPTIMIZATION BY SIMULATED ANNEALING [J].
KIRKPATRICK, S ;
GELATT, CD ;
VECCHI, MP .
SCIENCE, 1983, 220 (4598) :671-680