{"title":"Knowledge Migration Based Multi-population Cultural Algorithm","authors":"Yi-nan Guo, Yuan-yuan Cao, Yong Lin, Hui Wang","doi":"10.1109/ICNC.2009.597","DOIUrl":null,"url":null,"abstract":"In existing multi-population cultural algorithms, information are exchanged among sub-populations by individuals, which limits the evolution performance. So a novel multi-population cultural algorithm adopting knowledge migration is proposed. Implicit knowledge extracted from each sub-population reflects the information about dominant search space. By migrating the knowledge among sub-populations at the constant interval, the algorithm realizes more effective interaction with less communication cost. Taken benchmark functions as the examples, simulation results indicate that the algorithm can effectively improve the speed of convergence and overcome premature convergence.","PeriodicalId":235382,"journal":{"name":"2009 Fifth International Conference on Natural Computation","volume":"72 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Fifth International Conference on Natural Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNC.2009.597","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8
Abstract
In existing multi-population cultural algorithms, information are exchanged among sub-populations by individuals, which limits the evolution performance. So a novel multi-population cultural algorithm adopting knowledge migration is proposed. Implicit knowledge extracted from each sub-population reflects the information about dominant search space. By migrating the knowledge among sub-populations at the constant interval, the algorithm realizes more effective interaction with less communication cost. Taken benchmark functions as the examples, simulation results indicate that the algorithm can effectively improve the speed of convergence and overcome premature convergence.