Dynamic Distributed Genetic Algorithm with Asymmetric Migration
YI Weilie · Jisuanji gongcheng · 2002
In this paper, a new method to manage the distributed populations in evolution is introduced. A supervising subroutine observes all the subpopulations during evolution. The sizes of these subpopulations are dynamically changed according to their performance. Better subpopulations get more quotas of the total number of individuals, thus get more possibility to produce even better ones. This algorithm is illustrated with an example. Different policies of managing the subpopulations are compared and discussed. The main conclusion is that dynamical rearrangement of the global population can make the process of evolution more quick and stable.