Version 3.2 of Fortran Code for Simulated Annealing (a global optimization algorithm also useful as a local optimizer for difficult problems)
This implementation of simulated annealing was used in "Global Optimization of Statistical Functions with Simulated Annealing," Goffe, Ferrier and Rogers, Journal of Econometrics, vol. 60, no. 1/2, Jan./Feb. 1994, pp. 65-99. Simulated annealing is a global optimization method that distinguishes between different local optima. Starting from an initial point, the algorithm takes a step and the function is evaluated. When minimizing a function, any downhill step is accepted and the process repeats from this new point. An uphill step may be accepted. Thus, it can escape from local optima. This uphill decision is made by the Metropolis criteria. As the optimization process proceeds, the length of the steps decline and the algorithm closes in on the global optimum. Since the algorithm makes very few assumptions regarding the function to be optimized, it is quite robust with respect to non-quadratic surfaces. The degree of robustness can be adjusted by the user. In fact, simulated annealing can be used as a local optimizer for difficult functions. Briefly, we found it generally superior to multiple restarts of conventional optimization routines for difficult optimization problems. This code contains an example function and is ready to run. It is also heavily documented with numerous usage hints.
|Date of creation:||29 Jun 1994|
|Date of revision:|
|Note:||990 lines of Fortran 77 code in ASCII|
|Contact details of provider:|| Web page: http://22.214.171.124|
When requesting a correction, please mention this item's handle: RePEc:wpa:wuwppr:9406001. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (EconWPA)
If references are entirely missing, you can add them using this form.