基于群体智能算法的换热网络同步最优综合

换热网络同步综合方法一般需要建立复杂的混合整数非线性数学规划模型,该模型具有非凸、非线、不连续的特点,属于最难求解的一类NP-hard问题,应用传统的优化算法很难确定其全局最优解,尤其是对大规模换热网络综合问题,甚至无法在合理时间内接近全局最优的局部最优解。针对换热网络同步综合问题,提出基于群体智能算法的分层优化策略,外层采用离散粒子群算法与遗传算法相结合的混合群体智能算法优化换热网络结构,内层在结构变量给定条件下利用改进粒子群算法优化冷热物流分流比与换热负荷。两个典型算例研究证明了该方法能以较高的效率和稳定性得到较好的优化结果。     

基于自适应粒子群优化算法的预测控制算法及其在加热炉支管平衡中的应用

多变量和输出受限系统的预测控制问题一般表现为一个不易直接求解的多变量且多约束的非线性动态规划问题.传统优化方法在解决此优化问题时,存在易收敛到非法解或局部极小、计算时间长以及对模型参数与初值依赖性强的缺点.提出了一种基于自适应粒子群优化的预测控制算法(APSO-DMC),采用自适应粒子群优化算法(APSO)作为模型预测控制的优化方法,在线实时求解最优控制律,从而有效地克服了传统优化方法的不足.将此算法应用于常减压装置加热炉支管温度平衡控制中,仿真试验结果显示了该方法的有效性.     

全局群搜索优化算法及其在汽油调合中的应用

汽油调合配比生产优化是一种非线性约束的多峰优化问题。针对一般群智能优化算法在解决此类优化中易陷于局部最优解,提出了一种改进的群搜索优化算法--全局群搜索优化算法（GGSO）。该算法采用混沌机制初始化粒子在解空间内均匀分布;在算法前期,保留GSO的追随者进化策略,以保证算法的收敛速度。在算法后期,对追随者引入速度更新和个体最优,以保证算法的收敛精度;在粒子陷入局部极值时,对追随者和游荡者引入一种新的交叉、变异机制和自适应混沌扰动机制,以保证粒子跳出局部极值,提高算法全局寻优性能。分别用4个标准测试函数对优化算法进行测试,结果表明：GGSO算法与标准GSO、线性递减惯性权重粒子群算法（LDWPSO）比较,收敛速度和全局寻优性能有明显优势。汽油在线调合优化实例应用表明：该算法有较快的收敛速度,能够较准确地寻得全局最优。     

基于AEA算法的自适应惩罚函数求解约束优化及其在丁烯烷化过程的应用

提出了一种基于AEA算法处理约束问题的自适应惩罚函数法。该算法通过统计迭代种群中个体对每个约束条件违反的次数,判定各约束的强弱地位,动态自适应地调整各个约束的惩罚系数,对于强约束给予较大的惩罚系数。同时对目标函数做出了相适应区分修改,使得可行解和不可行解的目标函数值出现一定的区分,目标函数项和惩罚项趋于平衡,避免了惩罚力度过大或过小,有利于算法前期快速进入可行解区域,后期寻找最满意解。通过标准测试函数试验结果与DE+AMP、SSaDE算法进行比较,表明了提出的方法具有良好的适用性以及全局优化性能,将该方法应用于丁烯烷化过程的约束优化,取得了令人满意的结果。     

基于粒子群优化算法的球磨机制粉系统PID-ANN解耦控制器

球团厂钢球磨煤制粉系统是多变量强耦合、时滞、非线性以及生产工况变化大的复杂对象,其自动控制问题一直是控制界关注的热点。基于粒子群算法具有对整个参数空间进行高效并行搜索的特点以及PID神经网络的自调节和自适应特性,设计了具有PID结构的多变量自适应神经网络控制器。PID神经网络解耦控制方法被用来消除回路之间的耦合,神经网络连接权值由粒子群算法进行学习优化。仿真研究表明所建模型和所提控制方法具有较好的控制品质、良好的自适应解耦能力和自学习功能。该控制策略可在大范围内克服系统的非线性和强耦合问题,具有很高的工程实用价值。     

基于混合粒子群算法的复杂相平衡计算方法

对于含有两个部分互溶液相的相平衡问题,采用经典方法收敛困难或易陷于平凡解。为此根据最小Gibbs自由能原理,提出采用混合粒子群算法搜索全局最优解,计算得到系统的最小Gibbs自由能状态,实现复杂相平衡计算。通过改建目标函数,减少计算量,并引入组分相分率,将物料平衡约束转换为规范型立方空间的优化问题,适于粒子群算法搜索。在常规粒子群算法中引入Nelder-Mead单纯形操作,可显著提高搜优的速率和精度。将其应用于甲苯-水-苯胺液液平衡和苯-乙腈-水汽液液平衡计算,取得了良好的效果。     

一种新型Powell粒子群算法同步综合换热网络

