{"title":"A new hybrid genetic algorithm based on clan competition","authors":"Weihong Zhou, Shun-Qing Xiong, L. Ying","doi":"10.1109/YCICT.2010.5713153","DOIUrl":null,"url":null,"abstract":"It is difficult for basic genetic algorithm and evolutionary programming algorithm to converge at global optimal solution of real-continual function in practice, although both of the algorithms have the ability for getting the global optimal solution with convergent probabilities 1 in theory. In this paper, a new hybrid genetic algorithm based on clan competition is proposed, and it is proved that the probability of the new algorithm convegent to the global optimal solution is 1, Numerical experiments results illustrate that, compared with the former two algorithms, the new algorithm is the robustest among the three algorithms, what's more, it has the highest precision with the equal parameters.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/YCICT.2010.5713153","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
It is difficult for basic genetic algorithm and evolutionary programming algorithm to converge at global optimal solution of real-continual function in practice, although both of the algorithms have the ability for getting the global optimal solution with convergent probabilities 1 in theory. In this paper, a new hybrid genetic algorithm based on clan competition is proposed, and it is proved that the probability of the new algorithm convegent to the global optimal solution is 1, Numerical experiments results illustrate that, compared with the former two algorithms, the new algorithm is the robustest among the three algorithms, what's more, it has the highest precision with the equal parameters.