分析了热轧批量计划编制问题,建立了基于奖金收集车辆路径问题的计划数不确定的热轧批量计划模型.模型中考虑了热轧生产的多种工艺约束和生产目标.针对该模型提出了一种基于模拟退火算法和蚁群算法的混合算法,混合算法中利用模拟退火算法得到热轧批量计划的一个初始解来生成蚁群算法中的初始信息素分布,利用蚁群算法寻找全局最优解.在蚁群算法中又嵌入了模拟退火算法进行局部搜索,避免蚁群算法陷入局部最优.实验结果表明所提出的模型和算法是有效的.
Hot rolling lot planning is analyzed and a prize collecting vehicle routing problem(PCVRP) model with uncertain rolling planning numbers for hot rolling lot planning is proposed.The model considers a lot of production process constraints and production targets.A hybrid algorithm based on simulated annealing(SA) and ant colony optimization(ACO) is proposed for solving the model.In the hybrid algorithm,simulated annealing is used to search the initial solution of hot rolling lot planning to form the initial information pheromone,ant colony optimization is used to search the global optimal solution.Simulated annealing employs certain probability to avoid becoming trapped in a local optimum in ant colony optimization.The experimental results show that the model and the hybrid algorithm are effective for hot rolling lot planning.