首页> 外文期刊>IFAC PapersOnLine >On the research of linear programming solving methods for non-hierarchical spare parts supply chain planning
【24h】

On the research of linear programming solving methods for non-hierarchical spare parts supply chain planning

机译:非分级备件供应链计划的线性规划求解方法研究

获取原文
           

摘要

Abstract: The relevance of planning non-hierarchical supply chains has increased due to growing collaboration among industrial and logistic organizations once this planning approach aims to optimize the supply chain while preserving each actor's individuality. Linear programming is the predominant modelling approach to deal with non-hierarchical supply chains according to the state-of-the-art literature. Metaheuristics and exact methods are the classical solving methods for linear programming problems, with different characteristics in terms of solution quality and capability of handling complex problems in feasible computation time. In this context, this paper evaluates methods to solve linear programming problems considering their capability of dealing with most common decision model types associated with spare parts supply chains applying collaborative planning concepts. The gathered references substantiate the conclusion that, for normal sized problems, the simplex method continues to be the most attractive method. For bigger problems, interior point methods can be a better alternative. And for problems that surpass interior point method capacity, metaheuristics are recommended.
机译:摘要:一旦这种规划方法旨在优化供应链并同时保留每个参与者的个性,则由于工业组织和物流组织之间日益增强的协作,规划非分层供应链的相关性已经增加。根据最新文献,线性规划是处理非分层供应链的主要建模方法。元启发法和精确方法是线性规划问题的经典解决方法,在解决方案质量和在可行的计算时间内处理复杂问题的能力方面具有不同的特征。在这种情况下,本文评估了解决线性规划问题的方法,并考虑了它们使用协作计划概念来处理与备件供应链相关的最常见决策模型类型的能力。所收集的参考文献证实了以下结论:对于正常大小的问题,单纯形法仍然是最有吸引力的方法。对于更大的问题,内点法可能是更好的选择。对于超过内点方法能力的问题,建议使用元启发法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号