Published In
International Journal of General Systems
Document Type
Post-Print
Publication Date
1996
Subjects
Biological macromolecules, Macromolecular structure
Abstract
The Genetic Algorithm (GA) and Simulated Annealing (SA), two techniques for global optimization, were applied to a reduced (simplified) form of the phase problem (RPP) in computational crystallography. Results were compared with those of "enhanced pair flipping" (EPF), a more elaborate problem-specific algorithm incorporating local and global searches. Not surprisingly, EPF did better than the GA or SA approaches, but the existence of GA and SA techniques more advanced than those used in this study suggest that these techniques still hold promise for phase problem applications. The RPP is, furthermore, an excellent test problem for such global optimization methods.
Locate the Document
DOI
10.1080/03081079608945134
Persistent Identifier
https://archives.pdx.edu/ds/psu/27745
Citation Details
Published as: Zwick, M., Lovell, B., and Marsh, J. (1996) Global Optimization Studies on the 1D Phase Problem, International Journal of General Systems, 25:1, 47-59.
Description
Copyright 1996 OPA (Overseas Publishers Association) Amsterdam B. V.
This is the author’s version of a work that was accepted for publication in Int. J. of General Systems. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Int. J. of General Systems, 25, #1, pp.47-59.