ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Crossover gene selection by spatial location
Full text PdfPdf (173 KB)
Source Genetic And Evolutionary Computation Conference archive
Proceedings of the 8th annual conference on Genetic and evolutionary computation table of contents
Seattle, Washington, USA
SESSION: Genetic algorithms: papers table of contents
Pages: 1111 - 1116  
Year of Publication: 2006
ISBN:1-59593-186-4
Authors
David M. Cherba, Dr.  Michigan State University, East Lansing, MI
William Punch, Dr.  Michigan State University, East Lansing, MI
Sponsors
SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 9,   Downloads (12 Months): 35,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1143997.1144175
What is a DOI?

ABSTRACT

Spatial based gene selection for division of chromosomes used by crossover operators is proposed for three-dimensional problems. This spatial selection is shown to preserve more genetic material and reduce the disruptive effects of crossover. The disruptive effects of crossover can be quantified by counting the destruction of subgraphs that represent strong linkages between genes. The spatial operator is compared to simple crossover on a practical class of molecular clustering searches. This comparison shows that the spatial crossover significantly out performs simple crossover. Consistent good performance for spatial crossover is demonstrated on the molecular cluster conformation problem [9].


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
 
2
D. Deaven and K. Ho. Molecular geometry optimization with a genetic algorithm. Phy. Rev. Let., 75:288--291, 1995.
 
3
L. J. Eshelman, K. E. Mathias, and J. D. Schaffer. Crossover operator biases: Exploiting the population distribution. Proc. of the 7th ICGA, pages 354--361, 1997.
 
4
 
5
B. Hartke. Application of Evolutionary Computation in Chemistry, volume 110 of Structure and Bonding, chapter Application of Evolutionary Algorithms to global cluster geometry optimization, pages 33--53. Springer, Heidelberg, 2004.
 
6
F. Herrera, M. Lozano, and A. Sånchez. A taxonomy for the crossover operator for real-coded genetic algorithms. an experimental study. International Journal of Intelligent Systems, 18(3):309--338, 2003.
 
7
 
8
I. Hong, A. B. Kahng, and B. R. Moon. Exploiting synergies of multiple crossovers: initial studies. IEEE International Conference on Evolutionary Computation, 1(29):245--250, Nov. Dec. 1995.
 
9
P. Juhas, D. M. Cherba, P. M. Duxbury, W. F. Punch, and S. J. L. Billinge. Ab initio solid state nano-structure determination. Nature, pages 655--658, March 2006.
 
10
 
11
Z. Michalewicz, G. Nazhiyath, and M. Michalewicz. A note on usefulness of geometrical crossover for numerical optimization problems. Evolutionary Programming, pages 305--312, 1996.
 
12
D.-i. Seo and B. R. Moon. A survey on chromosomal structures and operators for exploiting topological linkages of genes. In GECCO, pages 1357--1368, 2003.
 
13
W. M. Spears and K. A. De Jong. An analysis of multi-point crossover. In G. J. E. Rawlins, editor, Foundations of Genetic Algorithms, pages 301--315, San Mateo, CA, 1991. Morgan Kaufmann.
 
14
H.-S. Yoon and B.-R. Moon. Synergy of multiple crossovers in a genetic algorithm. IEEE Transactions on Evolutionary Computation, 6(2):212 -- 223, April 2002.

Collaborative Colleagues:
David M. Cherba, Dr.: colleagues
William Punch, Dr.: colleagues