ACM Home Page
Please provide us with feedback. Feedback
The effect of population structure on the rate of convergence of genetic algorithms
Full text PdfPdf (503 KB)
Source Symposium on Applied Computing archive
Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice table of contents
Indianapolis, Indiana, United States
Pages: 147 - 151  
Year of Publication: 1993
ISBN:0-89791-567-4
Authors
Sponsor
SIGAPP: ACM Special Interest Group on Applied Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 48,   Citation Count: 0
Additional Information:

references   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/162754.162846
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Bollobas, B. and Thomason, A., Random graphs of small order, Ann. Discrete Math. 28, p. 47-97, 1985.
 
2
 
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
 
9
 
10
Hartl, D. L., Principles of population genetics, Sinauer Asso., 1980.
 
11
 
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
 
14
 
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
 
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
 
21
 
22
Wright, S., Evolution and the genetics of populations, vol. 3, Univ. of Chicago Press, 1977.

Collaborative Colleagues:
Po Hsiang Chu: colleagues
Susan A. Dudley: colleagues

Peer to Peer - Readers of this Article have also read: