共查询到18条相似文献,搜索用时 218 毫秒
1.
以开放式方程建立精馏塔严格机理模型,对精馏塔的操作优化进行了研究.根据精馏塔操作优化命题自由度低、模型结构稀疏且导数难以解析求解的特点,提出了基于简约空间序列二次规划算法(SQP)和混合求导方法相结合的精馏塔操作优化计算方法.在该方法中优化命题采用简约空间SQP算法求解,求解过程中需要的导数信息采用解析表达和预处理的自动微分技术求取.计算结果表明,本文方法在计算效率上大大高于基于差分求导的标准SQP算法,有利于在线实时优化的实施.另外本文优化结果也表明,精馏塔操作优化对提高产品产量、提高综合经济效益具有明显作用. 相似文献
2.
逐次2次规划法(SQP)是目前求解非线性约束问题十分有效的方法,但一般都采用罚函数进行线性搜索,这使得它有了很大的限制性,Roger Fletcher和Sven Leyffer等提出了一种filter SQP优化方法,在充分研究这种方法的基础上,编制了计算程序,将其应用到化工过程优化中,多种计算实例表明,该算法优于传统的SQP法。 相似文献
3.
传统的离子膜烧碱生产工艺消耗大量原料,且能量消耗量很大。针对这一弊端,采取取消亚硫酸钠处理装置的方法,使脱氯后淡盐水中存在的游离氯通过盐水化盐的程序以尽力减少损耗。原有的生产离子膜烧碱的设备有待改进,需要设立在线监测装置,使落后的工艺方法得到改进,设立标准化的控制指标和优化参数。这些稳定生产系统的方法能够极好地减化操作工艺,并且所生产的产品达到优级的标准。 相似文献
4.
5.
引言采用面向开放式方程的联立算法求解精馏塔优化问题,可以使模拟计算和寻优搜索在同一层迭代中完成,避免了双层法每一步优化搜索都需进行模型收敛计算的缺点,从而可以大大提高计算效率.而且原则上可任意指定自由变量.无论是模拟计算、操作优化还是设计优化都可以利用这个灵活的计算结构进行解算.高效、可靠的非线性约束最优化算法是实现精馏塔联立优化的关键.在流程模拟和过程系统优化中,序贯二次规划法(SequentialQuadraticProgramming,SQP)因其较高的计算效率而被广泛应用.SQP算法中,每一个迭代步都需要求解一个QP子问题… 相似文献
6.
7.
8.
详细介绍了连云港碱厂装置循环水优化过程,对比水质优化前后工艺流程特点,指出了采用不停车化学清洗、预膜等措施实现闭路循环,提高换热设备效率,减少设备腐蚀。 相似文献
9.
10.
针对中药生产双效浓缩过程动态平衡及蒸发速度优化问题,采用了基于SQP的优化与序贯模块模拟相结合的不可行路径求解方法.实践结果表明,将以SQP为优化核心的不可行路径法求解的优化结果应用在中药生产浓缩过程的自动控制中,能使中药生产过程始终维持双效动态平衡,且蒸发快速和稳定. 相似文献
11.
Behrang Mansoornejad Navid Mostoufi Farhang Jalali-Farahani 《Computers & Chemical Engineering》2008,32(7):1447-1455
A hybrid optimization technique, GA–SQP, is developed in which the genetic algorithm (GA) which is a stochastic method is combined with the sequential quadratic programming (SQP) method which is a deterministic method. This method was used to determine the kinetic parameters of the set of highly nonlinear hydrogenation reactions. Catalyst deactivation was also taken into account. The ability of GA and SQP in solving this type of problem was investigated. It was shown that although the SQP is fast, it is not able to solve this problem properly and is very sensitive to the choice of initial point. The GA was able to solve the problem after a large number of generations. It was shown that the new GA–SQP hybrid method is able to determine the final solution considerably faster than the GA while it is not sensitive to the initial point. 相似文献
12.
Manatsanan Chanthasuwannasin Bundit Kottititum 《Chemical Engineering Communications》2017,204(8):840-851
In this paper, mixed integer nonlinear programming (MINLP) is optimized by PSO_GA–SQP, the mixed coding of a particle swarm optimization (PSO), and a hybrid genetic algorithm and sequential quadratic programming (GA–SQP). The population is separated into two groups: discrete and continuous variables. The discrete variables are optimized by the adapted PSO, while the continuous variables are optimized by the GA–SQP using the discrete variable information from the adapted PSO. Therefore, the population can be set to a smaller size than usual to obtain a global solution. The proposed PSO_GA–SQP algorithm is verified using various MINLP problems including the designing of retrofit heat exchanger networks. The fitness values of the tested problems are able to reach the global optimum. 相似文献
13.
带或不带化学反应的相平衡计算为化学、化工领域的重要课题;可将其转换为带有约束的Gibbs自由能最小化问题。常用的序贯二次规划(SQP)收敛速度快;但依赖初始值;易陷入局部极小。人工免疫算法(AIS)具有全局寻优功能;但局部搜优性能差;收敛速度很慢;甚难找到痕量解。为此;在AIS算法中引入SQP操作;汲取两者的优点;构建混合免疫算法(HAIS)。还将相平衡的物质的量变量转换为摩尔分数;并采用适当策略处理约束;以基本可行解为基础;快速生成满足约束的抗体;以提高HAIS的操作速率。多个相平衡实例应用表明HAIS性能良好;优于其他方法(SQP;AIS)。 相似文献
14.
以Honeywell 公司流程模拟软件UniSim对常压塔进行流程模拟为基础,用软件自带的HoneywellSQP优化器进行优化,能够达到一定的优化效果,但这种优化方法存在优化效率低等缺点.针对这些问题,将Matlab中一种能够提高寻优解的改进遗传算法通过VB程序与Unisim中的常压塔模型进行通讯,通过外接改进的遗传... 相似文献
15.
换热网络合成问题通常可用非凸、非线性、不可微的混合整数非线性规划模型描述。基于GPU的并行计算技术为求解大规模模型提供了高效支撑。针对已有并行SQP算法求解换热网络合成问题中存在二元变量组合数过多、并行SQP算法求解结果严重依赖初值等问题,提出了BB/SQP混合并行算法。该算法采用BB算法代替枚举法,不但大大减少了模型求解中可能的二元变量组合,而且为SQP算法选出了可行的初值,从而提高了算法的求解质量。研究表明,所提出的混合并行算法能够有效求解换热网络合成问题,且并行计算相比串行计算的求解速度显著增加,加速比可达39。 相似文献
16.
《Computers & Chemical Engineering》1999,23(4-5):543-554
Successive quadratic programming (SQP) has been the method of choice for the solution of many nonlinear programming problems in process engineering. However, for the solution of large problems with SQP based codes, the combinatorial complexity associated with active set quadratic programming (QP) methods can be a bottleneck in exploiting the problem structure. In this paper, we examine the merits of incorporating an interior point QP method within an SQP framework. This provides a novel interpretation of popularly used predictor-corrector interior point (IP) methods. The resulting large-scale SQP algorithm, with an interior point QP, also allows us to demonstrate significant computational savings on problems drawn from optimal control and nonlinear model predictive control. 相似文献
17.
18.
To obtain the most suitable control algorithm for a wearable artificial pancreas, different control algorithms were compared and tested using a Hovorka model. Model predictive control (MPC), linear and nonlinear model forms, proportional integral derivative control (PID), neural-network-based model predictive control (NN-MPC), nonlinear autoregressive moving average (NARMA-L2) and sequential quadratic programming (SQP) were evaluated using the Hovorka model. Due to the fact that modeling of biomedical processes are very complex, to present the most effective control algorithm, various control strategies were needed to application. In the control algorithms, set point tracking and disturbance rejection were performed. With respect to the rise times of the control algorithms, SQP with optimal control had the shortest time, and NARMA-L2 had the longest time. Because the control algorithm connects the glucose meter and the insulin pump in an artificial pancreas, the rise time is the most important parameter. We propose that optimal control with SQP is the most suitable control algorithm to connect the glucose meter and the insulin pump. 相似文献