...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>International Journal of Production Research >Multi-item distribution network design problems under volume discount on transportation cost
【24h】

Multi-item distribution network design problems under volume discount on transportation cost

机译：运输成本批量折扣下的多项目分销网络设计问题

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

This study considers the distribution network design problems of multi-echelon, multi-item supply chains under volume (weight) discounts on transportation costs. Minimising the total network cost requires determining the following: (1) the service area of distribution centres (DCs); (2) the assignment of retail stores to DCs; and (3) the inventory volume at DCs. This study compares various replenishment policies and discusses the effects of such policies on distribution network design. In general, the results show that single-cluster replenishment is superior to joint cluster replenishment. However, joint cluster replenishment may be superior to single-cluster replenishment under volume (weight) discounts on transportation costs. The results additionally show that single-item replenishment is inferior to multi-item replenishment under volume (weight) discounts on transportation costs. All the problems are formulated as piecewise non-linear programming models with multiple variables. Algorithms are proposed for solving these piecewise non-linear programming problems. Several numerical studies demonstrate the solution procedures and the effects of changing parameters on decision-making.
机译：这项研究考虑了运输成本的数量（重量）折扣下的多级，多项目供应链的分销网络设计问题。为了使总网络成本最小化，需要确定以下内容：（1）配送中心（DC）的服务区域； （2）将零售商店分配给区议会； （3）配送中心的库存量。本研究比较了各种补货政策，并讨论了此类政策对配电网络设计的影响。通常，结果表明，单集群补给优于联合集群补给。但是，在运输成本的数量（权重）折扣下，联合集群补给可能会优于单一集群补给。结果还表明，在运输成本的数量（重量）折扣下，单项补货不如多项补货。所有问题都被表述为具有多个变量的分段非线性规划模型。提出了用于解决这些分段非线性规划问题的算法。多项数值研究证明了求解程序以及参数更改对决策的影响。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号