首页> 外文会议>2010 International Conference on Logistics Systems and Intelligent Management >An integrated multi-depot location- inventory-routing problem for logistics distribution system planning of a chain enterprise
【24h】

An integrated multi-depot location- inventory-routing problem for logistics distribution system planning of a chain enterprise

机译:连锁企业物流配送系统规划中的综合多仓库选址-选址路由问题

获取原文
获取原文并翻译 | 示例

摘要

We consider an integrated location-inventory-routing problem where the decision marker needs to realize the integrated decisions of facility location, inventory control, and vehicle routing for a logistics distribution system owned to a chain enterprise. This distribution system consists of a center warehouse, multiple potential distribution centers (DCs) and multiple retail stores. Retailer stores in the system face random demand, and receive distribution service from DCs in the same distribution period. The objective is to minimize the total system operation cost that includes facility location cost, inventory cost and transportation cost. We show that this problem can be formulated as a nonlinear mixed integrated programming model, for which we proposed a nested lagrangian relaxation-based solution algorithm. An outer Lagrangian relaxation embedded in subgradient optimization decompose the parent problem into two sub-problems. The first sub-problem is a distribution network design with risk pooling effect problem, along with a solution approach based on Lagrangian relaxation. The second one resembles a capacitated and degree constrained minimum spanning forest problem, which is tackled with an augmented lagrangian relation. We present computational results for several instances of the problem with sizes ranging from 50 to 150 stores. The results indicate that this method performs well in terms of the solution quality and run time consumed.
机译:我们考虑一个集成的位置-库存-路由问题,决策标记需要实现连锁企业拥有的物流配送系统的设施位置,库存控制和车辆路由的集成决策。该分销系统由一个中心仓库,多个潜在分销中心(DC)和多个零售商店组成。系统中的零售商商店面临随机需求,并在相同的分配期内从DC接受分配服务。目的是最大程度地减少系统总运行成本,其中包括设施位置成本,库存成本和运输成本。我们表明,该问题可以表述为非线性混合集成规划模型,为此我们提出了基于嵌套拉格朗日松弛的求解算法。嵌入到次梯度优化中的外部拉格朗日松弛将母体问题分解为两个子问题。第一个子问题是带有风险汇总效应问题的配电网络设计,以及基于拉格朗日松弛法的解决方案。第二个问题类似于容量受限且受程度限制的最小跨度森林问题,该问题通过增强的拉格朗日关系来解决。我们提供问题的几种情况的计算结果,大小从50到150家商店不等。结果表明,该方法在解决方案质量和消耗的运行时间方面表现良好。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号