The effect of population structure on the rate of convergence of genetic algorithms
Pages 147 - 151
References
[1]
Bollobas, B. and Thomason, A., Random graphs of small order, Ann. Discrete Math. 28, p. 47-97, 1985.
[2]
Booker, L., Genetic algorithms and simulated annealing, Ch. 5, p. 61-73, Research notes in AI, Morgan Kaufmann, 1987.
[3]
Cohoon, J. P., Martin, W. N., and Richards, D. S., A multipopulation genetic algorithm for solving the K- partition problem on hyper-cubes, Proc. of the Fourth lnt'l.Conf, on Genetic Algorithms, p. 244- 248, Morgan Kaufmann, 1991.
[4]
Collins, R. and Jefferson, D. R., Selection in massively parallel genetic algorithms, Proc. of the Fourth Int'l. Conf. on Genetic Algorithms, p. 249-256, Morgan Kaufmann, 1991.
[5]
Davidor, Y., A naturally occuring niche & species phenomenon: the model and first results, Proc. of the Fourth Int'l Conf. on Genetic Algorithms, p. 257-263, Morgan Kaufmann, 1991.
[6]
Falconer, D. S., Introduction to quantitative genetics, Longman, 1983.
[7]
Forrest, S., and Mitchell, M., The performance of genetic algorithms on Walsh Ploynomials: some anomalous results and their explanation, Proc. of the Fourth Int'l. Conf. on Genetic Algorithms, p. 182-189, Morgan Kaufmann, 1991.
[8]
Garey, M. R. and Johnson, D. S., Computer and intractability' a guide to the theory of NP- completeness, W. H. Freeman, 1979.
[9]
Groges-Scleuter, M., ASPARAGOS an asynchronous parallel genetic optimization strategy, Proc. of the Third Int'l. Conf. on Genetic Algorithms, p. 422- 427,Morgan Kaufmann, 1989.
[10]
Hartl, D. L., Principles of population genetics, Sinauer Asso., 1980.
[11]
Holland, J. H., Adaptation in natural and artificial systems, Ann Arbor, The Univ. of Michigan Press, 1975.
[12]
Lin, S., and Kernighan, B. W., An effective heuristic algorithm for the traveling salesman problem, Oper. Res., vol. 21, p. 498-516, 1973.
[13]
Manderick, B. and Spiessens, P., Fined-grained parallel genetic algorithms, Proc. of the Third lnt'l Conf.on Genetic Algorithms, p. 428-433, Morgan Kaufmann, 1989.
[14]
Muhlenbein, H., Parallel genetic algorithms, population genetics, and combinatorial optimization, Proc. of the Third Int'l Conf. on Genetic Algorithms,p. 416- 421, Morgan Kaufmann, 1989.
[15]
Muhlenbein, H., Schomisch, M., and Born, J., The parallel genetic algorithm as function optimizer, Proc. of the Fourth Int'l Conf. on Genetic Algorithms, p. 271-278, Morgan Kaufmann, 1991,
[16]
Oliver, I., Smith, D., and Holland, J. R., A study of permutation crossover operators on the travelling salesman problem,Proc, of the Second lnt'l Conf. on Genetic Algorithms, p. 224-230, Morgan Kaufmann, 1987.
[17]
Papadimitriou, C. H., and Steiglitz, K., Some examples of difficult traveling salesman problem, Operations Research, vol. 6, No. 3, p. 434-443, 1978.
[18]
SAS Institute, User's guide, ver. 5, Ed. SAS Institute Inc., 1985.
[19]
Spiessens, P., and Manderick, B., A massively Parallel genetic algorithm: implementation and first analysis, Proc. of the fourth Int'l Conf. on Genetic Algorithms, p. 279-285, Morgan Kaufmann, 1991.
[20]
Tanese, R., Distributed genetic algorithms, Proc. of the third Int'l Conf. on Genetic Algorithms, p. 434439, Morgan Kaufmann, 1989.
[21]
Whitley, D., Starkweather, T., and Fuquay, D., Scheduling problems and traveling salesmen: the genetic edge recombination operator, Proc. of the Third Int'l Conf. on Genetic Algorithms, p. 133-140, Morgan Kaufmann, 1989.
[22]
Wright, S., Evolution and the genetics of populations, vol. 3, Univ. of Chicago Press, 1977.
Index Terms
- The effect of population structure on the rate of convergence of genetic algorithms
Recommendations
A dual-population genetic algorithm for adaptive diversity control
A variety of previous works exist on maintaining population diversity of genetic algorithms (GAs). Dual-population GA (DPGA) is a type of multipopulation GA (MPGA) that uses an additional population as a reservoir of diversity. The main population is ...
Structured population genetic algorithms: a literature survey
The Genetic Algorithm (GA) has been one of the most studied topics in evolutionary algorithm literature. Mimicking natural processes of inheritance, mutation, natural selection and genetic operators, GAs have been successful in solving various ...
Population structure and artificial evolution
EA'05: Proceedings of the 7th international conference on Artificial EvolutionWe investigate the effect that population structure has upon the course of artificial evolution. We represent an arbitrary population structure by embedding a population of individuals in a graph. Each individual resides at a vertex of the graph and can ...
Comments
Information & Contributors
Information
Published In
March 1993
804 pages
Copyright © 1993 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 March 1993
Check for updates
Author Tags
Qualifiers
- Article
Conference
SAC93
Sponsor:
Acceptance Rates
Overall Acceptance Rate 1,650 of 6,669 submissions, 25%
Upcoming Conference
SAC '25
- Sponsor:
- sigapp
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 739Total Downloads
- Downloads (Last 12 months)34
- Downloads (Last 6 weeks)8
Reflects downloads up to 11 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in