采用同步策略的化工动态优化求解(英文)

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 variables based on the finite-element collocation so as to control the approximation error for discrete optimal problems, where a set of control constraints at element 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 refinement 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 elements to track optimal control profile breakpoints and ensure accurate state and control profiles. Four classic benchmarks of dynamic optimization problems are used as illustrations, and the proposed approach is compared with literature reports. The research results reveal that the proposed approach is preferable in improving the solution accuracy of chemical dynamic optimization problem.     

Logarithm-transform piecewise linearization method for the optimization of fasoline blending processes

Gasoline blending is a key process in a petroleum refinery, as it can yield 60%–70% of a typical refinery's total revenue. This process not only exhibits non-convex nonlinear blending behavior due to the complicated blend mechanism of various component feedstocks with different quality properties, but also involves global optimum searching among numerous blending recipes. Since blend products are required to meet a series of quality requirements and highly-sensitive to the proportion changes of blending feedstocks, global optimization methods for NLP problems are often difficult to be applied because of heavy computational burdens. Thus, piecewise linearization methods are naturally proposed to provide an approximate global optimum solution by adding binary variables into the models and converting the original NLP problems into MILP ones. In this paper, Logarithmtransform piecewise linearization(LTPL) method, an improved piecewise linearization, is proposed. In this method a logarithm transform is applied to convert multi-variable multi-degree constraints into a series of single-variable constraints. As a result, the number of 0–1 variables is greatly reduced. In the final part of this paper, an industrial case study is conducted to demonstrate the effectiveness of LTPL method. In principle, this method would be useful for blending problems with complicated empirical or theoretical models.     

求解大规模优化问题的修改增广Lagrange乘子法

Chemical process optimization can be described as large-scale nonlinear constrained minimization. The modified augmented Lagrange multiplier methods (MALMM) for large-scale nonlinear constrained minimization are studied in this paper. The Lagrange function contains the penalty terms on equality and inequality constraints and the methods can he applied to solve a series of bound constrained sub-problems instead of a series of unconstrained sub-problems. The steps of the methods are examined in full detail. Numerical experiments are made for a variety of problems, from small to very large-scale, which show the stability and effectiveness of the methods in large-scale problems.     

非线性动态优化问题的改进控制矢量迭代法(Ⅰ)无路径约束问题(英文)

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.     

炼油厂氢气网络建模与多目标优化(英文)

The demand of hydrogen in oil refinery is increasing as market forces and environmental legislation, so hydrogen network management is becoming increasingly important in refineries. Most studies focused on single-objective optimization problem for the hydrogen network, but few account for the multi-objective optimization problem. This paper presents a novel approach for modeling and multi-objective optimization for hydrogen network in refineries. An improved multi-objective optimization model is proposed based on the concept of superstructure. The optimization includes minimization of operating cost and minimization of investment cost of equipment. The proposed methodology for the multi-objective optimization of hydrogen network takes into account flow rate constraints, pressure constraints, purity constraints, impurity constraints, payback period, etc. The method considers all the feasible connections and subjects this to mixed-integer nonlinear programming (MINLP). A deterministic optimization method is applied to solve this multi-objective optimization problem. Finally, a real case study is intro-duced to illustrate the applicability of the approach.     

An Improved Hybrid Genetic Algorithm for Chemical Plant Layout Optimization with Novel Non-overlapping and Toxic Gas Dispersion Constraints

New approaches for facility distribution in chemical plants are proposed including an improved non-overlapping constraint based on projection relationships of facilities and a novel toxic gas dispersion constraint. In consideration of the large number of variables in the plant layout model, our new method can significantly reduce the number of variables with their own projection relationships. Also, as toxic gas dispersion is a usual incident in a chemical plant, a simple approach to describe the gas leakage is proposed, which can clearly represent the constraints of potential emission source and sitting facilities. For solving the plant layout model, an improved genetic algorithm （GA） based on infeasible solution fix technique is proposed, which improves the globe search ability of GA. The case study and experiment show that a better layout plan can be obtained with our method, and the safety factors such as gas dispersion and minimum distances can be well handled in the solution.     

不确定条件下炼化企业计划与调度整合策略

A strategy for the integration of production planning and scheduling in refineries is proposed.This strategy relies on rolling horizon strategy and a two-level decomposition strategy.This strategy involves an upper level multiperiod mixed integer linear programming(MILP) model and a lower level simulation system,which is extended from our previous framework for short-term scheduling problems [Luo,C.P.,Rong,G.,"Hierarchical approach for short-term scheduling in refineries",Ind.Eng.Chem.Res.,46,3656-3668(2007)].The main purpose of this extended framework is to reduce the number of variables and the size of the optimization model and,to quickly find the optimal solution for the integrated planning/scheduling problem in refineries.Uncertainties are also considered in this article.An integrated robust optimization approach is introduced to cope with uncertain parameters with both continuous and discrete probability distribution.     

带显著误差集的改进MILP数据协调方法

