以邮政运输网络中运输效益最优为目标,建立了分步规划的图论模型.运用Floyd算法、Kruskal算法对模型进行分步求解并逐步优化,通过Matlab、Lingo、SPSS软件求解,提出三种优化邮路、降低邮车调度成本的方法.模型对解决邮路问题、单旅行商、多旅行商等相关问题具有普遍适用性,可以推广到点数更多TSP的问题. Aiming at the optimal transportation efficiency in postal transport network, a stepwise programming graph theory model is established.Using Floyd algorithm and Kruskal algorithm, the model is solved step by step and optimized by Matlab, Lingo and SPSS software, Optimization of postal routes and reduction of the cost of postal scheduling.The model has universal applicability in solving the problems of postal routes, single-trip operators and multi-trip operators, which can be extended to the point of more TSPs.