基于模拟退火算法的曲面最短路径求解

Solving the Shortest Path on Curved Surface Based on Simulated Annealing Algorithm

通过对路径的节点序列内在关联性的分析 ,提出了适合曲面最短路径问题的邻域结构 ,使整段路径的优化问题能够通过局部调整得以实现 .将模拟退火算法的框架引入路径寻优中 ,提出了解决曲面最短路径的随机搜索算法 .

By analyzing the intrinsic relationship of the nodal point series of the path, the neighborhood structure corresponding to the Shortest Path on Curved Surface Problem is presented, so as to make the problem be setfled by local tuning. With the framework of Simulated Annealing Algorithm, the stochastic algorithm is proposed. The numerical simulation is given at the end.