不确定计划数的轧制批量计划的模型和算法

根据热轧生产工艺将热轧生产批量计划归结为不确定车辆数的车辆路径问题 (VRP) ,考虑了轧制计划中钢板宽度的反跳和相同宽度钢板的总长度约束 ,在轧制作业计划数不确定的情况下 ,把组批和排序有机地结合起来 ,并用遗传算法和禁忌搜索算法相结合的混合算法对问题进行求解 ,实验结果表明算法获得的最好解、平均负荷率和计算成本都比较令人满意 .

The model and algorithm for the hot-milling batch planning with uncertain number

According to the technical demand of hot milling production, this paper sums up the hot milling batch planning as a Vehicle Route Problem with uncertain vehicle number. In this paper, the inverse bounce of the width of the steel strips and the number constraint of the steel strips with same width are considered. Under the condition of uncertain hot milling plan number, batch and sort are combined organically. At the same time, the problem is solved by the hybrid algorithm that is composed of the genetic algorithm and tabu search algorithm. The numerical analysis has shown that the best solution, the probability of the average load and the effort of time are all more satisfying.