Computational Experience with Generalized Simulated Annealing Over Continuous Variables
Authors:
- 1 February 1988
- journal article
- research article
- Published by Taylor & Francis in American Journal of Mathematical and Management Sciences
- Vol. 8 (3) , 425-449
Abstract
Stochastic optimization procedures have been shown to be efficient methods for finding global extrema of objective functions. In this article we report computational results obtained using the generalized simulated annealing method on a set of standard global optimization test problems. The results are compared to those obtained using the best known competing stochastic optimization methods.Keywords
This publication has 10 references indexed in Scilit:
- Simulated annealing methods with general acceptance probabilitiesJournal of Applied Probability, 1987
- Stochastic global optimization methods part II: Multi level methodsMathematical Programming, 1987
- Generalized Simulated Annealing for Function OptimizationTechnometrics, 1986
- Convergence of an annealing algorithmMathematical Programming, 1986
- Nonstationary Markov chains and convergence of the annealing algorithmJournal of Statistical Physics, 1985
- A Monte carlo simulated annealing approach to optimization over continuous variablesJournal of Computational Physics, 1984
- The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis AlgorithmSIAM Review, 1984
- Optimization by Simulated AnnealingScience, 1983
- A method of unconstrained global optimizationMathematical Biosciences, 1970
- A Simplex Method for Function MinimizationThe Computer Journal, 1965