Generalized Simulated Annealing for Function Optimization
I.O. Bohachevsky, Mark E. Johnson, Myron L. Stein · Technometrics · 1986
A generalized simulated annealing method has been developed and applied to the optimization of functions (possibly constrained) having many local extrema. The method is illustrated in some difftcult pedagogical examples and used to solve a problem analyzed by Bates (Technometrics, 25, pp. 373–376, 1983) for which we identify an improved optimum. The sensitivity of the solution to changes in the constraints and in other specifications of the problem is analyzed and discussed.
Cited by 573 works. doi:10.1080/00401706.1986.10488128
Authors
References
- Optimization by Simulated Annealing
- Statistics for Experimenters
- Optimal Accelerated Life Designs for Estimation
- DESIGN OF EXPERIMENTS IN NON-LINEAR SITUATIONS
- The N -City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
- A controlled random search procedure for global optimisation
- The Tunneling Algorithm for the Global Minimization of Functions
- The Nelder-Mead Simplex Procedure for Function Minimization
- A Stochastic Approach to Global Optimization
- Applications of the Annealing Algorithm to Combinatorial Problems in Statistics