Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Systems Engineering》 2003-01
Add to Favorite Get Latest Update

Research on an Extended TSP Based-on Ant Colony Algorithm

ZHAO Xue-feng (College of Mathematics and Information Science,Northwest Normal University,Lanzhou 730070,China)  
Traval Salesman Problem(TSP) is a kind of NP-hard combinatorial optimization problem, it has some extended form.In this paper an improved ant colony algorithm is presented for the extended TSP model.The algorithm offered combines the guidance mechanism of superior antibodies. Numerical instance indicates satisfactory results.
【CateGory Index】: O221
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