三级物流网络选址-路径问题建模与求解算法研究  

Research on modeling and algorithm for three-layer distribution network location-routing problem

作　　者：金莉[1,2] 朱云龙[1] 申海[1,2] 

机构地区：[1]中国科学院沈阳自动化研究所,沈阳110016 [2]中国科学院研究生院,北京100039

出　　处：《控制与决策》2010年第8期1195-1200,1206,共7页Control and Decision

基　　金：国家科技计划项目(2007AA04Z189);国家科技支撑计划项目(2006BAH02A07)

摘　　要：鉴于固定费用选址问题的一个重要局限是在运输成本的计算中,假设采用整车运输方式,其运输成本与考虑运输路径时的成本不同会影响选址决策.针对一个钢材销售企业的三级物流网络中的两级设施进行选址,采用多站式运输方式计算运输成本,问题为三级物流网络选址-路径问题.采用嵌入拉格朗日启发式算法的分枝定界方法来求解,并对该方法进行了实验测试,测试结果表明该方法是有效的.An important limitation of the fixed charge location model is the assumption that full truckload quantities are shipped from a distribution center to a customer.The different location decision is made from the different cost of delivery.A particular three-layer steel product distribution network is investigated,in which two echelons of facilities are located.To make the location decision,the delivery cost of a multiple-stop route is calculated.A Lagrangian relaxation-based branch and bound algorithm is used to solve this location-routing problem.The numerical results for various size test problems are presented,and the results show the effectiveness of the method.

关 键 词：三级物流网络 选址路径问题 拉格朗日启发式算法 分枝定界法 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程] C934[自动化与计算机技术—控制科学与工程]