我国邮政网络的优化设计方法  

The Optimal Design Method for the Nation’s Post Network

作　　者：叶耀华[1] 王律[1] 杨文涛[1] 周焕德 张耀华 金卫平 

机构地区：[1]复旦大学管理科学系,上海200433 [2]国家邮政总局上海研究所,上海200062

出　　处：《管理工程学报》2004年第2期39-43,共5页Journal of Industrial Engineering and Engineering Management

基　　金：教育部人文社会科学研究博士点基金研究项目(03JB630008)

摘　　要：我国邮政网络是一个巨大复杂的系统。本文通过对省际转运网、市内转运网和特快邮件投递网进行优化设计,以求邮政网络在整体上实现优质服务和成本的优化。这三个网络的优化设计分别是带时间和容量限制的网络设计问题(CNDPTC)、带时间窗口的车辆路线问题(VRPTW)和带时间限制的K人旅行售货员问题(K＿TSPTC)。我们分别采用拉格朗日松弛法(LagrangianRelaxation)和列生成法(ColumnGeneration)求解。The nations post network is a huge and complex system. This papers objective is to improve the service and minimize the cost of the whole network by analysing the interprovince post transportation network, the local post transportation network and the express post transportation network. Respectively, these three sub_networks are the capacitated network design problem with time constraints (CNDPTC), the vehicle routing problem with time windows(VRPTW) and the K-travel salesmen problem with time constraint (K_TSPTC). In this paper, we use Lagrangian Relaxation and Column Generation respectively, and propose efficient algorithms.

关 键 词：邮政网络 网络设计 路线问题 

分 类 号：O221.4[理学—运筹学与控制论] F611[理学—数学]