求解全局优化问题的一个新的填充函数算法  

A new filled function method for global optimization

作　　者：刘海燕 拓守恒 LIU Haiyan;TUO Shouheng(School of Computer Science and Technology,Xian University of Posts and Telecommunications,Xian 710121,Shaanxi,China)

机构地区：[1]西安邮电大学计算机学院,陕西西安710121

出　　处：《山东大学学报（理学版）》2023年第7期80-87,共8页Journal of Shandong University(Natural Science)

基　　金：国家自然科学基金资助项目(62002289)。

摘　　要：构造了一个新的单参数且连续可微的填充函数,并将其与进化算法相结合提出了一个新的填充函数算法。该算法通过不断跳出局部最优解进入更优解所在区域的方式来提高优化效率,通过设置进化算法中种群均匀分布、增加种群多样性的方式增加了算法的全局寻优性能,并将该算法在标准测试集上进行了测试。结果表明,该算法简单有效,并且随着优化问题维度的提高而表现稳定。A new hybrid single-parameter filled function is proposed which is also continuous and differentiable.Combined with an evolutionary algorithm,a new filled function algorithm is proposed.The new filled function algorithm can improve the efficiency of the optimization by repeatedly escaping from current local optimum to better areas with better solutions.To enhance the explore ability of the proposed algorithm,we use uniform distribution to make better population diversity.Numerical experiments show the simplicity and efficiency of the proposed algorithm.

关 键 词：填充函数 全局优化 局部搜索 进化算法 多峰函数 

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