邮政运输网络中的邮路规划和邮车调度  

Post-route Planning and Mail-cart Scheduling in Mail Transportation Network

作　　者：胡震宇[1] 吴华玉[1] 唐燕[1] 

机构地区：[1]平原大学基础部,新乡453003

出　　处：《数学的实践与认识》2008年第14期210-221,共12页Mathematics in Practice and Theory

摘　　要：根据不同情况的要求,采用多种算法来确定邮路规划.1)按照邮车不超载的要求,提出改进型贪心算法,得到符合条件的邮路规划,并结合实际,进一步提出改进方案.2)依据最小生成树理论,提出对各支局进行初步分组方法.同时,基于Floyd算法,提出了改进型TSP算法,并建立求解最小路径的模型,进而得到最经济的邮路规划.3)根据最佳Hamilton圈的理论,判断支局应归入的邮路,从而达到减少成本的目的.4)利用最短路覆盖中心算法,确定最合适的县局地址,使邮路总成本最小化.According to different situations and requirements, this thesis adopts diversified algorithm to determine the postal route planning. 1） To provide an advanced greedy algorithm in terns of the demand that mail--cart cannot overload and then get the post-route planning which conforms to the condition. Further more, link to actuality, an improving scheme is advanced. 2） Judging by the theory of minimum spanning tree, a basic classified method of each postal sub office is provided. Meanwhile, an advanced TSP algorithm based on Floyd algorithm is provided and a model of solving minimal path to obtain the cheapest postal route planning is build. 3） On the basis of optimum Hamilton loop theory, to decide which postal route should the postal sub office be classed and to reach the goal of cutting down the cost. 4） To determine the optimum postal sub office address using minimal path overly center algorithm and to minimize the whole postal route cost.

关 键 词：邮路规划 FLOYD算法 TSP算法 贪心算法 最短路覆盖中心算法 

分 类 号：F618[经济管理—产业经济] U492.2[交通运输工程—交通运输规划与管理]