| 基于模拟退火算法的全国最优旅行方案 |
| |
| 引用本文： | 吕鹏举,原杰,吕菁华. 基于模拟退火算法的全国最优旅行方案[J]. 现代电子技术, 2011, 34(2): 32-34 |
| |
| 作者姓名： | 吕鹏举 原杰 吕菁华 |
| |
| 作者单位： | 1. 哈尔滨医科大学大庆校区医学信息学系,黑龙江,大庆,163319
2. 哈尔滨师范大学,物理与电子工程学院,黑龙江,哈尔滨,150025 |
| |
| 摘 要： | 以如何走遍全国各省会、直辖市、香港、澳门、台北为基础设计旅行方案,对旅行时的路径最短,费用最少等现实问题进行分析,在充分考虑旅行费用与路线,时间与交通工具的关系后,以实现路径最短与费用时间最少为目标,进行系统建模,并应用模拟退火算法对模型进行求解,得出了一条综合考虑省钱、省时的旅行路径。结果表明了该旅行方案的正确性和现实价值。
|
| 关 键 词： | 模拟退火算法 穷举搜索法 TSP问题 最优旅行方案 |
Optimal Nationwide Traveling Scheme Based on Simulated Annealing Algorithm |
| |
| L Peng-ju,YUAN Jie,L Jing-hua. Optimal Nationwide Traveling Scheme Based on Simulated Annealing Algorithm[J]. Modern Electronic Technique, 2011, 34(2): 32-34 |
| |
| Authors: | L Peng-ju YUAN Jie L Jing-hua |
| |
| Affiliation: | L(U) Peng-ju,YUAN Jie,L(U) Jing-hua |
| |
| Abstract: | An optimal itinerary scheme to travel through provincial capitals, municipalities, Hong Kong, Macao, Taiwan is designed. The practical problems of the shortest path and least cost for travelling to the above places are analyzed. Taking account of the relationship of cost, route, duration and transportation, a model is established. The simulated annealing algo- rithm is adopted to solve the model. A travel path of saving money and time is obtained by a comprehensive consideration. The results show the correctness of this travel program and practical value. |
| |
| Keywords: | simulated annealing algorithm exhaustive search algorithm travelling salesman problem optimal itinerary scheme |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
