中国邮路最短路问题的研究  

The study of the shortest China post road

作　　者：顾戍杰 

机构地区：[1]公安海警学院电子技术系,浙江宁波315801

出　　处：《信息通信》2017年第2期25-28,共4页Information & Communications

摘　　要：中国邮路问题意义重大,在现实中应用广泛。中国邮路问题即利用一种计算方法来求解邮递员投递所需要经历的最短路线。该方法把邮递线路看作连通加权无向图,然后通过Fleury算法求解得到最优邮路。在实际例子的求解过程中,发现该方法并不能求出唯一解即存在次优解。我们将继续研究邮路问题以便获得最佳的计算方法。China postman problem, which is of great significance, has been widely applied in real life. It is to figure out a shortest route a postman needed to deliver the letters with a certain calculation method.In the method,delivery routes are considered as a connected weighted undirected graph,and then to get the optimal post road through Fleury algorithm.In the computation of a practical example,there was exists suboptimal solutions and that is to say,we can't work out the only solution by using the method. We will continue studying the postman problem issue in order to obtain the best calculation method.

关 键 词：图论应用 中国邮路问题 欧拉回路 

分 类 号：O157.5[理学—数学]