Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences

1996

Air Force Institute of Technology

Genetic algorithms

Articles 1 - 2 of 2

Full-Text Articles in Physical Sciences and Mathematics

Analysis Of Linkage-Friendly Genetic Algorithms, Laurence D. Merkle Dec 1996

Analysis Of Linkage-Friendly Genetic Algorithms, Laurence D. Merkle

Theses and Dissertations

Evolutionary algorithms (EAs) are stochastic population-based algorithms inspired by the natural processes of selection, mutation, and recombination. EAs are often employed as optimum seeking techniques. A formal framework for EAs is proposed, in which evolutionary operators are viewed as mappings from parameter spaces to spaces of random functions. Formal definitions within this framework capture the distinguishing characteristics of the classes of recombination, mutation, and selection operators. EAs which use strictly invariant selection operators and order invariant representation schemes comprise the class of linkage-friendly genetic algorithms (lfGAs). Fast messy genetic algorithms (fmGAs) are lfGAs which use binary tournament selection (BTS) with …


Refined Genetic Algorithms For Polypeptide Structure Prediction, Charles E. Kaiser Jr. Dec 1996

Refined Genetic Algorithms For Polypeptide Structure Prediction, Charles E. Kaiser Jr.

Theses and Dissertations

Accurate and reliable prediction of macromolecular structures has eluded researchers for nearly 40 years. Prediction via energy minimization assumes the native conformation has the globally minimal energy potential. An exhaustive search is impossible since for molecules of normal size, the size of the search space exceeds the size of the universe. Domain knowledge sources, such as the Brookhaven PDB can be mined for constraints to limit the search space. Genetic algorithms (GAs) are stochastic, population based, search algorithms of polynomial (P) time complexity that can produce semi-optimal solutions for problems of nondeterministic polynomial (NP) time complexity such as PSP. Three …