BCOISOA-BP网络在磨矿粒度软测量中的应用

BCOISOA-BP network in grinding particle size soft sensor applications

  • 摘要: 传统人群搜索(SOA)算法通过计算搜索方向、搜索步长和搜寻更新个体位置三个步骤进行寻优.它的缺点在于计算量大,种群之间信息交流少,导致寻优速度慢.针对人群搜索算法存在的缺点,本文提出二项交叉算子改进人群搜索算法(BCOISOA)对其改进.在计算搜索步长方面,本文采用随机数与最大函数值位置乘积判断子群位置,进而提高全局寻优计算速率.在更新位置方面,本文提出二项交叉算子加强种群之间的联系,避免在更新搜索方向过程中,算法因局部最优而导致过早收敛,进而达到快速、准确寻找最优解的目的.本文将以上二项交叉算子改进人群搜索-BP神经网络算法应用在二段式磨矿过程中,实现磨矿粒度在线软测量.仿真结果表明,与人群搜索算法和粒子群算法进行比较,二项交叉算子改进人群搜索算法收敛速度更快,预测精度最高,满足对磨矿粒度实时检测的要求.

     

    Abstract: The traditional seeker optimization algorithm (SOA) uses three steps for an optimal search:calculating the search direction, searching the step length, and updating the individual position. Its shortcomings are the large amount of calculation required and weak communication between populations, which results in low speed optimization. To address these disadvantages, this paper offers the binomial crossover operator improved seeker optimization algorithm (BCOISOA) as an improvement. In terms of computational search step length, this paper adopts a random number and maximum function product judgment subgroup location so that global optimization computation speed can be improved. In terms of update location, this paper puts forward two crossover operators to strengthen the connection between the populations. This avoids premature convergence of the algorithm during the process of updating the search direction, caused by the local optimum, and achieves a fast and accurate optimal solution. This article usesthe BCOISOA-BP neural network algorithm for a two-phase grinding process to achieve a grind size online soft sensor. Compared with the SOA and PSO algorithms, the simulation result shows that the BCOISOA algorithm has the fastest convergence speed and highest precision. It therefore satisfies the requirements of grind size real-time detection.

     

/

返回文章
返回