首页> 外文期刊>International journal of management science and engineering management >Designing a flexible multi-commodity distribution network in a multi-level supply chain
【24h】

Designing a flexible multi-commodity distribution network in a multi-level supply chain

机译:在多级供应链中设计灵活的多商品分销网络

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

摘要

In response to the market competitive conditions today, organizations are increasingly striving to deliver products to customers in the correct volumes, at the right time, and in the right place. An important success factor in this competitive environment is employing an appropriate and efficient distribution network that is designed around the objectives of optimum numbers, locations, and capacities of production and distribution centers and an optimum strategy for the timely transfer of products from the plant or the warehouse to the customer.The present study aims to investigate the problem of designing a flexible distribution network in a multi-level supply chain by assuming direct shipment from the manufacturer to the customer.The problem is considered as a multi-commodity, static, and certain model in the form of mixed integer programming, with each of the production and distribution facilities having multi-capacity levels and their numbers considered as variables in the model. The restriction of distribution radius for production plant and distribution centers (warehouses) has been considered. Since the distribution network design problem is an NP-hard problem, a meta-heuristic approach based on the particle swarm optimization method was adopted to solve the problem. To evaluate the performance of the proposed approach, 32 test problems were solved. Comparison of the results indicates the efficiency of the proposed method.
机译:为了应对当今的市场竞争条件,组织越来越努力地在正确的时间和正确的位置以正确的数量向客户交付产品。在这种竞争环境中,成功的重要因素是采用合适的高效分销网络,该网络围绕最佳数量,位置和生产与分销中心的能力目标而设计,以及用于及时从工厂或工厂转移产品的最佳策略。本研究旨在通过假设从制造商直接向客户发货来调查在多级供应链中设计灵活分销网络的问题,该问题被视为多商品,静态和混合整数规划形式的某些模型,每个生产和分销设施都具有多生产能力水平,并且其数量被视为模型中的变量。已经考虑了对生产工厂和分配中心(仓库)的分配半径的限制。由于配电网设计问题是NP难问题,因此采用基于粒子群优化方法的元启发式方法来解决该问题。为了评估该方法的性能,解决了32个测试问题。结果的比较表明了该方法的有效性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号