...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>International Journal of Production Research >Linear programming and Lagrangian relaxation heuristics for designing a material flow network on a block layout
【24h】

Linear programming and Lagrangian relaxation heuristics for designing a material flow network on a block layout

机译：用于在块布局上设计物料流网络的线性规划和拉格朗日松弛试探法

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

摘要

This paper focuses on the problem of designing a material flow network for a given block layout. For an efficient design of a network, we simultaneously consider locations of input and output points, flow paths, and the smoothness of material flow paths. A mixed integer programming formulation is given for the problem with the objective of minimising the sum of transportation cost, cost related to flow paths, and penalty cost for non-smooth flows, i.e., flows with many turns. We suggest two heuristic algorithms based on the linear programming relaxation and the Lagrangian relaxation techniques. To evaluate performance of the suggested algorithms, a series of computational experiments is performed on well-known problem instances as well as randomly generated test problems. Results show that the suggested algorithms give good solutions in a reasonable amount of computation time.
机译：本文着重于为给定的块布局设计物料流网络的问题。为了有效地设计网络，我们同时考虑输入和输出点的位置，流路以及物料流路的平滑度。针对该问题给出了混合整数规划公式，其目的是最小化运输成本，与流路相关的成本以及非平滑流（即，多匝流）的惩罚成本之和。我们建议两种基于线性规划松弛和拉格朗日松弛技术的启发式算法。为了评估建议算法的性能，对众所周知的问题实例以及随机生成的测试问题进行了一系列计算实验。结果表明，所提出的算法在合理的计算时间内给出了良好的解决方案。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号