Abstract
Genetic Algorithms (GAs) are efficient non-gradient stochastic search methods and Parallel GAs (PGAs) are proposed to overcome the deficiencies of the sequential GAs, such as low speed, aptness to local convergence, etc. However, the tremendous increase in the communication costs accompanied with the parallelization stunts the further improvements of PGAs. This letter takes the decrease of the communication costs as the key to this problem and advances a new Migration Scheme based on Schema Theorem (MSST). MSST distills schemata from the populations and then proportionately disseminates them to other populations, which decreases the total communication cost among the populations and arms the multiple-population model with higher speed and better scalability.
This is a preview of subscription content, log in via an institution to check access.
References
J. H. Holland, Adaptation in Natural and Artificial Systems, Ann Arbor, MI, The University of Michigan Press, 1975, 228–234.
S.-C. Lin, W. Punch, E. Goodman, Coarse-grain parallel genetic algorithms: Categorization and New Approach, In Sixth IEEE Symposium on Parallel and Distributed Processing, Los Alamitos, CA, IEEE Computer Society Press, 1994, 28–37.
V. S. Gordon, D. Whitley, Serial and parallel genetic algorithms as function optimizers, In S. FORREST, Ed. Proceedings of the Fifth International Conference on Genetic Algorithms, San Mateo, CA, Morgan Kaufmann, 1993, 177–183.
P. Adamidis, Review of parallel genetic algorithms bibliography, Tech. Rep, version 1, Thessaloniki, Greece, Aristotle University of Thessaloniki, 1994, (available via anonymous ftp site elecserv.eng.auth.grdirectory/pub/pga review.ps.Z) ga94aAdamidis.
S. Cohoon, J. Hedge, S. Martin, D. Richards, Punctuated equilibria: A parallel genetic algorithm, IEEE Trans. on CAD, 10(1991)4, 483–491.
E. Cantu-Paz, M. Mejia-Olvera, Experimental results in distributed genetic algorithms, In International Symposium on Applied Corporate Computing, Monterrey, Mexico, 1994, 99–108.
Z. Michalewicz, Genetic Algorithms + Data Structure = Evolution Programs, Third, Revised and Extend Edition, Berlin, Springer-Verlag, 1996, C2:34-C2:35.
M. Nowostawski, R. Poli, Parallel genetic algorithm taxonomy, In L. C. Jain, Ed. Proceedings of the Third International Conference on Knowledge-based Intelligent Information Engineering Systems (KES’99), IEEE., Adelaide, 1999, 88–92.
E. Cantu-Paz, A survey of parallel genetic algorithms, Calculateurs Paralleles, 10(1998)2, 141–171.
Author information
Authors and Affiliations
Additional information
Supported in part by the National Natural Science Foundation of China(No.60073012), National Science Foundation of Jiangsu, China(BK2001004), Visiting Scholar Foundation of Key Lab. in the University
About this article
Cite this article
Guan, Y., Xu, B. & Zhou, Y. The migration scheme based on schema theorem of PGAs. J. of Electron.(China) 19, 315–319 (2002). https://doi.org/10.1007/s11767-002-0058-3
Issue Date:
DOI: https://doi.org/10.1007/s11767-002-0058-3