改进粒子群算法及其在热连轧负荷分配中的应用

Improved PSO and its application to load distribution optimization of hot strip mills

  • 摘要: 对一种已有的自适应算法进行了改进,并将该算法思想引入到粒子群算法的改进中,在种群进化到一定代数时按照改进自适应算法改变搜索范围的大小,实现了自动调整搜索范围、提高收敛速度和精度并可有效防止粒子群算法早熟收敛的目的,同时通过实验仿真进行了验证.将该改进粒子群算法应用到热连轧机精轧机组的负荷分配优化计算中,程序运行时间小于5s,满足实时性的要求,为其提供了一种更为有效的优化手段.

     

    Abstract: An adaptive algorithm was improved and introduced to the particle swarm optimization algorithm (PSO). When the population evolution reaches certain generations, the search area is changed in accordance with the improved adaptive algorithm. It is achieved that the search area is revised automatically to increase the convergence rate and precision and prevent the premature convergence of the particle swarm algorithm. The conclusion was verified through simulation. Finally, the new algorithm was applied to the optimum design of scheduling hot strip mills, whose running time was less than 5 s, which validated the real-time application to provide an effective way to optimize.

     

/

返回文章
返回