中国像素地图最优路线分析摘要 本文对最优路线问题进行分析研究。问题 1 将中国像素地图计算出 0,1 矩阵，利用穷举法对问题进行求解，从图片的左上角开始寻找满足数值的点并赋值。问题 2 是在不考虑实际地表的复杂情况下，求解出 A、B、C、D 四点不经过境外区域和红色区域的彼此之间的最短路线。利用的是运筹最优化来进行分析求解。在两点之间寻找所要经过的点，在图中画出每个点的范围，用 MATLAB 穷举范围内的每个点计算距离和，求解出距离和的最小值。关键词 最优路线 穷举法 运筹最优化 MATLABAnalysis of the optimal route of Chinese pixel mapAbstract This paper analyzes and studies the optimal route problem. In problem 1, the pixel map of China is calculated as 0,1 matrix, and the problem is solved by means of exhaustive method. Starting from the upper left corner of the picture, the points that satisfy the value are found and assigned. Problem 2 is to solve the shortest route between four points A, B, C and D without passing through the outer region and the red region without considering the complex situation of the actual surface. The optimization of operation is used to analyze the solution. Find the points to pass between two points, draw the range of each point in the graph, and calculate the distance and the minimum value of the distance and each point within the range with MATLAB.KEY WORDS the optimal route exhaustive method operational optimization MATLAB目录引言.....................................................................................................................................11.问题重述和分析................................................................................................................21.1 问题重述.................................................................................................................21.2 问题分析............................................................................
