Journal of Guangdong University of Technology ›› 2008, Vol. 25 ›› Issue (1): 38-42.

• Comprehensive Studies • Previous Articles     Next Articles

Research and Implementation of Parallel Ant Colony Optimization Algorithm Based on MPI

  

  1.  (1.Nanguo Business College,Guangdong University of Foreign Studies,Guangzhou 510545,China;2.School of Computer Science,South China University of Technology,Guangzhou 510640,China;3.School of Economics and Management,Guangdong University of Technology,Guangzhou 510520,China)
  • Online:2008-01-01 Published:2008-01-01

HTML

PDF (PC)

2828

Abstract: In this paper,parallel strategy is used develop parallel ant colony optimization algorithm based on Message Passing Interface.The Traveling Salesman Problem is experimented using our system.The results demonstrate that our algorithm is superior to the existing ant colony optimization algorithm and has better running time by using parallel computing.

Key words: ant colony optimization algorithm； message passing interface(MPI)； traveling salesman problem(TSP)；

[1] 张静乐,王世卿,王乐.  具有新型遗传特征的蚁群算法[J]. 微计算机信息. 2006(05) 

[1] Dorigo M,,Maniezzo V,Colorni A.The ant system:optimiza-tion by a colony of cooperating agents. IEEE Transca-tions on Systems,Man and Cybernetics . 1996

[2] Chu S C,Roddick J F,Pan J S,et al.Parallel ant colonysystems. Lecture Notes in Artificial Intelligence . 2003

[3] Dorigo M,Gambardella L M.A Cooperative Learning Approach to the Traveling Salesman Problem. IEEE Transactions on Evolutionary Computation . 1997
No related articles found!
Viewed
Full text


Abstract

Cited
  Shared   
  Discussed   
No Suggested Reading articles found!
Copyright © 2017 Journal of Guangdong University of Technology
Add：729 East Dongfeng RD., Guangzhou PRC. Postcode: 510090
Tel：020-37626653,020-37626139,020-37626396
Email：xbzrb@gdut.edu.cn
Supported:Beijing Magtech