带时间约束的配送网络流问题  

Physical Distribution Network Flow Problem with Time Limit

作　　者：雷挺[1] 汪达成[1] 

机构地区：[1]重庆交通大学理学院,重庆南岸400074

出　　处：《重庆文理学院学报（自然科学版）》2007年第3期5-8,共4页Journal of Chongqing University of Arts and Sciences

基　　金：重庆市教委基础研究项目(KJ060416)

摘　　要：考虑带时间约束的物流配送中的网络优化问题,即由配送中心向各个客户通过某种运输工具(如货车)供应货物的问题,目的是在满足各客户对时间和需求量的要求下尽可能降低配送成本.首先不考虑时间约束,通过一个混和整数规划模型来加以描述,以网络单纯形法、拉格朗日松弛算法以及试探法为主要研究方法,有效地得到在没有时间约束条件下的一个近似程度较高的可行解;再在所得结果的基础上进行修正直到得出满足时间约束的可行解.A physical distribution network flow problem with time limit is proposed in this paper, which is about transferring cargo from distribution center to customers by some cartier like truck , etc. The goal is to decrease the distribution cost, simultaneously the costumers＇ request about time and quantities must be fulfiled . A mixed integer programming model is used to describe the problem in which time limit is not thinking about. Taking network simplex method and lagrangian relaxation and heuristic method as the main research methods, an approximate solution can be gotten, which can be modified till time limit is fulfiled.

关 键 词：混和整数规划 拉格朗日松弛 网络单纯形法 试探法 

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