| Multi-objective optimization for draft scheduling of hot strip mill | |
| Alternative Title | Multi-objective optimization for draft scheduling of hot strip mill |
| Li Weigang1; Liu Xianghua3; Guo Zhaohui1 | |
| 2012 | |
| Source Publication | JOURNAL OF CENTRAL SOUTH UNIVERSITY
 |
| ISSN | 2095-2899 |
| Volume | 19Issue:11Pages:3069-3078 |
| Abstract | A multi-objective optimization model for draft scheduling of hot strip mill was presented, rolling power minimizing, rolling force ratio distribution and good strip shape as the objective functions. A multi-objective differential evolution algorithm based on decomposition (MODE/D). The two-objective and three-objective optimization experiments were performed respectively to demonstrate the optimal solutions of trade-off. The simulation results show that MODE/D can obtain a good Pareto-optimal front, which suggests a series of alternative solutions to draft scheduling. The extreme Pareto solutions are found feasible and the centres of the Pareto fronts give a good compromise. The conflict exists between each two ones of three objectives. The final optimal solution is selected from the Pareto-optimal front by the importance of objectives, and it can achieve a better performance in all objective dimensions than the empirical solutions. Finally, the practical application cases confirm the feasibility of the multi-objective approach, and the optimal solutions can gain a better rolling stability than the empirical solutions, and strip flatness decreases from (0 +/- 163) IU to (0 +/- 45) IU in industrial production. |
| Other Abstract | A multi-objective optimization model for draft scheduling of hot strip mill was presented, which considers rolling power minimizing, rolling force ratio distribution and good strip shape as the objective functions. A multi-objective differential evolution algorithm based on decomposition (MODE/D) was used to solve this model. The two-objective and three-objective optimization experiments were performed respectively to demonstrate the optimal solutions of trade-off. The simulation results show that MODE/D can obtain a good Pareto-optimal front, which suggests a series of alternative solutions to draft scheduling. The extreme Pareto solutions are found feasible and the centres of the Pareto fronts give a good compromise. The conflict exists between each two ones of three objectives. The final optimal solution is selected from the Pareto-optimal front by the importance of objectives, and it can achieve a better performance in all objective dimensions than the empirical solutions. Finally, the practical application cases confirm the feasibility of the multi-objective approach, and the optimal solutions can gain a better rolling stability than the empirical solutions, and strip flatness decreases from (0±163) IU to (0±45) IU in industrial production. |
| Keyword | ALGORITHM hot strip mill draft scheduling multi-objective optimization multi-objective differential evolution algorithm based on decomposition (MODE/D) Pareto-optimal front |
| Indexed By | CSCD |
| Language | 英语 |
| Funding Project | [National Natural Science Foundation of China] |
| CSCD ID | CSCD:4668485 |
| Citation statistics | |
| Document Type | 期刊论文 |
| Identifier | http://ir.imr.ac.cn/handle/321006/143947 |
| Collection | 中国科学院金属研究所 |
| Affiliation | 1.东北大学 2.Baosteel Grp Corp, Res Institute, Automat Div, Shanghai 201900, Peoples R China 3.中国科学院金属研究所 |
| Recommended Citation GB/T 7714 | Li Weigang,Liu Xianghua,Guo Zhaohui. Multi-objective optimization for draft scheduling of hot strip mill[J]. JOURNAL OF CENTRAL SOUTH UNIVERSITY,2012,19(11):3069-3078. |
| APA | Li Weigang,Liu Xianghua,&Guo Zhaohui.(2012).Multi-objective optimization for draft scheduling of hot strip mill.JOURNAL OF CENTRAL SOUTH UNIVERSITY,19(11),3069-3078. |
| MLA | Li Weigang,et al."Multi-objective optimization for draft scheduling of hot strip mill".JOURNAL OF CENTRAL SOUTH UNIVERSITY 19.11(2012):3069-3078. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment