• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>IFAC Symposium on Telematics Applications >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

机译：关于非等级备件供应链规划线性规划解决方法的研究

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

摘要

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 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号