基于PSO_SA算法的聚丙烯熔融指数预报

实时准确的熔融指数预报在控制聚丙烯产品质量和提高聚丙烯生产的经济效益上有着举足轻重的作用。本文提出了一种粒子群优化(PSO)算法和模拟退火(SA)算法相结合的PSO_SA算法,该算法利用PSO和SA的优劣势进行互补,提高了算法寻优的能力和效果。利用此算法对建立的RBF聚丙烯熔融指数预报模型进行结构寻优,得到结构最优的预报模型。最后通过该模型对实际聚丙烯生产数据的预报研究,证明了PSO_SA算法寻优得到的预报模型具有很高的预报精度和可靠性能。     

群智能优化LSSVM最优聚丙烯熔融指数预报

提出了群智能优化AC_ICPSO(ant colony and immune clone particle swarm optimization)算法,融合蚁群算法与粒子群算法进行动态群体搜索,设计交叉算子和变异算子、群体多次编码、迭代选择等,来提高数据搜索的范围、精度和收敛的效率,避免早熟,降低算法的复杂度。然后利用AC_ICPSO方法对最小二乘支持向量机预报模型(LSSVM)进行参数寻优,得到最优的AC_ICPSO_LSSVM预报模型。以实际聚丙烯生产的熔融指数预报作为实例进行研究,结果表明所提出的AC_ICPSO_LSSVM方法有效,具有良好的预报精度。     

自适应粒子群优化算法在聚丙烯熔融指数预报上的应用

针对丙烯聚合生产控制中聚丙烯熔融指数在线测量的控制要求,以及过程变量间相关性高的特点,提出一种基于自适应粒子群优化算法和径向基函数神经网络的聚丙烯熔融指数预报新方法。该方法采用变参数的自适应粒子群优化算法提高优化算法的效率和收敛性,并且融合了主成分分析、统计建模以及智能优化方法,从而降低了预报模型的复杂度。提出了一种基于径向基函数神经网络的统计预报模型的参数优化和结构优化方法。使用该统计模型对工厂实际生产过程进行预报,并与国内外相关研究报道相比较,表明了本文所提出的预报方法的有效性和更高的准确性。     

一种改进粒子群算法及其在聚乙烯热分解动力学分析中的应用

随着计算机技术的发展，粒子群算法在聚合物的热分解动力学领域广泛应用。虽然粒子群算法可以实现全局寻优，但也存在收敛速度慢且易陷入局部最优解的缺陷。针对标准粒子群算法的缺陷，引入自适应惯性权重与加速常数对粒子群算法进行改进，提出一种动态自适应粒子群算法（DAPSO），并进行6个测试函数的仿真实验。结果表明：DAPSO算法比MPSO及MeanPSO算法收敛速度更快且精度更高。将DAPSO算法与Kissinger法结合得到了K-DAPSO算法，分别利用DAPSO算法与K-DAPSO算法结合聚乙烯DTG曲线，对两步平行反应模型进行参数反演。K-DAPSO算法较DAPSO算法能够更快收敛到最优解。提出的两步平行反应模型能够准确描述聚乙烯热失重曲线复杂的多峰结构。     

基于粒子健康度的快速收敛粒子群优化算法

针对现有粒子群优化算法在工程应用中,特别是在粒子维数较高的情况下,很容易发生早熟收敛等缺点,提出了一种基于粒子健康度的快速收敛粒子群优化算法(HPSO)。给出了粒子健康度的概念及计算方法。该算法通过动态监控粒子的健康度指标,对健康度较低的粒子单独进行变异操作。从而可以在保护健康粒子继续搜索最优值的同时,有效“治疗”非健康的早熟粒子,提高了整个粒子群的寻优能力及跳出局部最优值的能力。然后通过大量的标准测试函数对其进行测试,并将其与标准粒子群优化算法(SPSO)、权重递减的粒子群优化算法(WPSO)进行对比。测试结果表明,在粒子维数较高的应用中HPSO算法的收敛速度更快,效率更高。     

一种基于新型蚁群算法的聚丙烯熔融指数预报模型

聚丙烯熔融指数的实时预报非常重要却十分困难,提出了一种经过新型蚁群算法优化后的PCA-RBF神经网络方法进行熔融指数预报。PCA将原始数据从高维空间映射到低维空间,剔除冗余信息和提取过程特征;RBF神经网络则用来拟合输入与输出之间的非线性关系;最后用适用于连续空间寻优问题的新型蚁群算法对RBF神经网络权值进行优化。实际生产数据的研究结果,表明了所提出的熔融指数预报模型的准确性和可靠性。     

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

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

