首页 | 本学科首页   官方微博 | 高级检索  
     检索      

邮政运输网络中的邮路规划和邮车调整
引用本文:高玉建,苏昊,黄飞.邮政运输网络中的邮路规划和邮车调整[J].数学的实践与认识,2008,38(14).
作者姓名:高玉建  苏昊  黄飞
作者单位:北京航空航天大学,北京,100083
摘    要:主要针对我国邮政运输业中邮路规划和邮车调整问题,研究了在规定时间、规定邮车运载能力限制的条件下,单个县级邮区内的最小成本/最小空车率邮路规划以及多个邮区协同规划的策略,提出了一个用于辅助规划的邮路存在性定理,设计并实现了基于最小生成树和TSP的县级邮路规划算法.最后在打破县区行政规划的基础上,对整个市区的支局进行重新划分并求解得到了优于前面邮路规划的新方案.

关 键 词:邮路规划  邮政运输效益  TSP  最小生成树

The Postal Route Layout and Mail Cart Rearrangement for the Post Transport Network
GAO Yu-jian,SU Hao,HUANG Fei.The Postal Route Layout and Mail Cart Rearrangement for the Post Transport Network[J].Mathematics in Practice and Theory,2008,38(14).
Authors:GAO Yu-jian  SU Hao  HUANG Fei
Abstract:A case study of the postal route layout and mail cart rearrangement problems for the Post Transport Network in China was conducted.The case was investigated by 4 steps,each of which was treated by a quantitative mathematical model.To treat the postal route layout problem with fixed region boundary,a novel model based on Minimal Spanning Tree and TSP(Traveling Salesman Problem)is proposed,and to treat the postal route layout problem without fixed region boundary,another novel model called ″region competes branch post offce″ was proposed.Both models have demonstrated good performances in the case study.
Keywords:TSP
本文献已被 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号