Abstract
The properties of a parameterized form of generalized simulated annealing for function minimization are investigated by studying the properties of repeated minimizations from random starting points. This leads to the comparison of distributions of function values and of numbers of function evaluations. Parameter values which yield searches repeatedly terminating close to the global minimum may require unacceptably many function evaluations. If computational resources are a constraint, the total number of function evaluations may be limited. A sensible strategy is then to restart at a random point any search which terminates, until the total allowable number of function evaluations has been exhausted. The response is now the minimum of the function values obtained. This strategy yields a surprisingly stable solution for the parameter values of the simulated annealing algorithm. The algorithm can be further improved by segmentation in which each search is limited to a maximum number of evaluations, perhaps no more than a fifth of the total available. The main tool for interpreting the distributions of function values is the boxplot. The application is to the optimum design of experiments.
Similar content being viewed by others
References
Atkinson, A. C. (1969) Constrained maximisation and the design of experiments.Technometrics,11, 616–618.
Atkinson, A. C. and Donev, A. N. (1992)Optimum Experimental Designs, Clarendon Press, Oxford.
Bohachevsky, I. O., Johnson, M. E. and Stein, M. L. (1986) Generalized simulated annealing for function optimization.Technometrics,28, 209–217.
Corana, A., Marchesi, M., Martini, C. and Ridella, S. (1987) Minimizing multimodal functions of continuous variables with the ‘simulated annealing’ algorithm.ACM Transactions on Mathematical Software,13, 272–280.
Davis, L. (ed.) (1991)Handbook of Genetic Algorithms, van Nostrand Reinhold, New York.
Fedorov, V. V. (1972)Theory of Optimal Experiments, Academic Press, New York.
Glover, F. (1989) Tabu search, part I.ORSA Journal on Computing,1, 190–206.
Haines, L. M. (1987) The application of the annealing algorithm to the construction of exact optimal designs for linear-regression models.Technometrics,29, 439–447.
Johnson, D. S., Aragon, C. R., McGeoch, L. A. and Schevon, C. (1989) Optimization by simulated annealing: an experimental evaluation; part 1, graph partitioning.Operations Research,37, 865–892.
Kirkpatrick, S., Gelatt, C. D. and Vecchi, M. P. (1983) Optimization by simulated annealing.Science,220, 671–680.
Kjærulff, U. (1992) Optimal decomposition of probabilistic networks by simulated annealing.Statistics and Computing,2, 7–17.
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H. and Teller, E. (1953) Equation of state calculations using fast computing machines.Journal of Chemical Physics,21, 1087–1092.
Meyer, R. K. and Nachtsheim, C. J. (1988) Constructing exactD-optimal experimental designs by simulated annealing.American Journal of Mathematical and Management Sciences,8, 329–359.
Silvey, S. D. (1980)Optimal Design, Chapman and Hall, London.
Woodruff, D. L. and Rocke, D. M. (1992) Computation of minimum volume ellipsoid estimates using heuristic search. Technical report, Graduate School of Management, University of California, Davis.
Zhigljavsky, A. A. (1991)Theory of Global Random Search, Kluwer, Dordrecht.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Atkinson, A.C. A segmented algorithm for simulated annealing. Stat Comput 2, 221–230 (1992). https://doi.org/10.1007/BF01889682
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF01889682