混合粒子群算法求解单机批调度问题

设计了一种混合粒子群算法(Hybrid Particle Swarm Optimization,HPSO)以求解基于工件动态到达的最小化最大拖期时间单机批调度问题。该算法在标准粒子群算法的基础上引入了惯性权重正弦调整,以改善标准粒子群算法的收敛速度和全局收敛性,然后采用自适应变异全局极值算法增强粒子群优化算法跳出局部最优解的能力,防止算法陷入局部最优。应用改进的算法对实验设计问题进行求解,证明了改进算法的有效性。     

融合交叉变异和混沌的新型混合粒子群算法

针对粒子群算法在多峰函数优化中极易陷入局部最优的问题,提出一种融合交叉、变异以及混沌的新型混合粒子群算法。该算法采用混沌初始化所有粒子位置和速度,保证初始粒子在解空间均匀分布;在每代进化过程中引入交叉操作增加种群的多样性;并且在算法后期,粒子陷入局部极值时,采用一种新的自适应混沌扰动机制和变异机制,以确保粒子跳出局部最优位置。选用4个标准测试函数对所提出的算法进行对比仿真研究,结果表明,该算法具有较快的收敛速度、有效的全局寻优能力。     

自适应混合粒子群约束优化算法及其在软测量模型参数估计中的应用

对于软测量模型参数估计问题, 针对传统梯度法求解非线性最小二乘模型时依赖初值、需要追加趋势分析进行验证和无法直接求解复杂问题的缺陷, 提出将参数估计化为约束优化问题, 使用混合优化算法求解的新思路。为此提出一种自适应混合粒子群约束优化算法(AHPSO-C)。在AHPSO-C算法中, 为平衡全局搜索(混沌粒子群)和局部搜索(内点法), 引入自适应内点法最大函数评价次数更新策略。对12个经典测试函数的仿真结果表明, AHPSO-C是求解约束优化问题的一种有效算法。将算法用于淤浆法高密度聚乙烯(HDPE)串级反应过程中熔融指数软测量模型参数估计, 验证了方法的可行性与优越性。     

Melt index prediction based on fuzzy neural networks and PSO algorithm with online correction strategy

A black‐box modeling scheme to predict melt index (MI) in the industrial propylene polymerization process is presented. MI is one of the most important quality variables determining product specification, and is influenced by a large number of process variables. Considering it is costly and time consuming to measure MI in laboratory, a much cheaper and faster statistical modeling method is presented here to predicting MI online, which involves technologies of fuzzy neural network, particle swarm optimization (PSO) algorithm, and online correction strategy (OCS). The learning efficiency and prediction precision of the proposed model are checked based on real plant history data, and the comparison between different learning algorithms is carried out in detail to reveal the advantage of the proposed best‐neighbor PSO (BNPSO) algorithm with OCS. © 2011 American Institute of Chemical Engineers AIChE J, 2012     

应用群能量恒定粒子群优化算法的批次流加发酵过程批次间优化(英文)

An iterative optimization strategy for fed-batch fermentation process is presented by combining a run-to-run optimization with swarm energy conservation particle swarm optimization (SEC-PSO). SEC-PSO, which is designed with the concept of energy conservation, can solve the problem of premature convergence frequently appeared in standard PSO algorithm by partitioning its population into several sub-swarms according to the energy of the swarm and is used in the optimization strategy for parameter iden-tification and operation condition optimization. The run-to-run optimization exploits the repetitive nature of fed-batch processes in order to deal with the optimal problems of fed-batch fermentation process with inaccurate process model and unsteady process state. The kinetic model parameters, used in the operation condition optimization of the next run, are adjusted by calculating time-series data obtained from real fed-batch process in the run-to-run optimization. The simulation results show that the strategy can adjust its kinetic model dynamically and overcome the instability of fed-batch process effectively. Run-to-run strategy with SEC-PSO provides an effective method for optimization of fed-batch fermentation process.     

Prediction of the Melt Index Based on the Relevance Vector Machine with Modified Particle Swarm Optimization

