中文摘要：

板坯动态分配问题是在一定周期内,将炼钢-连铸工序动态产出的余材板坯合理分配给期货合同、潜在合同或自拟合同,使加权费用和最小.对该问题建立0-1整数规划模型,针对问题的NP-难求解性,设计基于多邻域的分散搜索算法对问题近似求解,并加入随机策略防止算法陷入局部最优.分别采用模拟数据和实际数据进行测试,所提出的算法与商业软件CPLEX相比,可在较短时间内获得近优解,在解的质量和计算时间方面均优于人工方法.

英文摘要：

The dynamic slab allocation problem is to assign the surplus slabs, which are dynamically obtained from steel-making and casting process, to the customer-orders, potential-orders and self-designed-orders in a given period. Therefore, a 0-1 integer programming model is formulated. Due to its NP-hardness, a multiple neighborhoods based scatter search algorithm is proposed to solve the problem approximately. Furthermore, to avoid search process being tapped in local optima, a random perturbation strategy is introduced. Both randomly generated instances and practical instances obtained from a large iron-and-steel enterprise are used to test the performance of the proposed algorithm. Compared with commercial soft named CPLEX, the proposed algorithm can get near-optimal solution in a reasonable CPU time. The experiments on the practical data show that the proposed algorithm outperforms the manual methods on solution quality and computation time.