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

A GREEDY GENETIC ALGORITHM FORUNCONSTRAINED GLOBAL OPTIMIZATION
作者姓名:ZHAOXinchao
作者单位:KeyLaboratoryofMathematicsMechanization,InstituteofSystemsScience,AMSS,ChineseAcademyofSciences,Beijing100080,China
基金项目:Thisresearchissupportedby2004GraduateStudentsScienceandSocialPracticeStake(InnovationResearch)ofGraduateSchoolofChineseAcademyofSciences.
摘    要:The greedy algorithm is a strong local searching algorithm. The genetic algorithm is generally applied to the global optimization problems. In this paper, we combine the greedy idea and the genetic algorithm to propose the greedy genetic algorithm which incorporates the global exploring ability of the genetic algorithm and the local convergent ability of the greedy algorithm. Experimental results show that greedy genetic algorithm gives much better results than the classical genetic algorithm.

关 键 词:传统遗传算法  贪婪算法  整体最佳化  贪婪遗传算法

A GREEDY GENETIC ALGORITHM FOR UNCONSTRAINED GLOBAL OPTIMIZATION
ZHAOXinchao.A GREEDY GENETIC ALGORITHM FORUNCONSTRAINED GLOBAL OPTIMIZATION[J].Journal of Systems Science and Complexity,2005,18(1):102-110.
Authors:ZHAO Xinchao
Abstract:The greedy algorithm is a strong local searching algorithm. The genetic algorithm is generally applied to the global optimization problems. In this paper, we combine the greedy idea and the genetic algorithm to propose the greedy genetic algorithm which incorporates the global exploring ability of the genetic algorithm and the local convergent ability of the greedy algorithm. Experimental results show that greedy genetic algorithm gives much better results than the classical genetic algorithm.
Keywords:Genetic algorithm  greedy algorithm  greedy genetic algorithm  global optimization  
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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