A novel chemical soft‐sensor approach for the prediction of the melt index (MI) in the propylene polymerization industry is presented. The MI is considered as one of the important variables of quality that determine the product specifications. Thus, a reliable estimation of the MI is crucial in quality control. An accurate optimal predictive model of MI values with the relevance vector machine (RVM) is proposed, where the RVM is employed to build the MI prediction model; a modified particle swarm optimization (MPSO) algorithm is then introduced to optimize the parameter of the RVM, and the MPSO‐RVM model is thereby developed. An online correcting strategy (OCS) is further carried out to update the modeling data and to revise the model's parameter self‐adaptively whenever model mismatch happens. Based on the data from a real polypropylene production plant, a detailed comparison is carried out among the least squares support vector machine (LS‐SVM), RVM, MPSO‐RVM, and OCS‐MPSO‐RVM models. The research results reveal the prediction accuracy and validity of the proposed approach.     

Melt index prediction by weighted least squares support vector machines

Melt index is considered an important quality variable determining product specifications. Reliable prediction of melt index (MI) is crucial in quality control of practical propylene polymerization processes. In this paper a least squares support vector machines (LS‐SVM) soft‐sensor model of propylene polymerization process is developed to infer the MI of polypropylene from other process variables. Considering the use of a SSE cost function without regularization might lead to less robust estimates; the weighted least squares support vector machines (weighted LS‐SVM) approach of propylene polymerization process is further proposed to obtain a robust estimation of melt index. The performance of standard SVM model is taken as a basis of comparison. A detailed comparison research among the standard SVM, LS‐SVM, and weighted LS‐SVM models is carried out. The research results confirm the effectiveness of the presented methods. © 2006 Wiley Periodicals, Inc. J Appl Polym Sci 101: 285–289, 2006     

结合遗传算子的改进粒子群算法在控制系统设计中的应用

针对粒子群优化算法容易陷入局部最优以及早熟等缺点,结合遗传算法的选择交叉变异算子进行改进,得到一种新型PSO算法.将该方法应用于PID控制系统参数调优和被控对象参数辨识,仿真结果显示所提出的算法优化效果优于基本粒子群优化算法和遗传算法,收敛性能也得到较大提高.     

Melt index prediction by RBF neural network optimized with an adaptive new ant colony optimization algorithm

Melt index (MI) is a crucial indicator in determining the product specifications and grades of polypropylene (PP). The prediction of MI, which is important in quality control of the PP polymerization process, is studied in this work. Based on RBF (radial basis function) neural network, a soft‐sensor model (RBF model) of the PP process is developed to infer the MI of PP from a bunch of process variables. Considering that the PP process is too complicated for the RBF neural network with a general set of parameters, a new ant colony optimization (ACO) algorithm, N‐ACO, and its adaptive version, A‐N‐ACO, which aim at continuous optimizing problems are proposed to optimize the structure parameters of the RBF neural network, respectively, and the structure‐best models, N‐ACO‐RBF model and A‐N‐ACO‐RBF model for the MI prediction of propylene polymerization process, are presented then. Based on the data from a real PP production plant, a detailed comparison research among the models is carried out. The research results confirm the prediction accuracy of the models and also prove the effectiveness of proposed N‐ACO and A‐N‐ACO optimization approaches in solving continuous optimizing problem. © 2010 Wiley Periodicals, Inc. J Appl Polym Sci, 2010     

基于差分进化粒子群混合优化算法的软测量建模

针对乙烯生产过程中,用传统方法难以直接完成对乙烯收率的在线测量的问题,提出了一种新型差分进化粒子群混合优化算法,建立了乙烯收率软测量建模。改进算法将优化过程分成两阶段,两分群分别采用粒子群算法和差分进化算法同时进行。迭代过程中引入进化速度因子进行算法局部收敛性判断,通过两个群体间的信息交流阻止算法陷入局部最优。对高维复杂函数寻优测试表明,算法的整体优化性能均强于基本粒子群算法和差分进化算法。应用结果表明,基于改进算法的软测量模型具有测量精度较高、泛化性能较好等优点。     

气相流化床聚乙烯颗粒粒径分布的定制

基于气相法聚乙烯流化床反应器颗粒粒径分布的预测[1],提出了颗粒粒径分布定制模型.通过模型的优化计算,可得到催化剂粒径及其分布、操作气速、反应温度、乙烯浓度和丁烯浓度等生产操作参数,由此进行生产可获得具有良好流态化特性的聚乙烯颗粒粒径分布,能为生产具有特定粒径分布的聚乙烯颗粒提供理论指导.模型由工业装置的生产数据分析了计算结果的合理性.最后,以三种粒径分布的聚乙烯颗粒为例讨论了模型的可行性.同时,运用粒子群优化算法求解模型的非线性规划问题,算法具有调整参数少、收敛速度快和全局优化等优点.