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 ...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± 63） IU to （0±45） IU in industrial production.展开更多
An optimization model is constructed to formulate the maximization problem on the capacity of V-belt drive. The concavity,the monotonicity and the global optimality condition are studied for the objective function,and...An optimization model is constructed to formulate the maximization problem on the capacity of V-belt drive. The concavity,the monotonicity and the global optimality condition are studied for the objective function,and it is proved that the feasible region of the model is bounded,closed and convex under some design conditions. Then,a solution method,called an optimal segment algorithm,is developed to find the global maximizer of the model. Under four different design conditions,solution methods are presented respectively. Some real case studies are employed to demonstrate that the model and the algorithm in this paper are promising.展开更多
基金Projects(50974039,50634030)supported by the National Natural Science Foundation of China
文摘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± 63） IU to （0±45） IU in industrial production.
基金supported by the National Natural Science Foundation of China (Grant Nos.71071162,70921001)the project for Excellent Talent of New Century,Ministry of Education of China (Grant No.NCET-07-0864)
文摘An optimization model is constructed to formulate the maximization problem on the capacity of V-belt drive. The concavity,the monotonicity and the global optimality condition are studied for the objective function,and it is proved that the feasible region of the model is bounded,closed and convex under some design conditions. Then,a solution method,called an optimal segment algorithm,is developed to find the global maximizer of the model. Under four different design conditions,solution methods are presented respectively. Some real case studies are employed to demonstrate that the model and the algorithm in this paper are promising.
