结合高斯分布的改进二进制灰狼优化算法  

Improved Binary Grey Wolves Optimization Algorithm Combined with Gaussian Distribution

作　　者：陈长倩 慕晓冬 牛犇 王立志 CHEN Changqian;MU Xiaodong;NIU Ben;WANG Lizhi(College of War Support,Rocket Force University of Engineering,Xi’an 710025,China)

机构地区：[1]火箭军工程大学作战保障学院

出　　处：《计算机工程与应用》2019年第13期145-150,共6页Computer Engineering and Applications

摘　　要：针对灰狼优化算法(GWO)解决离散问题应用较少,发展不成熟的现状,提出一种用于解决二进制问题的离散灰狼优化算法(BGWO)。针对混沌搜索在解决二进制问题时,产生的初始种群较为集中的问题,引入高斯分布曲线对种群初始化,使初始种群地空间分布更加均匀;提出一种转换函数,对GWO进行二进制化处理;通过典型测试函数对该算法性能进行验证,实验表明该算法收敛精度明显优于其他算法。将该算法用于实际背包问题的求解,结论表明该算法迭代次数更少,求解精度更高。In order to solve the problem that the Gray Wolf Optimization(GWO)algorithm is less utilized and developes immature on discrete issues, a Binary Gary Wolf Optimization(BGWO)algorithm is proposed. Firstly, aiming at the problem of chaos search that the initial population is more concentrated in solving binary problems, the Gaussian distribution curve is introduced, which makes the spatial distribution of initial population more uniform. Secondly, a transfer function is proposed to binarize the GWO. Then the performance of the algorithm is tested by the typical test function. The simulation results show that the proposed BGWO algorithm has better performance in precision. Finally, the BGWO is used to solve the knapsack problem. The conclusion shows that the BGWO has fewer iterations and higher solution accuracy.

关 键 词：二进制灰狼优化(BGWO) 高斯分布 背包问题 最优化选择 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]