Abstract
Kalivas, J.H., 1992. Optimization using variations of simulated annealing. Chemometrics and Intelligent Laboratory Systems, 15: 1–12. Simulated annealing (SA) was originally developed for determining global optima for combinatorial optimization problems, but it has been shown to be amenable to continuous functions as well. Difficulties in SA arise when determining proper operating cooling schedule variables for particular optimization problems. Generalized simulated annealing (GSA) reduces many of these complications. However, GSA usually locates near-global optima and not exact optima. If GSA is set up interactively, convergence to the exact global optimum becomes achievable. In order to attain automatic convergence to the exact global optimum, the variable step size generalized simulated annealing (VSGSA) algorithm tunes its operation variables based on data collected during optimization. This tutorial describes the basic operating principles for SA, GSA, and VSGSA, and incorporates worked examples from the literature.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
