GLOBAL OPTIMIZATION STUDIES ON THE ID PHASE PROBLEM
Martin Zwick, Byrne Lovell, J. S. Marsh · International Journal of General Systems · 1996
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 diose 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.