热轧批量计划模型及其混合求解算法-系统工程学报.PDF

26 1 Vol.26 No.1 2011 2 JOURNAL OF SYSTEMS ENGINEERING Feb. 2011 , , , (1. , 110819; 2. , 110819) : , . . , , . , . . : ; ; ; : TP278, TP29 : A :2011 Model and hybrid algorithm for hot rolling lot planning TU Nai-wei , HUANG Hui , LUO Xiao-chuan , CHAI Tian-you (1. Ministry of Education Key Lab of Process Industry Automation, Northeastern University, Shenyang 110819, China; 2. Research Center of Automation, Northeastern University, Shenyang 110819, China) Abstract: Hot rolling lot planning is analyzed and a prize collecting vehicle routing problem(PCVRP) model with uncertain rolling plan numbers for hot rolling lot planning is proposed. The model considers a lot of pro- duction 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 proba- bility 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. Key words: hot rolling lot planning; prize collecting vehicle routing problem; simulated annealing; ant colony optimization 1 , .