基于MATLAB的最优算法案例分析——关于徐州潘安湖风景区游览路线设计  

Case analysis of optimal algorithm based on MATLAB——about the tour route design of Pan’an Lake Scenic Area in Xuzhou

作　　者：邢玉虎 郝福恺 王嵩 陈昊 XING Yuhu;HAO Fukai;WANG Song;CHEN Hao(Hebei Agricultural University,Baoding 071000,China)

机构地区：[1]河北农业大学

出　　处：《电声技术》2019年第4期55-57,共3页Audio Engineering

摘　　要：2010年,徐州市利用采煤塌陷区形成的开阔水面,建立了6500亩湖面的国家级水利风景区。设计最优的浏览路线,对增加游客在景区浏览的时间十分必要。因此对最优路线进行探讨具有实际性的意义。基于TSP问题的最优Hamilton圈模型,当不考虑时间限制,选择最短路径把潘安湖风景区的八个景区游览完就变成了典型的TSP问题。用图论的方法解释,就是在以这八个景区为顶点形成的图中找一个最优的Hamilton圈。因为该Hamilton圈的规模不大,只有8个点采用MATLAB定义初始圈并不断改良Hamilton圈寻找最优解。In 2010,Xuzhou City built a 6,500-acre national water conservancy scenic spot using the open water surface formed by the coal mining subsidence area. Designing the optimal browsing route is necessary to increase the time for visitors to browse in the scenic area. Therefore,it is practical to explore the optimal route. Based on the optimal Hamiltonian model of the TSP problem,when the time limit is not considered,selecting the shortest path will turn the eight scenic spots in the Pan'an Lake Scenic Area into a typical TSP problem. Explained by the graph theory,it is to find an optimal Hamilton circle in the graph formed by the eight scenic spots. Because the Hamilton circle is small,only 8 points use MATLAB to define the initial circle and continuously improve the Hamilton circle to find the optimal solution.

关 键 词：HAMILTON圈 TSP问题 MATLAB 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]