【摘要】 根据钢铁企业热轧产品生产工艺约束条件,将热轧生产轧制单元计划模型归结为奖金收集旅行商问题,设计了蚁群最优化算法对模型进行求解.引用某钢铁企业热轧生产轧制单元计划编制的实际问题对模型和算法进行了验证,并与遗传算法的求解结果进行了对比.实验结果表明模型和算法的优化效果和时间效率都是令人满意的.该模型和算法经过改进后可应用到包含多个轧制单元计划的轧制批量计划优化问题中.更多还原

【Abstract】 According to the process programs and constraints of hot rolling strip production in a steel plant,a prize collecting traveling salesman problem(PCTSP) based model for hot strip rolling unit planning is presented,an ant colony optimization(ACO) algorithm is designed to solve it.A practical instance in a steel plant is cited for testing the effectiveness of the model and algorithm.The plan obtained by the presented algorithm is compared with that obtained by a tested genetic algorithm.Experimental results show that the effectiveness and efficiency of the model and algorithm are satisfactory.With appropriate modifications,the model and algorithm can be applied to hot strip rolling lot planning problem which includes multiple rolling units inside.更多还原