Mixed integer linear programming (MILP) approach for simultaneous gross error detection and data reconciliation has been proved as an efficient way to adjust process data with material, energy, and other balance constrains. But the efficiency will decrease significantly when this method is applied in a large-scale problem because there are too many binary variables involved. In this article, an improved method is proposed in order to generate gross error candidates with reliability factors before data rectification. Candidates are used in the MILP objective function to improve the efficiency and accuracy by reducing the number of binary variables and giving accurate weights for suspected gross errors candidates. Performance of this improved method is compared and discussed by applying the algorithm in a widely used industrial example.     

用伪并行遗传/模拟退火算法进行多流股换热器网络综合的研究

The multi-stream heat exchanger network synthesis (HENS) problem can be formulated as a mixed integer nonlinear programming model according to Yee et al. Its nonconvexity nature leads to existence of more than one optimum and computational difficulty for traditional algorithms to find the global optimum. Compared with deterministic algorithms, evolutionary computation provides a promising approach to tackle this problem. In this paper, a mathematical model of multi-stream heat exchangers network synthesis problem is setup. Different from the assumption of isothermal mixing of stream splits and thus linearity constraints of Yee et al., non-isothermal mixing is supported. As a consequence, nonlinear constraints are resulted and nonconvexity of the objective function is added. To solve the mathematical model, an algorithm named GA/SA (parallel genetic/simulated annealing algorithm) is detailed for application to the multi-stream heat exchanger network synthesis problem. The performance of the proposed approach is demonstrated with three examples and the obtained solutions indicate the presented approach is effective for multi-stream HENS.     

Development of a bifurcation analysis approach based on gPROMS platform☆

A bifurcation analysis approach is developed based on the process simulator gPROMS platform, which can automatically trace a solution path, detect and pass the bifurcation points and check the stability of solutions. The arclength continuation algorithm is incorporated as a process entity in gPROMS to overcome the limit of turning points and get multiple solutions with respect to a user-defined parameter. The bifurcation points are detected through a bifurcation test function τ which is written in C ++ routine as a foreign object connected with gPROMS through Foreign Process Interface. The stability analysis is realized by evaluating eigenvalues of the Jacobian matrix of each steady state solution. Two reference cases of an adiabatic CSTR and a homogenous azeotropic distillation from literature are studied, which successfully validate the reliability of the proposed approach. Besides the multiple steady states and Hopf bifurcation points, a more complex homoclinic bifurcation behavior is found for the distillation case compared to literature.     

An efficient constraint handling method with integrated differential evolution for numerical and engineering optimization

Constrained optimization problems are very important as they are encountered in many engineering applications. Equality constraints in them are challenging to handle due to tiny feasible region. Additionally, global optimization is required for finding global optimum when the objective function and constraints are nonlinear. Stochastic global optimization methods can handle non-differentiable and multi-modal objective functions. In this paper, a new constraint handling method for use with such methods is proposed for solving equality and/or inequality constrained problems. It incorporates adaptive relaxation of constraints and the feasibility approach for selection. The recent integrated differential evolution (IDE) with the proposed constraint handling technique is tested for solving benchmark problems with constraints, and then applied to many chemical engineering application problems with equality and inequality constraints. The results show that the proposed constraint handling method with IDE (C-IDE) is reliable and efficient for solving constrained optimization problems, even with equality constraints.     

带路径约束的聚烯烃牌号切换操作优化方法

产品多样化需求使得聚烯烃生产过程中经常需要进行牌号切换操作。以往关于牌号切换优化的研究大多只关心切换过程结束后聚合物质量指标是否达到目标牌号值,对过渡过程中质量指标及状态变量的波动情况缺少关注,而过程的波动会影响到最终产物的质量性质和操作平稳性。为此,本文以聚乙烯气相流化床反应器为对象,通过在牌号切换优化命题中加入关于熔融指数等的路径约束,防止过渡过程中的状态变量剧烈波动影响聚合物树脂质量。为求解此类带路径约束的动态优化问题,对常规的控制变量参数化方法进行了改进,通过求解微分代数方程(DAE方程)将路径约束转化为控制变量约束。仿真结果表明,加入路径约束可以有效避免牌号切换中变量的剧烈波动,增强过程平稳性。     

Studies on optimal control approach in a fed-batch fermentation

Fed-batch operation of fermentation processes has been receiving a great deal of interest as it offers the possibility to control a substrate concentration at a desired condition. However, control of a fed-batch fermentation reactor has been known to be a difficult task due to its highly nonlinear and complicated behavior. This work addresses an optimization-based control strategy for a fed-batch bioreactor where an ethanol fermentation process is chosen as a case study. The optimal control problem is formulated to determine the optimal feeding rate policy giving the highest product yield. The resulting optimization problem is solved by using an efficient sequential approach with a piecewise constant control parameterization. Due to the limitation of the sequential approach to cope with inequality path constraints, comparative studies of the methods for handling such constraints are carried out. Furthermore, the impact of time interval and switching time on the solution of the optimal control is investigated.     

