一种省际邮件转运网络设计的模型与算法  

An Inter-Province Post Transhipment Problem and Its Algorithm

作　　者：叶耀华[1] 蒋怡乐[1] 王律[1] 

机构地区：[1]复旦大学管理学院管理科学系,上海200433

出　　处：《复旦学报（自然科学版）》2003年第5期680-684,713,共6页Journal of Fudan University：Natural Science

摘　　要：针对中国邮政系统省际邮件运输网络提出了一种带时间窗口的有容量限制网络设计问题,为其建立了一个线性0 1规划模型,并给出基于Lagrange松弛的分支定界算法.A capacitated network design problem with time window (CNDPTW) for the Chinese interprovince post transhipment problem is presented, and a linear 01 programming is formulated for the CNDPTW. A branchandbound algorithm based on Lagrangean relaxation is also given for this problem.

关 键 词：拉格朗日松弛法 分支定界 时间窗口 0-1规划 

分 类 号：F616.3[经济管理—产业经济] O221.7[理学—运筹学与控制论]