人工智能问题，通过模拟退火算法实现旅行商问题，随机产生31个地址，计算旅行商走完的最短路径，并绘制路线图。作者：陈华昌-Using simulated annealing algorithm achive "traveler" problem.

利用模拟退火算法实现有向图最短路径的计算，基本与康立山的参数确定方法相同，只是结束条件改为温度下降到0.2截止。-Simulated annealing algorithm has to map the shortest path calculation, basic and Kang Lishan determine the parameters of the same way, but the conditions to end cut-off temperature dropped to

基于java的模拟退火算法实现，详细的例子，可供开发者收藏于参考-simulate annealling algorithm for java, the best example for he java developer