An approach of simultaneous strategies with two novel techniques is proposed to improve the solution accuracy of chemical dynamic optimization problems. The first technique is to handle constraints on control vari- ab...An approach of simultaneous strategies with two novel techniques is proposed to improve the solution accuracy of chemical dynamic optimization problems. The first technique is to handle constraints on control vari- ables based on the finite-element collocation so as to control the approximation error for discrete optimal problems, where a set of control constraints at dement knots are integrated with the procedure for optimization leading to a significant gain in the accuracy of the simultaneous strategies. The second technique is to make the mesh refine- ment more feasible and reliable by introducing length constraints and guideline in designing appropriate element length boundaries, so that the proposed approach becomes more efficient in adjusting dements to track optimal control profile breakpoints and ensure accurate state and centrol profiles. Four classic benchmarks of dynamic op- timization problems are used as illustrations, and the proposed approach is compared with literature reports. The research results reveal that the proposed approach is preferz,ble in improving the solution accuracy of chemical dy- namic optimization problem.展开更多
This paper considers dealing with path constraints in the framework of the improved control vector iteration （CVI） approach. Two available ways for enforcing equality path constraints are presented, which can be dir...This paper considers dealing with path constraints in the framework of the improved control vector iteration （CVI） approach. Two available ways for enforcing equality path constraints are presented, which can be directly incorporated into the improved CVI approach. Inequality path constraints are much more difficult to deal with, even for small scale problems, because the time intervals where the inequality path constraints are active are unknown in advance. To overcome the challenge, the ll penalty function and a novel smoothing technique are in-troduced, leading to a new effective approach. Moreover, on the basis of the relevant theorems, a numerical algo-rithm is proposed for nonlinear dynamic optimization problems with inequality path constraints. Results obtained from the classic batch reaCtor operation problem are in agreement with the literature reoorts, and the comoutational efficiency is also high.展开更多
This study proposes an efficient indirect approach for general nonlinear dynamic optimization problems without path constraints. The approach incorporates the virtues both from indirect and direct methods: it solves t...This study proposes an efficient indirect approach for general nonlinear dynamic optimization problems without path constraints. The approach incorporates the virtues both from indirect and direct methods: it solves the optimality conditions like the traditional indirect methods do, but uses a discretization technique inspired from direct methods. Compared with other indirect approaches, the proposed approach has two main advantages: (1) the discretized optimization problem only employs unconstrained nonlinear programming (NLP) algorithms such as BFGS (Broyden-Fletcher-Goldfarb-Shanno), rather than constrained NLP algorithms, therefore the computational efficiency is increased; (2) the relationship between the number of the discretized time intervals and the integration error of the four-step Adams predictor-corrector algorithm is established, thus the minimal number of time intervals that under desired integration tolerance can be estimated. The classic batch reactor problem is tested and compared in detail with literature reports, and the results reveal the effectiveness of the proposed approach. Dealing with path constraints requires extra techniques, and will be studied in the second paper.展开更多
基金Supported by the Joint Funds of NSFC-CNPC of China(U1162130)the International Cooperation and Exchange Project of Science and Technology Department of Zhejiang Province(2009C34008)+1 种基金the National High Technology Research and Development Program of China(2006AA05Z226)the Zhejiang Provincial Natural Science Foundation for Distinguished Young Scientists(R4100133)
文摘An approach of simultaneous strategies with two novel techniques is proposed to improve the solution accuracy of chemical dynamic optimization problems. The first technique is to handle constraints on control vari- ables based on the finite-element collocation so as to control the approximation error for discrete optimal problems, where a set of control constraints at dement knots are integrated with the procedure for optimization leading to a significant gain in the accuracy of the simultaneous strategies. The second technique is to make the mesh refine- ment more feasible and reliable by introducing length constraints and guideline in designing appropriate element length boundaries, so that the proposed approach becomes more efficient in adjusting dements to track optimal control profile breakpoints and ensure accurate state and centrol profiles. Four classic benchmarks of dynamic op- timization problems are used as illustrations, and the proposed approach is compared with literature reports. The research results reveal that the proposed approach is preferz,ble in improving the solution accuracy of chemical dy- namic optimization problem.
基金Supported by the National Natural Science Foundation of China(U1162130)the National High Technology Research and Development Program of China(2006AA05Z226)Outstanding Youth Science Foundation of Zhejiang Province(R4100133)
文摘This paper considers dealing with path constraints in the framework of the improved control vector iteration （CVI） approach. Two available ways for enforcing equality path constraints are presented, which can be directly incorporated into the improved CVI approach. Inequality path constraints are much more difficult to deal with, even for small scale problems, because the time intervals where the inequality path constraints are active are unknown in advance. To overcome the challenge, the ll penalty function and a novel smoothing technique are in-troduced, leading to a new effective approach. Moreover, on the basis of the relevant theorems, a numerical algo-rithm is proposed for nonlinear dynamic optimization problems with inequality path constraints. Results obtained from the classic batch reaCtor operation problem are in agreement with the literature reoorts, and the comoutational efficiency is also high.
基金Supported by the National Natural Science Foundation of China (U1162130)the National High Technology Research and Development Program of China (2006AA05Z226)the Outstanding Youth Science Foundation,Zhejiang Province (R4100133)
文摘This study proposes an efficient indirect approach for general nonlinear dynamic optimization problems without path constraints. The approach incorporates the virtues both from indirect and direct methods: it solves the optimality conditions like the traditional indirect methods do, but uses a discretization technique inspired from direct methods. Compared with other indirect approaches, the proposed approach has two main advantages: (1) the discretized optimization problem only employs unconstrained nonlinear programming (NLP) algorithms such as BFGS (Broyden-Fletcher-Goldfarb-Shanno), rather than constrained NLP algorithms, therefore the computational efficiency is increased; (2) the relationship between the number of the discretized time intervals and the integration error of the four-step Adams predictor-corrector algorithm is established, thus the minimal number of time intervals that under desired integration tolerance can be estimated. The classic batch reactor problem is tested and compared in detail with literature reports, and the results reveal the effectiveness of the proposed approach. Dealing with path constraints requires extra techniques, and will be studied in the second paper.
