旅行商问题的热力学
The Thermodynamics of the Travelling Salesman Problem
摘要:
在这个教学工作中,我们回顾了数学形式主义和物理解释,基于统计力学,称为模拟退火的元算法。此外,我们提出了算法的数学公式,以及为什么它能够产生给定问题的最优解或良好的近似解。此外,我们还描述了旅行商问题,将其解释为马尔可夫链,以及如何使用模拟退火来优化它,并针对两种情况进行了模拟。首先,对于分布在一个圆圈周围的50个城市,我们找到了最佳解决方案。最后,我们在另一个实例中应用了元启发式,100个节点随机均匀分布在一个正方形中,其中一个表明它可以找到一个好的解决方案。
英文摘要:
In this pedagogical work we reviewed the mathematical formalism and the physical interpretation, based on statistical mechanics, of the meta-heuristics called simulated annealing. Moreover, we presented the mathematical formulation of the algorithm and why it is capable to yield the optimal solution or a good approximated solution of a given problem. Furthermore, we described the travelling salesman problem, showing its interpretation as a Markov Chain and how the simulated annealing can be used to optimize it and we did its simulations for two scenarios. Firstly, for 50 cities distributed around a circle and we found the best solution. Finally, we applied the meta-heuristic in a another instance, with 100 nodes random uniformly distributed in a square, and one shows that it allows finding a good solution.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。