针对换热网络同步综合方法的不足,本文提出了一种新型Powell粒子群算法,具有传统确定性方法的高精度以及启发式方法的高效率。同时针对群体智能算法优化换热网络问题时存在的不足,提出了云记忆体和个体对立策略,有效地避免算法发生早熟现象,扩大搜索范围。为处理整型变量而提出的两条整型变量优化策略与Powell粒子群算法结合,实现了连续变量与整型变量的同步优化。最后,选取两个经典算例验证算法的性能,均获得了优于文献的结果,表明算法能够找到更优的换热网络结构,是一种处理混合整数非线性问题的有效方法。     

混合粒子群算法用于共沸精馏塔的最优设计

提出了一种适于求解混合整数非线性规划问题的混合粒子群优化算法,并将其与化工过程模拟软件相结合,用于共沸精馏塔的最优设计。优化模型以年度总费用最小为目标,以精馏段板数、提馏段板数和回流比为优化变量,并引入流体力学约束使得优化结果更具实际价值,并以效率更高的"轮盘赌"式策略处理整数变量,约束处理采用Deb方法。最终以C++实现优化算法,C#编制界面,通过商业模拟软件Aspen Plus计算粒子适应度,将本方法用于一个醋酸甲酯/甲醇/水三元共沸组成的分离案例,所获最优年度总费用优于文献结果。     

基于时间离散的粒子群算法的半间歇乙酸乙酯生产过程的节拍优化方法

针对半间歇乙酸乙酯生产线中存在的节拍失衡问题,提出了一种基于时间离散的粒子群算法(PSO)。针对优化问题进行了时间离散化处理,同时考虑到实际生产设备的操作条件设置区间约束,通过粒子群优化算法得到了最佳温度优化曲线,较好地解决了精馏塔在生产等待期间的温度优化问题。通过矩阵实验软件(MATLAB)进行了实验仿真,结果表明,设计的算法是可行的。     

一种求解化工动态优化问题的迭代自适应粒子群方法

智能优化方法因其简单、易实现且具有良好的全局搜索能力,在动态优化中的应用越来越广泛,但传统的智能方法收敛速度相对较慢。提出了一种迭代自适应粒子群优化方法(IAPSO)来求解一般的化工动态优化问题。首先通过控制变量参数化将原动态优化问题转化为非线性规划问题,再利用所提出的迭代自适应粒子群优化方法进行求解。相比传统的粒子群优化方法,该种迭代自适应粒子群优化方法具有收敛速度更快的优点,主要原因是:该算法根据粒子种群分布特性自适应调整参数;该算法通过缩减搜索空间并迭代使用粒子群算法搜索最优解。将提出的迭代自适应粒子群方法应用到多个经典动态优化问题中,测试结果表明,该方法简单、有效,精度高,且收敛速度比传统粒子群算法有显著提升。     

Optimization-based design of reactive distillation columns using a memetic algorithm

The design optimization of reactive distillation columns (RDC) is characterized by complex nonlinear constraints, nonlinear cost functions, and the presence of many local optima. The standard approach is to use MINLP solvers that work on a superstructure formulation where structural decisions are represented by discrete variables and lead to an exponential increase in the computational effort. The mathematical programming (MP) methods which solve the continuous sub-problems provide only one local optimum which depends strongly on the initialization. In this contribution a memetic algorithm (MA) is introduced and applied to the global optimization of four different formulations of a computational demanding real-world design problem. An evolution strategy addresses the global optimization of the design decisions, while continuous sub-problems are efficiently solved by a robust MP solver. The MA is compared to MINLP techniques. It is the only algorithm that finds the global solution in reasonable times for all model formulations.     

An improved framework for solving NLIPs with signomial terms in the objective or constraints to global optimality

Real application problems are often formulated as nonlinear integer programming problems or as discrete global optimization problems with signomial terms in the objective or constraints. Although various approaches have been proposed to solve the problems, they either utilize numerous extra binary variables and constraints to reconstruct the problems for finding a global solution or are unable to obtain globally optimized solutions. This study proposes a novel linearization method that employs a logarithmic number of extra binary variables and constraints to reformulate a signomial term with discrete variables. The original nonlinear integer program is therefore converted into a mixed-integer linear program solvable to obtain a global optimum. Several numerical experiments are presented to demonstrate the computational efficiency of the proposed methods in solving nonlinear integer problems, especially for treating signomial functions with large-interval variables or multiple variables.     

基于微粒群优化算法的不确定性调和调度

Blending is an important unit operation in process industry. Blending scheduling is nonlinear optimization problem with constraints. It is difficult to obtain optimum solution by other general optimization methods. Particle swarm optimization （PSO） algorithm is developed for nonlinear optimization problems with both continuous and discrete variables. In order to obtain a global optimum solution quickly, PSO algorithm is applied to solve the problem of blending scheduling under uncertainty. The calculation results based on an example of gasoline blending agree satisfactory with the ideal values, which illustrates that the PSO algorithm is valid and effective in solving the blending scheduling problem.     

Enhanced shielding effectiveness of polymer matrix composite enclosures utilizing constraint‐based optimization

