• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Engineering journal >Redesign of Three-Echelon Multi-Commodity Distribution Network
【24h】

Redesign of Three-Echelon Multi-Commodity Distribution Network

机译：三级多商品配送网络的重新设计

获取原文
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

This research studies the distribution network redesign of an actual electronics company. The problems are formulated based on multi-echelon capacitated Location Routing Problem (LRP) with two commodities: home products and service items. The objective function consists of three components: facility cost, closing cost of facility and transportation cost. We propose solution method based on clustering technique. The problem is decomposed into the Facility Location Allocation Problem (FLAP) and the Multi-Depot Vehicle Routing Problem (MDVRP). MDVRP is solved by clustering method and feed the results to the modified FLAP to allocate the demand nodes to facilities and configure all distribution networks, for the 2~(nd) and 3~(rd) echelon. The distribution is divided into five region zones. Previously, each region was operated independently but this research compares the solutions from solving each region independently and solving all five zones simultaneously. The results indicate that the proposed solution method can achieve computation time and total cost that are comparable to ones obtained from solving the problem to optimality. Exact approach can only solve small and medium problems, whereas the proposed solution method provides the acceptable solution of real-life largest problem in limit of computation time. Finally, we perform sensitivity analysis on the results.
机译：这项研究研究了一家实际电子公司的配电网络的重新设计。这些问题是基于具有两个商品的多级能力限制的位置路由问题（LRP）制定的：家庭产品和服务项目。目标功能由三部分组成：设施成本，设施关闭成本和运输成本。我们提出了一种基于聚类技术的解决方法。该问题被分解为设施位置分配问题（FLAP）和多仓库车辆路径问题（MDVRP）。 MDVRP通过聚类方法求解，并将结果馈送到经过修改的FLAP中，以将需求节点分配给设施并配置所有分配网络（针对第2级和第3级）。分布分为五个区域区域。以前，每个区域都是独立运行的，但是本研究比较了分别解决每个区域和同时解决所有五个区域的解决方案。结果表明，所提出的求解方法可以实现与从解决问题到最佳状态所获得的计算时间和总成本相当的计算方法。精确的方法只能解决中小型问题，而所提出的解决方案在计算时间的限制内提供了现实生活中最大问题的可接受解决方案。最后，我们对结果进行敏感性分析。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号