求解一类无约束优化的混合遗传算法

A hybrid genetic algorithm to seeking the optimum solution of a class of unconstrained optimization

目的求解一类无约束优化问题。方法结合传统优化算法局部寻优能力强、收敛速度快,而遗传算法在搜索过程中不易陷入局部最优的两种算法的特点,给出了一种基于最速下降法的混合遗传算法。结果算例表明所设计的算法是有效的。结论算法可以提高局部搜索能力,提高解的精确度,搜索速度。

Aim In order to seek the optimum solution of a class of unconstrained optimization.Methods On the basis of the properties of classical optimization, which always converges quickly and has the ability of locally searching, and the properties of genetic algorithm, which is not easily to immerse the region of local optimum solution, a hybrid genetic algorithm is put forward based on steepest descent method.Results Examples show that the method works well.Conclusion The algorithm can improve the ability of locally searching,the accuracy of solution and the degree of seeking.