Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《JOURNAL OF BEIJING UNIVERSITY OF CHEMICAL TECHNOLOGY》 1997-01
Add to Favorite Get Latest Update

Solving Chinese Traveling Salesman Problem with Improved Genetic Algorithms

Pan Lideng;Huang Xiaofeng(Department of Chemical Automation. Beijing University of Chemical Technology, Beijing, 100029)  
Genetic Algorithms (GAs)are general-purposeeglobal optimization algorithmsbased on natural evolution rinciple In thisspaple, focusing on a kind of NP completecombinahon optimum problem--Travelling Salesman Problem (TSP), exchange operatorand simulated annealing method are introduced into GAs to approve optimum efficiency.UP to now, the best result of Chinese, TSP is 15 426 km. Only distances between all the cities are used in the improved GAs, and an even better result, 15 409 km,has been obtained.
【CateGory Index】: O224
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