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.展开更多
Refinery scheduling attracts increasing concerns in both academic and industrial communities in recent years.However, due to the complexity of refinery processes, little has been reported for success use in real world...Refinery scheduling attracts increasing concerns in both academic and industrial communities in recent years.However, due to the complexity of refinery processes, little has been reported for success use in real world refineries. In academic studies, refinery scheduling is usually treated as an integrated, large-scale optimization problem,though such complex optimization problems are extremely difficult to solve. In this paper, we proposed a way to exploit the prior knowledge existing in refineries, and developed a decision making system to guide the scheduling process. For a real world fuel oil oriented refinery, ten adjusting process scales are predetermined. A C4.5 decision tree works based on the finished oil demand plan to classify the corresponding category(i.e. adjusting scale). Then,a specific sub-scheduling problem with respect to the determined adjusting scale is solved. The proposed strategy is demonstrated with a scheduling case originated from a real world refinery.展开更多
In order to facilitate solution, a complex problem is normally decomposed into many small sub-problems during product development process. Teams are formed to resolve each sub-problem. The original problem is resolved...In order to facilitate solution, a complex problem is normally decomposed into many small sub-problems during product development process. Teams are formed to resolve each sub-problem. The original problem is resolved from solutions of sub-problems. Ideally, sub-problems are not only mutually independent but also inherent parameters of original problem. Solution of original problem can be directly derived from the collection of solutions from simplified sub-problems. In practice, the degree of interdependency is indeed reduced, sub-problems are neither totally independent nor all inherent parameters of original problem. This paper discusses team coordination under this condition and design solution from each team, which not only satisfies total requirements but also is an optimal one. The suggested optimized constraint decomposition method will insure workable Pareto solution.展开更多
In this paper, the symmetry method has been carried over to the generalized variable coefficients Zakharov- Kuznetsov equation. The infinitesimal symmetries and the optimal system are deduced and from this optimal sys...In this paper, the symmetry method has been carried over to the generalized variable coefficients Zakharov- Kuznetsov equation. The infinitesimal symmetries and the optimal system are deduced and from this optimal system seven basic fields are determined, and for every vector field in the optimal system the admissible forms of the coefficients are found and this also leads us to transform the given equation into partial differential equations in two variables. After using some referenced transformations the mentioned partial differential equations eventually reduce to ordinary differential equations. The search for solutions to those equations has yielded many exact solutions in most cases.展开更多
基金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(21706282,21276137,61273039,61673236)Science Foundation of China University of Petroleum,Beijing(No.2462017YJRC028)the National High-tech 863 Program of China(2013AA 040702)
文摘Refinery scheduling attracts increasing concerns in both academic and industrial communities in recent years.However, due to the complexity of refinery processes, little has been reported for success use in real world refineries. In academic studies, refinery scheduling is usually treated as an integrated, large-scale optimization problem,though such complex optimization problems are extremely difficult to solve. In this paper, we proposed a way to exploit the prior knowledge existing in refineries, and developed a decision making system to guide the scheduling process. For a real world fuel oil oriented refinery, ten adjusting process scales are predetermined. A C4.5 decision tree works based on the finished oil demand plan to classify the corresponding category(i.e. adjusting scale). Then,a specific sub-scheduling problem with respect to the determined adjusting scale is solved. The proposed strategy is demonstrated with a scheduling case originated from a real world refinery.
基金Supportedby 86 3/CIMS (No .2 0 0 1AA4 1114 0 )andtheNationalNaturalScienceFoundationofChina (No .6 0 10 4 0 0 8)
文摘In order to facilitate solution, a complex problem is normally decomposed into many small sub-problems during product development process. Teams are formed to resolve each sub-problem. The original problem is resolved from solutions of sub-problems. Ideally, sub-problems are not only mutually independent but also inherent parameters of original problem. Solution of original problem can be directly derived from the collection of solutions from simplified sub-problems. In practice, the degree of interdependency is indeed reduced, sub-problems are neither totally independent nor all inherent parameters of original problem. This paper discusses team coordination under this condition and design solution from each team, which not only satisfies total requirements but also is an optimal one. The suggested optimized constraint decomposition method will insure workable Pareto solution.
文摘In this paper, the symmetry method has been carried over to the generalized variable coefficients Zakharov- Kuznetsov equation. The infinitesimal symmetries and the optimal system are deduced and from this optimal system seven basic fields are determined, and for every vector field in the optimal system the admissible forms of the coefficients are found and this also leads us to transform the given equation into partial differential equations in two variables. After using some referenced transformations the mentioned partial differential equations eventually reduce to ordinary differential equations. The search for solutions to those equations has yielded many exact solutions in most cases.
