【摘要】 针对钢铁工业中的实际合同计划问题建立了数学规划模型.模型在考虑了机组产能、工序优先级和库存等实际约束下,最小化合同的提前拖期惩罚费用、机组的产能放空费用、机组的库存费用和合同的产线选择费用.针对合同计划的复杂约束、大规模和多目标等特征,提出了新的禁忌搜索算法以求得问题的近优解.为了提高搜索效率,在禁忌搜索算法中引入希望邻域和每代多次移动的策略.通过中小规模随机产生的数据进行实验,结果表明,提出的算法获得的结果优于标准优化软件ILOG-CP得到的结果.通过大规模实际数据的实验,验证了算法的有效性.更多还原

【Abstract】 A mathematical programming model is formulated for the real order planning problem in steel industry,where the constraints on the capacity of all equipment units,precedence and inventory were taken into account.The objective of the model is to minimize the costs for unused capacity,early delivery,delayed delivery penalty,run idle,inventory and choice of production lines.For the complicated constraints on the order planning prolem for large-scale and multi-objective orders,a new heuristic based on tabu search(TS) is proposed to solve the problem as optimal as possible.To improve the searching efficiency,two strategies of promising region and multiple moving in each step of iteration are introduced in the heuristic.The experimental results with the small-scaled data randomly generated showed that the heuristic proposed always get better solutions than the standard optimization software ILOG-CP,what’s more,its validity is verified via the experiments with real large-scale production data.更多还原