首页> 外文期刊>Computers & operations research >Modelling and a segmented dynamic programming-based heuristic approach for the slab stack shuffling problem
【24h】

Modelling and a segmented dynamic programming-based heuristic approach for the slab stack shuffling problem

机译:板栈改组问题的建模和基于分段动态规划的启发式方法

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

摘要

This paper studies the slab stack shuffling (SSS) problem in the slab yard, which is a key logistics problem between the continuous casting stage and the hot rolling mill in the steel industry. The problem is to choose appropriate slabs for a sequence of rolling items, from their respective candidate slab sets (families) with a view to reducing the resulting shuffling workload. Although the SSS problem has been investigated by a few researchers, the problem under consideration has several new features. One of them is that the shuffled slab will not return the original stack but remain at the new position. Another requires that every selected slab be taken out in time, which will result in balancing the crane workloads among the storage areas of the slab yard to a degree. In addition, the local similarity of slab families is also considered, the closer the items in the rolling sequence, the more the common slabs between the corresponding families. For the problem, an integer programming model is proposed by considering the above features and requirements. For small-scaled problem, a dynamic programming approach is first constructed to obtain its optimal solution. For the practical scale, due to its intractability, we propose a segmented dynamic programming (SDP)-based heuristic, which partitions the sequence of items into a series of segments, each of which corresponds to a subproblem. The subproblems are solved sequentially using the dynamic programming. And the reassignment strategy of common slabs and the exchange strategy of candidate slabs are designed to improve the heuristic. Two interesting properties of the problem are also derived to speed up the SDP-based heuristic approach. The experiment results show that the heuristic is very close to the optimum in average solution quality for the small-scaled problem, obviously better than the CP Optimizer for the medium scale, and can reduce the crane workload by 10.76% on average for the practical scale.
机译:本文研究了板坯场中的板坯堆垛改组(SSS)问题,这是钢铁行业热连轧阶段与连铸阶段之间的关键物流问题。问题是从其各自的候选板坯集合(系列)中为一系列轧制项目选择合适的板坯,以减少由此产生的改组工作量。尽管一些研究人员已经研究了SSS问题,但是所考虑的问题具有几个新功能。其中之一是,经过改组的平板将不会返回原始堆栈,而是保留在新位置。另一个要求及时取出每个选定的板坯,这将在一定程度上平衡板坯堆场存储区域之间的起重机工作量。另外,还考虑了板坯族的局部相似性,滚动顺序中的项越接近,对应族之间的共同板坯越多。针对该问题,考虑到上述特征和要求,提出了整数规划模型。对于小规模问题,首先构建动态规划方法以获得其最优解。对于实际规模,由于其难处理性,我们提出了一种基于分段动态规划(SDP)的启发式方法,该方法将项目序列划分为一系列段,每个段对应一个子问题。子问题使用动态编程顺序解决。为了提高启发式算法,设计了普通板的重新分配策略和候选板的交换策略。问题的两个有趣的属性也被推导来加快基于SDP的启发式方法。实验结果表明,启发式算法对于小规模问题的平均解质量非常接近最优,明显优于中规模的CP Optimizer,在实际规模下平均可减少起重机工作量10.76% 。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号