|
|||||
|
|
| 基于模拟退火算法的曲面最短路径求解 | |
| 引用本文： | 黄樟灿,陈思多,康立山,陈毓屏. 基于模拟退火算法的曲面最短路径求解[J]. 武汉大学学报(理学版), 2000, 46(3): 273-276 |
| 作者姓名： | 黄樟灿 陈思多 康立山 陈毓屏 |
| 作者单位： | 1. 武汉汽车工业大学,基础课部,武汉,430070 2. 武汉汽车工业大学,电信学院,式汉,430070 3. 武汉大学,软件工程国家重点实验室,武汉,430072 |
| 基金项目： | 国家863计划资助项目(863-ZT06-06-3);湖北省自然科学基金(9752018129)资助项目 |
| 摘 要： | 通过对路径的节点序列内在关联性的分析，提出了适合曲面最短路径问题的邻域结构，使整段路径的优化问题能够通过局部调整得以实现．将模拟退火算法的框架引入路径寻优中，提出了解决曲面最短路径的随机搜索算法．最后给出了数值仿真实例． |
| 关 键 词： | 曲面最短路径&邻域结构 启发式概率搜索 模拟退火算法 |
| 文章编号： | 0253-9888(2000)03-0273-04 |
| 修稿时间： | 1999-12-27 |
Solving the Shortest Path on Curved Surface Based on Simulated Annealing Algorithm |
|
| HUANG Zhang-can,CHEN Si-duo,KANG Li-shan,CHEN Yu-ping. Solving the Shortest Path on Curved Surface Based on Simulated Annealing Algorithm[J]. JOurnal of Wuhan University:Natural Science Edition, 2000, 46(3): 273-276 | |
| Authors: | HUANG Zhang-can CHEN Si-duo KANG Li-shan CHEN Yu-ping |
| Affiliation: | HUANG Zhang-can;(Division of Basic Science, Wuhan Automotive Polytechnic University, Wuhan 430070,China);CHEN Si-duo;(School of Electronics and Information, Wuhan Automotive Polytechnic University, Wuhan 430070,China);KANG Li-shan,CHEN Yu-ping;(State Key Laboratory of Software Engineering, Wuhan University, Wuhan 430072,China) |
| Abstract: | By analyzing the intrinsic relationship of the nodal point series of the path,the borhood structure corresponding to the Shortest Path on Curved Surface Problem is presented, so as ke the problem be settled by local tuning. With the framework of Simulated Annealing Algorithm, ochastic algorithm is proposed. The numerical simulation is given at the end. |
| Keywords: | shortest path on curved surface neighborhood structure heuristic probability search ated annealing algorithm |
| 本文献已被 CNKI 万方数据 等数据库收录！ | |