Many interrelated factors must be considered in the design of an electronic system. Finding the optimum design condition having been subjected to various design constraints is often not a trivial matter. Utilizing an approach to optimize the design of electronic systems would have many advantages. A design optimization approach allows designers to study and optimize the various design alternatives. To illustrate this approach, in this study the optimum design of electronic enclosures from the viewpoint of electromagnetic shielding effectiveness is considered. An optimization problem has been formulated and the influence of several design variables in the definition of the objective function and constraints set is examined. To solve the problem, a non‐linear optimization solution technique is utilized that allows users to optimize an objective function bound by equality and inequality constraints. A case study is presented to illustrate the utility of this technique in selection of the best composite materials for maximum absorption against radiated energy, a case with application in radar.     

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

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.     

城市天然气管道的参数优化设计

通过管段的管径、壁厚、节点流量、强度、稳定性等约束条件,优化设计了城市天然气管网.同时根据技术经济学原理,引入了复利系数等作为管道的经济指标,建立了管网的数学模型,并且进行了参数优化.利用二次插值法和罚函数相结合,可将相关约束条件与目标函数构造为无约束函数求解,证明该设计方法具有可行性,对城市天然气管道的优化设计具有一定的实践指导意义.     

Trade-off optimal design of a biocompatible solvent for an extractive fermentation process

In this study, crisp and flexible optimization approaches are, respectively, introduced to design an optimal biocompatible solvent for an extractive fermentation process. The optimal design problem is formulated as a mixed-integer nonlinear programming model in which performance requirements of the compounds are reflected in the objective and the constraints. In general, the requirements for the objective and constraints are not rigid; consequently, the flexible or fuzzy optimization approach is applied to soften the rigid requirement for maximization of the extraction efficiency and to consider the mass flow rate and biocompatibility of solvent as the softened inequality constraints to the solvent design problem. Having elicited the membership function for the objective function and the constraint, the optimal solvent design problem can be formulated as a flexible goal attainment problem. Mixed-integer hybrid differential evolution is applied to solve the problem in order to find a satisfactory design.     

Integration of scheduling and control with online closed-loop implementation: Fast computational strategy and large-scale global optimization algorithm

In this paper, we propose a novel integration method to solve the scheduling problem and the control problem simultaneously. The integrated problem is formulated as a mixed-integer dynamic optimization (MIDO) problem which contains discrete variables in the scheduling problem and constraints of differential equations from the control problem. Because online implementation is crucial to deal with uncertainties and disturbances in operation and control of the production system, we develop a fast computational strategy to solve the integration problem efficiently and allow its online applications. In the proposed integration framework, we first generate a set of controller candidates offline for each possible transition, and then reformulate the integration problem as a simultaneous scheduling and controller selection problem. This is a mixed-integer nonlinear fractional programming problem with a non-convex nonlinear objective function and linear constraints. To solve the resulting large-scale problem within sufficiently short computational time for online implementation, we propose a global optimization method based on the model properties and the Dinkelbach's algorithm. The advantage of the proposed method is demonstrated through four case studies on an MMA polymer manufacturing process. The results show that the proposed integration framework achieves a lower cost rate than the conventional sequential method, because the proposed framework provides a better tradeoff between the conflicting factors in scheduling and control problems. Compared with the simultaneous approach based on the full discretization and reformulation of the MIDO problem, the proposed integration framework is computationally much more efficient, especially for large-scale cases. The proposed method addresses the challenges in the online implementation of the integrated scheduling and control decisions by globally optimizing the integrated problem in an efficient way. The results also show that the online solution is crucial to deal with the various uncertainties and disturbances in the production system.     

Smooth penalty function method for rigorous optimization of distillation processes

Integer decisions on stage numbers and feed locations, and global optimality are still challenging for rigorous optimization of distillation processes. In the present article, we propose a smooth penalty function method to address both these problems. The proposed method is based on the relaxation of the integer decision problem into continuous nonlinear programming (NLP) problem by adopting the bypass efficiency model developed by Dowling and Biegler. A smooth penalty term (SPT) is proposed and added to the total annual cost (TAC) function to form a new objective function, namely, the smooth penalty function. Using the new objective function, the problem is initially solved with negative weight coefficients for the SPTs regarding each column section to get an optimum near the global optimum of the SPT. Then, starting from this solution, the problem is solved again iteratively by increasing the values of the weight coefficients until all the stage numbers become integers. The performance of the method is validated by an illustrating problem and in three case studies, including a reactive distillation optimization problem.     

基于分解算法的功热交换网络多目标优化

功热网络设计问题指在流程设计中对变压和换热过程进行耦合优化设计的问题,以此来提高整体系统的能效并降低成本。前人工作中一般采用数学规划法对功热网络建模优化。然而,由于存在变压过程和换热器面积计算的非线性约束,以及换热匹配的二元变量,整体模型往往是一个高度非凸的混合整数非线性规划模型,难以求解。本文提出一种高效的功热网络优化方法。模型中分别用透平压缩机和换热器实现功热网络中轴功和热的交换。求解过程采用分解算法,主问题中用随机算法对关键变量优化,功和热两个子网络问题中用确定性算法求解。目标函数考虑了经济和环境影响。案例测试对比了不同优化目标得到的结果以及多目标Pareto曲线,验证了所提出方法的高效性。