期刊文献+

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

Research on modeling and algorithm for three-layer distribution network location-routing problem
原文传递
导出
摘要 鉴于固定费用选址问题的一个重要局限是在运输成本的计算中,假设采用整车运输方式,其运输成本与考虑运输路径时的成本不同会影响选址决策.针对一个钢材销售企业的三级物流网络中的两级设施进行选址,采用多站式运输方式计算运输成本,问题为三级物流网络选址-路径问题.采用嵌入拉格朗日启发式算法的分枝定界方法来求解,并对该方法进行了实验测试,测试结果表明该方法是有效的. 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.
出处 《控制与决策》 EI CSCD 北大核心 2010年第8期1195-1200,1206,共7页 Control and Decision
基金 国家科技计划项目(2007AA04Z189) 国家科技支撑计划项目(2006BAH02A07)
关键词 三级物流网络 选址路径问题 拉格朗日启发式算法 分枝定界法 Three-layer distribution network Location-routing problem Lagrangian heufistic Branch and bound
  • 相关文献

参考文献16

  • 1Salhi S, Rand G K. The effect of ignoring routes when locating depots[J]. European J of Operational Research, 1989, 39(2): 150-156.
  • 2Maranzana F E. On the location of supply points to minimise transport costs[J]. Operational Research Quarterly, 1964, 15(3): 261-270.
  • 3Laporte G, Nobert Y. An exact algorithm for minimizing routing and operating costs in depot location[J]. European J of Operational Research, 1981, 6(2): 224-226.
  • 4Laporte G, Nobert Y, Pelletier J. Hamiltonian location problems[J]. European J of Operational Research, 1983, 12(1): 82-89.
  • 5Laporte G, Nobert Y, Arpin D. An exact algorithm for solving a capacitated location-routing problem[J]. Annals of Operations Research, 1986, 6(9): 293-310.
  • 6Beasley J E. Lagrangian heuristic for location problem[J]. European J of Operational Research, 1993, 65(3): 383-399.
  • 7李志华,王启富,钟毅芳,周亦波.物流网络设计建模与求解算法研究[J].机械工程学报,2003,39(2):84-89. 被引量:7
  • 8Perl J, askin M S. A warehouse location-routing problem[J]. Transportation Research, 1985, 19(5): 381- 396.
  • 9Wu T H, Bai J W. Heuristic solutions to multi-Depot location-routing problems[J]. Computers and Operations Research, 2002, 29(10): 1393-1415.
  • 10Tragantalerngsak S, Holt J, Ronnqvist M. Lagrangian relaxation heuristic for two-echelon single-source capacitated facility location problem[J]. European J of Operational Research, 1997, 102(3): 611-625.

二级参考文献8

  • 1[1]Heragu S S. Recent models and techniques for solving the layout problem. European Journal of Operational Research, 1992, 57(2):136~144
  • 2[2]Heragu S S, Kusiak A. Efficient models for the facility layout problem. European Journal of Operational Research, 1991, 53(1):1~13
  • 3[3]Chhajed D, Montreuil B, Lowe T J. Flow network design for manufacturing systems layout. European Journal of Operational Research, 1992, 57(2):145~161
  • 4[4]Johnson D S, Lenstra J K, Rinnooy H G. The complexity of the network design problem. Networks, 1978, 8:279~285
  • 5[5]Magnanti T L, Wong R T. Network design and transporta-tion planning:models and algorithms. Transportation Science, 1984, 18(1):1~55.
  • 6[6]Holmberg K, Yuan D. A lagrangean approach to network design problems. International Transactions in Operational Research, 1998, 5(6):529~539
  • 7[7]Herrmann J W. A dual ascent approach to the fixed-charge capacitated network design problem. European Journal of Operational Research, 1996, 95:476~490
  • 8[8]Sridhar V, Park J S. Benders-and-cut algorithm for fixed-charge capacitated network design problem. European Journal of Operational Research, 2000, 125:622~632

共引文献66

同被引文献188

引证文献20

二级引证文献160

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部