• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Arabian Journal for Science and Engineering. Section A, Sciences >A Maximal Covering Problem in Supply Chain Considering Variable Radius and Gradual Coverage with the Choice of Transportation Mode
【24h】

A Maximal Covering Problem in Supply Chain Considering Variable Radius and Gradual Coverage with the Choice of Transportation Mode

机译：供应链中的最大覆盖问题考虑到可变半径和逐渐覆盖以及运输模式的选择

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

摘要

Today, supply chain management is a fundamental principle of business infrastructure implementation in the world. One of the most important pillars of the supply chain management is distribution network design. A distribution network with appropriate structure reduces costs and enhances customer-perceived service level, thereby improving competitive advantages of the company. In supply chain analysis, it is essential to focus on customers, as they greatly affect the formation of chain. This requires a balance between associated costs and the level of service provided. Variable radius and gradual radius maximal covering problem focus on the service levels in relation to the costs incurred to the system. In this study, a bi-objective mixed-integer nonlinear programming model was presented to determine optimal number, location and capacity of factories, distribution centers, and retailers, select transportation modes between the chain elements, and evaluate coverage radius of retailers, in such a way to minimize total transportation costs, maximize the covered demand, and achieve gradual coverage of facilities in a variable radius scheme. The proposed model was validated on a number of sample problems produced and solved by GAMS optimization software. Being NP-Hard, the problem was proposed to be solved via NSGA-II algorithm when its dimensions go large. Analysis of the computational results and respective comparisons indicated good performance of the presented algorithm.
机译：今天，供应链管理是世界业务基础设施实施的基本原则。供应链管理最重要的支柱之一是分销网络设计。具有适当结构的分销网络降低了成本并提高了客户感知的服务水平，从而提高了公司的竞争优势。在供应链分析中，关注客户至关重要，因为它们极大地影响了链的形成。这需要在相关成本和提供的服务水平之间进行平衡。可变半径和逐渐半径最大覆盖问题侧重于与系统产生的成本相关的服务水平。在本研究中，提出了一种双目标混合整数非线性编程模型，以确定工厂，分销中心和零售商的最佳数量，位置和能力，选择链元素之间的运输模式，并评估零售商的覆盖范围，在此方面一种最大限度地减少总运输成本的方法，最大限度地提高涵盖的需求，并实现了可变半径方案中设施的逐步覆盖范围。在GAMS优化软件生产和解决的许多样本问题上验证了所提出的模型。当其尺寸变大时，提出了通过NSGA-II算法解决的问题。分析计算结果及各自的比较表明呈现算法的良好性能。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号