论文部分内容阅读
根据不同情况的要求,采用多种算法来确定邮路规划.1)按照邮车不超载的要求,提出改进型贪心算法,得到符合条件的邮路规划,并结合实际,进一步提出改进方案.2)依据最小生成树理论,提出对各支局进行初步分组方法.同时,基于Floyd算法,提出了改进型TSP算法,并建立求解最小路径的模型,进而得到最经济的邮路规划.3)根据最佳Hamilton圈的理论,判断支局应归入的邮路,从而达到减少成本的目的.4)利用最短路覆盖中心算法,确定最合适的县局地址,使邮路总成本最小化.
According to the requirements of different situations, a variety of algorithms are used to determine the route planning.1) In accordance with the requirement of the overloading of the train, an improved greedy algorithm is proposed to get the postal route planning that meets the requirements and the further improvement is proposed based on the actual situation.2 Based on the theory of minimum spanning tree, a preliminary grouping method is proposed for each branch office.At the same time, based on the Floyd algorithm, an improved TSP algorithm is proposed and a model for solving the minimum path is established to obtain the most economical route planning.3) Good Hamilton cycle theory, to determine the branch should be included in the postal route, so as to achieve the purpose of reducing costs.4) The use of shortest path cover center algorithm to determine the most suitable county address, so that the total postal route cost is minimized.