期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
Information in the Traveling Salesman Problem
1
作者 Gilad Barach hugo fort +1 位作者 Yoni Mehlman Fredy Zypman 《Applied Mathematics》 2012年第8期926-930,共5页
In the Simulated Annealing algorithm applied to the Traveling Salesman Problem, the total tour length decreases with temperature. Empirical observation shows that the tours become more structured as the temperature de... In the Simulated Annealing algorithm applied to the Traveling Salesman Problem, the total tour length decreases with temperature. Empirical observation shows that the tours become more structured as the temperature decreases. We quantify this fact by proposing the use of the Shannon information content of the probability distribution function of inter–city step lengths. We find that information increases as the Simulated Annealing temperature decreases. We also propose a practical use of this insight to improve the standard algorithm by switching, at the end of the algorithm, the cost function from the total length to information content. In this way, the final tour should not only be shorter, but also smoother. 展开更多
关键词 TRAVELING SALESMAN PROBLEM Shannon ENTROPY
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部