Chaotic populations in genetic algorithms
Ma ZS
刊名APPLIED SOFT COMPUTING
2012
卷号12期号:8页码:2409-2424
关键词Genetic algorithm Chaos theory Logistic Chaos map Dynamic populations Fitness aggregation Power Law
通讯作者ma@vandals.uidaho.edu
合作状况其它
英文摘要We set two objectives for this study: one is to emulate chaotic natural populations in GA (Genetic Algorithms) populations by utilizing the Logistic Chaos map model, and the other is to analyze the population fitness distribution by utilizing insect spatial distribution theory. Natural populations are so dynamic that one of the first experimental evidences of Chaos in nature was discovered by a theoretical ecologist, May (1976, Nature, 261,459-467)[30], in his analysis of insect population dynamics. In evolutionary computing, perhaps influenced by the stable or infinite population concepts in population genetics, the status quo of population settings has dominantly been the fixed-size populations. In this paper, we propose to introduce dynamic populations controlled by the Logistic Chaos map model to Genetic Algorithms (GA), and test the hypothesis - whether or not the dynamic populations that emulate chaotic populations in nature will have an advantage over traditional fixed-size populations.

The Logistic Chaos map model, arguably the simplest nonlinear dynamics model, has surprisingly rich dynamic behaviors, ranging from exponential, sigmoid growth, periodic oscillations, and aperiodic oscillations, to complete Chaos. What is even more favorable is that, unlike many other population dynamics models, this model can be expressed as a single parameter recursion equation, which makes it very convenient to control the dynamic behaviors and therefore easy to apply to evolutionary computing. The experiments show result values in terms of the fitness evaluations and memory storage requirements. We further conjecture that Chaos may be helpful in breaking neutral space in the fitness landscape, similar to the argument in ecology that Chaos may help the exploration and/or exploitation of environment heterogeneity and therefore enhance a species' survival or fitness. (C) 2012 Elsevier B. V. All rights reserved.
收录类别SCI
资助信息This research has received funding from the following fund- ing sources: National Science Foundation of China (Grant No: 61175071), “The One Hundred-PI (Principal Investigator) Plan for the Exceptional Talents in Science & Technology” of the Chinese Academy of Sciences, the startup fund from the State Key Labo- ratory of Genetic Resources and Evolution of China, and “Funding for the Top Talents Program in Science and Technology of Yunnan Province.”
语种英语
WOS记录号WOS:000305275800044
公开日期2012-09-07
内容类型期刊论文
源URL[http://159.226.149.42:8088/handle/152453/7047]  
专题昆明动物研究所_计算生物与生物信息学
昆明动物研究所_遗传资源与进化国家重点实验室
作者单位Chinese Acad Sci, Kunming Inst Zool, State Key Lab Genet Resources & Evolut, Computat Biol & Med Ecol Lab, Kunming 650223, Peoples R China
推荐引用方式
GB/T 7714
Ma ZS. Chaotic populations in genetic algorithms[J]. APPLIED SOFT COMPUTING,2012,12(8):2409-2424.
APA Ma ZS.(2012).Chaotic populations in genetic algorithms.APPLIED SOFT COMPUTING,12(8),2409-2424.
MLA Ma ZS."Chaotic populations in genetic algorithms".APPLIED SOFT COMPUTING 12.8(2012):2409-2424.
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。


©版权所有 ©2017 CSpace - Powered by CSpace