改进遗传算法在磁性材料组炉优化问题中地应用.PDFVIP

31 9 Vol. 31 No. 9 2014 9 Control Theory Applications Sep. 2014 DOI: 10.7641/CTA.2014.31316 , , (, 110004) : , . , . . , . 1 , . , ; , . , , . : ; ; ; ; : TP18 : A Application of improved genetic algorithm to magnetic materials group furnace optimization problem LIU Ye-feng , PAN Quan-ke, CHAI Tian-you (State Key Laboratory of Integrated Automation for Process Industries, Northeastern University, Shenyang Liaoning 110004, China) Abstract: Grade, due date, priority, and demand are attributes of magnetic material production work orders. Planners are required to seek the optimal combination of production work orders to minimize the cost and improve the efficiency based on these attributes. To deal with the lengthy furnace-grouping time and the non-optimal furnace-grouping result in magnetic materials enterprises, we build a mathematical model for solving the furnace-grouping optimization problem with unknown charge number. This problem is first transformed into a pseudo traveling salesman problem and then is solved by using an improved genetic algorithm. Natural number coding from 1 to N is the coding scheme that this paper adopted. An initial population generation method is designed following the sort criteria of Earliest Completion Date (ECD). An elite strategy and an improved greedy three-crossover operator (3PM) are introduced to enhance the convergence speed and precision, whereas a reverse operator is applied to improve the exploitation for the presented algorithm. Simulation results based on practical production data show that the built model is appropriate a