Optimal process operation for the production of linear polyethylene resins with tailored molecular weight distribution

An optimization model is presented to determine optimal operating policies for tailoring high density polyethylene in a continuous polymerization process. Shaping the whole molecular weight distribution (MWD) by adopting an appropriate choice of operating conditions is of great interest when designing new polymers or when improving quality. The continuous tubular and stirred tank reactors are modeled in steady state by a set of differential‐algebraic equations with the spatial coordinate as independent variable. A novel formulation of the optimization problem is introduced. It comprises a multi‐stage optimization model with differential‐algebraic equality constraints along the process path and inequality end‐point constraints on product quality. The resulting optimal control problem is solved at high computational efficiency by means of a shooting method. The results show the efficiency of the proposed approach and the benefit of predicting and controlling the complete MWD as well as the interplay between operating conditions and polymer properties. © 2010 American Institute of Chemical Engineers AIChE J, 2011     

基于原-对偶内点法的化工过程优化算法

在基于积极集SQP的拟序贯算法研究基础上,提出了基于原-对偶内点法的拟序贯化工过程优化算法。拟序贯算法分为模拟层和优化计算层双层。模拟层中使用正交配置法同时离散状态变量和控制变量,变量的边界约束加于配置点上。同时,每次NLP迭代均求解离散DAE系统,消除等式约束和状态变量,从而减小NLP问题的规模。最新研究表明,在大规模优化问题中内点法相对于积极集SQP算法具有明显优势,因此,优化计算层中用原-对偶内点法来求解NLP问题。使用FORTRAN语言独立编写了整个算法程序,并通过热集成精馏系统最优控制的动态优化问题验证了算法的有效性。结果显示,该算法具有求解大规模动态优化问题的能力。     

Design stage optimization of an industrial low-density polyethylene tubular reactor for multiple objectives using NSGA-II and its jumping gene adaptations

Design stage optimization of an industrial low-density polyethylene (LDPE) tubular reactor is carried out for two simultaneous objectives: maximization of monomer conversion and minimization of normalized side products (methyl, vinyl, and vinylidene groups), both at the reactor end, with end-point constraint on number-average molecular weight (M_n,f) in the product. An inequality constraint is also imposed on reactor temperature to avoid run-away condition in the tubular reactor. The binary-coded elitist non-dominated sorting genetic algorithm (NSGA-II) and its jumping gene (JG) adaptations are used to solve the optimization problem. Both the equality and inequality constraints are handled by penalty functions. Only sub-optimal solutions are obtained when the equality end-point constraint on M_n,f is imposed. But, correct global optimal solutions can be assembled from among the Pareto-optimal sets of several problems involving a softer constraint on M_n,f. A systematic approach of constrained-dominance principle for handling constraints is applied for the first time in the binary-coded NSGA-II-aJG and NSGA-II-JG, and its performance is compared to the penalty function approach. A three-objective optimization problem with the compression power (associated with the compression cost) as the third objective along with the aforementioned two objectives, is also studied. The results of three-objective optimization are compared with two different combinations of two-objective problems.     

模块环境下的filter-SQP用于过程优化

引言 20世纪70年代中期以来,经过许多学者的努力,SQP法成为求解非线性规划(NLP)问题最有效的方法之一.     

A delay‐dependent robust fuzzy MPC approach for nonlinear CSTR

Based on Takagi–Sugeno (T–S) fuzzy models, a robust fuzzy model predictive control (MPC) algorithm is presented for a class of nonlinear time‐delay systems with input constraints. Delay‐dependent sufficient conditions for the robust stability of the closed‐loop system are derived, and the condition for the existence of the fuzzy model predictive controller is formulated in terms of nonlinear matrix inequality via the parallel distributed compensation (PDC) approach. By using a novel matrix transform technique, a receding optimization problem with linear matrix inequality (LMIs) constraints is constructed to design the desired controllers with an on‐line optimal receding horizon guaranteed cost. Finally, an example of continuous stirred tank reactors (CSTR) is given to demonstrate the effectiveness of the proposed results.     

Numerical solution approaches for robust nonlinear optimal control problems

Nonlinear equality and inequality constrained optimization problems with uncertain parameters can be addressed by a robust worst-case formulation that leads to a bi-level min–max optimization problem. We propose and investigate a numerical method to solve this min–max optimization problem exactly in the case that the underlying maximization problem always has its solution on the boundary of the uncertainty set. This is an adoption of the local reduction approach used to solve generalized semi-infinite programs. The approach formulates an equilibrium constraint employing first order derivatives of both the uncertainty set and the user defined constraints. We propose two different ways for computation of these derivatives, one similar to the forward mode, the other similar to the reverse mode of automatic differentiation. We show the equivalence of the proposed approach to a method based on geometric considerations that was recently developed by some of the authors. We show how to generalize the techniques to optimal control problems. The robust dynamic optimization of a batch distillation illustrates that both techniques are numerically efficient and able to overcome the inexactness of another recently proposed numerical approach to address uncertainty in optimal control problems.