Dr. James McCaffrey of Microsoft Research shows how to implement simulated annealing for the Traveling Salesman Problem (find the best ordering of a set of discrete items). The goal of a combinatorial ...
This is a preview. Log in through your library . Abstract Application is made to the preference order dynamic programming solution procedure proposed by Kao for a stochastic traveling salesman problem ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback