Title

Global Optimization Studies on the 1-D Phase Problem

Published In

International Journal of General Systems

Document Type

Citation

Publication Date

1996

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.

Description

Copyright 1996 OPA (Overseas Publishers Association) Amsterdam B. V.

DOI

10.1080/03081079608945134

Persistent Identifier

https://archives.pdx.edu/ds/psu/27745

Share

COinS