Full-Text Search:
Home|About CNKI|User Service|中文
Add to Favorite Get Latest Update

Solving traveling salesman problem by simulated annealing algorithm

SUN Xie-hua(College of Information Engineering, China Jiliang University, Hangzhou 310018, China)  
This paper improves the simulated annealing algorithm for solving traveling salesman problem(TSP). We add a different method for producing new solutions of TSP, and revise the corresponding function for computing the length. Using Turbo C, we complete the program for solving TSP. Running the program indicates the improved algorithm is useful.
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©CNKI All Rights Reserved