基于GA的主汽温系统内模控制研究

主汽温控制系统是典型的大迟延、大惯性、时变控制系统,一直以来都是火电厂自动控制的难点。为此将内模控制引入主汽温控制系统,并提出采用遗传算法对滤波器参数优化整定,该方法简单易行,相较于传统PID参数整定方法具有一定的优越性。并对内模控制为主控制器的IMC-PI控制系统进行SIMULINK仿真,与PID-PI控制系统进行对比,仿真结果表明IMC-PID控制系统相比于传统PID-P串级控制系统过渡时间短、超调量小、鲁棒性好等特点。其控制效果好于常规串级 PID 控制系统,适用于大迟延、大惯性过程的控制,并且易于在工业上实现。     

遗传算法在离心压缩机参数优化中的应用

遗传算法是当今世界上应用比较广泛的优化算法之一,特别是在处理有界多极值复杂函数方面有着明显的优势．在流体机械行业中,设计参数的优化问题往往涉及求解一些复杂隐函数在约束区间内的极值问题．因此将遗传算法应用到流体机械的设计参数优化当中有明显的现实意义．本文介绍了遗传算法在离心压缩机参数优化中的应用,并与传统的复合型法所获得的优化结果进行了比较,对比的结果显示出了遗传算法的优越性．     

基于混合智能算法的非线性双边多属性谈判模型

在非线性效用函数基础上,运用混合人工智能技术,建立非线性双边多属性谈判模型,给出在一定精度范围内逼近Pareto最优解的近似求解方法.最后通过价格、质量两属性的非线性双边谈判模拟算例,验证了方法的正确性与有效性.为多属性谈判研究提供了新的思路.     

基于均匀设计抽样遗传算法求解背包问题

众所周知,遗传算法的运行机理及特点是具有定向制导的随机搜索技术,其定向制导的原则是:导向以高适应度模式为祖先的"家族"方向.以此结论为基础,利用均匀设计抽样的理论和方法,对遗传算法中的交叉操作进行了重新设计,给出了一个新的GA算法,称之为均匀设计抽样遗传算法.最后将均匀设计抽样遗传算法应用于求解背包问题,并与简单遗传算...     

混合优化RBF-BP网络的板形缺陷识别

针对传统板形模式识别方法存在精度低、鲁棒性弱的问题,提出了一种混合优化RBF-BP组合神经网络板形模式识别方法。首先利用自组织映射网络(SOM)对样本聚类,利用聚类后的网络拓扑结构确定RBF的中心,并计算RBF的宽度,克服了传统聚类算法随机选取中心导致聚类结果不稳定的问题。然后利用遗传算法(GA)良好的全局搜索能力优化整个网络的权值。RBF-BP组合神经网络是由一个RBF子网和一BP子网串联构成的,该网络同时具备BP神经网络能较好地预测未知样本的能力以及RBF神经网络的逼近速度快的优点。并以某900HC可逆冷轧机板形识别为应用背景,在MATLAB2010a环境下进行仿真实验,结果表明混合优化RBF-BP组合神经网络的板形模式识别方法能够识别出常见的板形缺陷,提高了板形缺陷识别精度并具有较好的鲁棒性,可以满足板带轧机高精度的板形控制要求。     

基于UV-Vis检测养殖水体中化学需氧量含量研究

采用紫外可见光谱(UV-Vis)与极限学习机算法检测水体化学需氧量(chemical oxygen demand,COD)含量研究。采集135份水样进行紫外可见波段全光谱扫描,结合变量标准化(standard normal variate,SNV),多元散射校正(MSC)和一阶微分(1st D)对原始数据进行预处理,然后采用竞争性自适应重加权算法(competitive adaptive reweighted sampling,CARS)、随机青蛙(Random frog)算法和遗传算法进行特征波长选择。基于全光谱建立了偏最小二乘回归(partial least squares,PLS)和基于特征波长建立了极限学习机算法(extreme learning machine,ELM)模型。结果表明：使用CARS提取的9个特征波长建立的ELM模型的预测效果最优,决定系数R2为0.82,预测均方根误差RMSEP为 14.48 mg·L-1,RPD值为2.34。说明使用CARS变量选择算法获取UV-Vis光谱特征波长,应用极限学习机建模,可以准确、快速的检测养殖水体中COD含量,为实现养殖水体COD的动态快速检测以及水体其他微量物质含量参数检测打下基础。     

Initial guess by improved population-based intelligent algorithms for large inter-frame deformation measurement using digital image correlation

Digital image correlation (DIC) has received a widespread research and application in experimental mechanics. In DIC, the performance of subpixel registration algorithm (e.g., Newton-Raphson method, quasi-Newton method) relies heavily on the initial guess of deformation. In the case of small inter-frame deformation, the initial guess could be found by simple search scheme, the coarse-fine search for instance. While for large inter-frame deformation, it is difficult for simple search scheme to robustly estimate displacement parameters and deformation parameters simultaneously with low computational cost. In this paper, we proposed three improving strategies, i.e. Q-stage evolutionary strategy (T), parameter control strategy (C) and space expanding strategy (E), and then combined them into three population-based intelligent algorithms (PIAs), i.e. genetic algorithm (GA), differential evolution (DE) and particle swarm optimization (PSO), and finally derived eighteen different algorithms to calculate the initial guess for qN. The eighteen algorithms were compared in three sets of experiments including large rigid body translation, finite uniaxial strain and large rigid body rotation, and the results showed the effectiveness of proposed improving strategies. Among all compared algorithms, DE-TCE is the best which is robust, convenient and efficient for large inter-frame deformation measurement.     

On molecular topological properties of hex‐derived networks

Topological indices are numerical parameters of a molecular graph, which characterize its topology and are usually graph invariant. In quantitative structure–activity relationship/quantitative structure–property relationship study, physico‐chemical properties and topological indices such as Randić, atom–bond connectivity (ABC), and geometric–arithmetic (GA) index are used to predict the bioactivity of chemical compounds. Graph theory has found a considerable use in this area of research. In this paper, we study hex‐derived networks HDN1(n) and HDN2(n), which are generated by hexagonal network of dimension n and derive analytical closed results of general Randić index R_α(G) for different values of α, for these networks of dimension n. We also compute the general first Zagreb, ABC, GA, ABC₄, and GA₅ indices for these hex‐derived networks for the first time and give closed formulae of these degree‐based indices for hex‐derived networks. Copyright © 2016 John Wiley & Sons, Ltd.