节点文献
基于模拟退火算法的全国最优旅行方案
Optimal Nationwide Traveling Scheme Based on Simulated Annealing Algorithm
【摘要】 以如何走遍全国各省会、直辖市、香港、澳门、台北为基础设计旅行方案,对旅行时的路径最短,费用最少等现实问题进行分析,在充分考虑旅行费用与路线,时间与交通工具的关系后,以实现路径最短与费用时间最少为目标,进行系统建模,并应用模拟退火算法对模型进行求解,得出了一条综合考虑省钱、省时的旅行路径。结果表明了该旅行方案的正确性和现实价值。
【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 algorithm 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.
【关键词】 模拟退火算法;
穷举搜索法;
TSP问题;
最优旅行方案;
【Key words】 simulated annealing algorithm; exhaustive search algorithm; travelling salesman problem; optimal itinerary scheme;
【Key words】 simulated annealing algorithm; exhaustive search algorithm; travelling salesman problem; optimal itinerary scheme;
- 【文献出处】 现代电子技术 ,Modern Electronics Technique , 编辑部邮箱 ,2011年02期
- 【分类号】TP301.6
- 【被引频次】4
- 【下载频次】321