首页 | 本学科首页   官方微博 | 高级检索  
     检索      

求解一类无约束优化的混合遗传算法
引用本文:张晓伟,邢志栋,董建民.求解一类无约束优化的混合遗传算法[J].西北大学学报,2005,35(2):130-132.
作者姓名:张晓伟  邢志栋  董建民
作者单位:西北大学数学系,陕西西安710069
基金项目:陕西省教育厅专项科研基金资助项目(01JK057)
摘    要:目的 求解一类无约束优化问题。方法 结合传统优化算法局部寻优能力强、收敛速度快,而遗传算法在搜索过程中不易陷入局部最优的两种算法的特点,给出了一种基于最速下降法的混合遗传算法。结果 算例表明所设计的算法是有效的。结论 算法可以提高局部搜索能力,提高解的精确度,搜索速度。

关 键 词:遗传算法  最速下降法  混合遗传算法  无约束优化
文章编号:1000-274X(2005)02-0130-03
修稿时间:2004年1月8日

A hybrid genetic algorithm to seeking the optimum solution of a class of unconstrained optimization
ZHANG Xiao-wei,XING Zhi-dong,DONG Jian-min.A hybrid genetic algorithm to seeking the optimum solution of a class of unconstrained optimization[J].Journal of Northwest University(Natural Science Edition),2005,35(2):130-132.
Authors:ZHANG Xiao-wei  XING Zhi-dong  DONG Jian-min
Abstract: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.
Keywords:genetic algorithm  steepest descent method  hybrid genetic algorithm  unconstrained optimization
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号