管坯入库堆垛问题的模型及算法研究  

Model and Algorithm of Tube Billet Storage Stacking Problem

作　　者：董广静 李铁克[1,2] 王柏琳[1,2] 柏亮[1,2] 

机构地区：[1]北京科技大学东凌经济管理学院,北京100083 [2]钢铁生产制造执行系统技术教育部工程研究中心,北京100083

出　　处：《工业工程与管理》2013年第6期32-39,共8页Industrial Engineering and Management

基　　金：教育部博士学科点专项科研基金(20100006110006);中央高校基本科研业务费专项资金(FRF-SD-12-011B;FRF-SD-12-012B);国家自然科学基金资助项目(70771008)

摘　　要：针对管坯入库堆垛问题,建立了以最小化垛位倒垛次数为目标的约束满足模型,并提出一种基于邻域选择的约束满足算法(CMSNS)。算法主要分为两个部分:第一部分是将入库管坯进行归类并构造选中管坯邻域;第二部分是调用约束满足算法为管坯指派垛位。试验结果表明,算法能有效降低垛位倒垛数,既实现了垛位的有效利用,又提高了轧制作业的效率,这在实际生产中有很好的参考价值。Concerning on billet stacking problem, a model of optimizing stacking location shuffles is established, and then a heuristic algorithm based on neighborhood search and constraint satisfaction is built up. The algorithm is divided into two main parts, in the first part, the billets are classified and constructed billet neighborhood, and in the second part the billets are assigned positions by constraint satisfaction algorithm. The experimental results show that the algorithm can not only effectively reduce stack shuffles but also improve the work efficiency of roiling plan, which in the actual production has a good reference value.

关 键 词：库存计划 入库管理 约束满足 管坯堆垛 

分 类 号：TP29[自动化与计算机技术—检测技术与自动化装置]