Skip to main content
×
Home
    • Aa
    • Aa

Simulated Annealing and Adaptive Search in Global Optimization

  • H. Edwin Romeijn (a1) and Robert L. Smith (a2)
Abstract

Simulated annealing is a class of sequential search techniques for solving continuous global optimization problems. In this paper we attempt to help explain the success of simulated annealing for this class of problems by studying an idealized version of this algorithm, which we call adaptive search. The prototypical adaptive search algorithm generates a sequence of improving points drawn conditionally from samples from a corresponding sequence of probability distributions. Under the condition that the sequence of distributions stochastically dominate in objective function value the uniform distribution, we show that the expected number of improving points required to achieve the global optimum within a prespecified error grows at most linearly in the dimension of the problem for a large class of global optimization problems. Moreover, we derive a cooling schedule for simulated annealing, which follows in a natural way from the definition of the adaptive search algorithm.

Copyright
Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

2.E.H.L. Aarts & P.J.M. van Laarhoven (1989). Simulated annealing: An introduction. Statistica Neerlandica 43: 3152.

3.C.J.P. Bélisle (1992). Convergence theorems for a class of simulated annealing algorithms on . Journal of Applied Probability 29(4): 885895.

4.I.O. Bohachevsky , M.E. Johnson , & M.L. Stein (1986). Generalized simulated annealing for function optimization. Technometrics 28: 209217.

5.A. Corana , M. Marchesi , C. Martini , & S. Ridella (1987). Minimizing multimodal functions for continuous variables with the “simulated annealing” algorithm. ACM Transactions on Mathematical Software 13: 262280.

6.A. Dekkers & E. Aarts (1991). Global optimization and simulated annealing. Mathematical Programming 50: 367393.

7.S.B. Gelfand & S.K. Mitter (1993). Metropolis-type annealing algorithms for global optimization in . SIAM Journal on Control and Optimization 31(1): 111131.

9.B. Hajek (1988). Cooling schedules for optimal annealing. Mathematics of Operations Research 13: 311329.

10.P.R. Halmos (1950). Measure theory. New York: Van Nostrand.

12.N. Metropolis , A.W. Rosenbluth , M.N. Rosenbluth , A.M. Teller , & E. Teller (1953). Equations of state calculations by fast computing machines. The Journal of Chemical Physics 21: 10871092.

13.N.R. Patel & R.L. Smith (1983). The asymptotic extreme value distribution of the sample minimum of a concave function under linear constraints. Operations Research 31: 789794.

14.N.R. Patel , R.L. Smith , & Z.B. Zabinsky (1988). Pure adaptive search in Monte Carlo optimization. Mathematical Programming 43: 317328.

15.M. Pincus (1968). A closed form solution for certain programming problems. Operations Research 16: 690694.

16.M. Pincus (1970). A Monte Carlo method for the approximate solution of certain types of constrained optimization problems. Operations Research 18: 12251228.

17.H.E. Romeijn & R.L. Smith (1994). Simulated annealing for constrained global optimization. Journal of Global Optimization 5: 101126.

19.R.Y. Rubinstein (1981). Simulation and the Monte Carlo method. New York: Wiley.

20.Z.B. Zabinsky & R.L. Smith (1992). Pure adaptive search in global optimization. Mathematical Programming 53(3): 323338.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Probability in the Engineering and Informational Sciences
  • ISSN: 0269-9648
  • EISSN: 1469-8951
  • URL: /core/journals/probability-in-the-engineering-and-informational-sciences
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×