一种基于混沌搜索和贪婪模式的混合优化算法  

A Hybrid Optimization Algorithm Based on Chaotic Search and Greedy Search

作　　者：夏桂梅 赵晋彬 XIA Gui-Mei;ZHAO Jin-bin(School of Applied Science,Taiyuan University of Science and Technology,Taiyuan 030024,China)

机构地区：[1]太原科技大学应用科学学院,太原030024

出　　处：《太原科技大学学报》2020年第2期154-157,164,共5页Journal of Taiyuan University of Science and Technology

摘　　要：混沌搜索算法具有搜索能力快,遍历性高的特点。在此基础上,引入MIMIC算法中的贪婪模式算法,目的是搜索一个变量的最优排列,使被选择的优良解集的概率分布与定义的概率分布最接近,从而得到最优解,进而加强了混沌搜索算法的局部搜索的能力。将算法应用于无约束优化问题,数值实验证明,该算法快捷高效,是一种有效的优化算法。The chaotic search algorithm has the characteristics of fast search and high ergodicity. On this basis,the greedy mode algorithm in MIMIC algorithm is introduced to search for the optimal arrangement of a variable so that the probability distribution of the selected optimal solution set is the closest to the defined probability distribution,and the optimal solution can be obtained,thus enhancing the local search ability of the chaotic search algorithm.The algorithm is applied to unconstrained optimization problems. Numerical experiments show that the algorithm is fast and efficient,and is an effective optimization algorithm.

关 键 词：混沌搜索算法 贪婪模式算法 无约束优化问题 

分 类 号：O221[理学—运筹学与控制论]