The Shortest Cruise Route of Unmanned Spy Plane
Si Shoukui · Gongcheng shuxue xuebao · 2003
The question of unmanned spy plane's cruise route is TSP problem, regardless of other constraints. There are no effective real time algorithms of TSP's problem at present. In this paper, firstly we get initial solution by using Monte Carlo method, then we get a satisfactory solution by using simulated annealing algorithm in real time.