论文部分内容阅读
主要针对我国邮政运输业中邮路规划和邮车调整问题,研究了在规定时间、规定邮车运载能力限制的条件下,单个县级邮区内的最小成本/最小空车率邮路规划以及多个邮区协同规划的策略,提出了一个用于辅助规划的邮路存在性定理,设计并实现了基于最小生成树和TSP的县级邮路规划算法.最后在打破县区行政规划的基础上,对整个市区的支局进行重新划分并求解得到了优于前面邮路规划的新方案.
Mainly for the postal transport industry in our country postal plan and post adjustment, the paper studies the minimum cost / minimum empty postal route planning in a single county postal area under the condition of stipulating time, Aiming at the strategy of collaborative planning of multiple postal districts, a postal route existence theorem for assisting planning is proposed and a county-level postal planning algorithm based on minimum spanning tree and TSP is designed and implemented.Finally, On the whole of the urban branch of the redistribution and solution has been better than the previous program of the new postal plan.