The genetic simulated annealing algorithm is suitable for optimization problems in complex multidimensional space because of its strong global search capability and the fact that it does not easily fall into local optimal solutions. The simulation results show that the genetic simulated annealing algorithm can effectively improve the pattern optimization performance and reduce the computing time compared with the standard genetic algorithm.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.