Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Journal of Beijing University of Technology》 2008-04
Add to Favorite Get Latest Update

An Ant Colony Algorithm Based on Clustering and Partition Optimization

JI Jun-zhong HUANG Zhen LIU Chun-nian (Beijing Municipal Key Laboratory of Multimedia and Intelligent Software Technology,Beijing University of Technology,Beijing 100022,China)  
To improve the computation performance of Ant Colony System for solving large scale Traveling Salesman Problems(TSP),a new algorithm is presented in this paper.It adopts a set of multistage strategies to look for an optimal solution.The analysis for computation complexity and experimental results for TSP problems demonstrate that the proposed algorithm can greatly improve the speed of convergence while keeping more optimal solutions.
【Fund】: 国家自然科学基金(60496322);; 北京市教育委员会科技发展资助项目(KM200610005020)
【CateGory Index】: TP18;TP301.6
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved