基于最速方向搜索的混合遗传算法  

A Hybrid Genetic Algorithm Based on the Search Algorithm of the Steepest Direction

作　　者：涂井先[1] 刘伟[1] 

机构地区：[1]广东工业大学应用数学学院,广东广州510006

出　　处：《广东工业大学学报》2011年第4期34-37,共4页Journal of Guangdong University of Technology

摘　　要：针对目标函数复杂求导困难或目标函数不可导的优化问题,给出了最速方向搜索方法,它在搜索过程不需要导数信息,克服了一些局部搜索算法需要求出导数的缺点.在此基础上提出了基于最速方向搜索的混合遗传算法,将最速方向搜索算法与遗传算法有效结合,增强了遗传算法的搜索能力.数值实验证明,改进后的遗传算法性能优于当前一些较好的优化算法.The search algorithm of the steepest direction is proposed to solve the optimization problem that the objective function is complex and the derivative is hard or impossible to obtain, The algorithm doesn＇ t need to obtain the derivative in its searching process, overcoming the weakness of needing to acquire the derivative during their searching process, which some other local search algorithms have. A hybrid genetic algorithm, based on the search algorithm of the steepest direction, is proposed. The algorithm combines the search algorithm of the steepest direction with the genetic algorithm effectively, enhancing the searching ability of the genetic algorithm. The experimental results show that the improved genetic algorithm is more effective than some current optimization algorithms.

关 键 词：遗传算法 最速方向 局部搜索 适应值共享 

分 类 号：TP183[自动化与计算机技术—控制理论与控制工程]