CSP生产线轧制批量计划的优化

研究了某厂CSP生产线轧制计划编制的优化问题。分析了CSP生产线轧制计划编制的约束和目标。从全局最优观点采用并行处理策略,建立适合CSP生产线约束规程的生产作业计划模型,将生产批量计划归结为确定车辆数的车辆路径问题,建立了CSP轧制批量计划的数学模型。提出了宽度、厚度和时间三个惩罚因子,采用并行策略,应用最近插入法和禁忌搜索法求解。计算结果数据表明算法是有效的。

Study on the Problem of CSP Line Rolling Batch Planning

The main content of this paper is studying a question about how to optimize the CSP line' s hot rolling planning. To analyse the production objectives and technology constraints of the CSP line. According to the technical characteristics of the CSP line and the parallel method, this paper established the mathematical model based onVRP( Vehicle routing problem)model for the CSP line. To refer three factors such as width, thickness and time factor. An approach based on human - computer interaction technology and the nearest insertion algorithm and taboo search algorithm is presented for solving the practical problems. Demonstrated by using the historical data, this model and algorithm are effective and feasible.