Enhanced simulated annealing for globally minimizing functions of many-continuous variables

A new global optimization algorithm for functions of many continuous variables is presented, derived from the basic Simulated annealing method. Our main contribution lies in dealing with high-dimensionality minimization problems, which are often difficult to solve by all known minimization methods with or without gradient. In this article we take a special interest in the variables discretization issue. We also develop and implement several complementary stopping criteria. The original Metropolis iterative random search, which takes place in a Euclidean space Rn, is replaced by another similar exploration, performed within a succession of Euclidean spaces Rp, with p <<n. This Enhanced Simulated Annealing (ESA) algorithm was validated first on classical highly multimodal functions of 2 to 100 variables. We obtained significant reductions in the number of function evaluations compared to six other global optimization algorithms, selected according to previously published computational results for the same set of test functions. In most cases, ESA was able to closely approximate known global optima. The reduced ESA computational cost helped us to refine further the obtained global results, through the use of some local search. We have used this new minimizing procedure to solve complex circuit design problems, for which the objective function evaluation can be exceedingly costly.

[1]  A. C. Tsoi,et al.  Improved Simulated Annealing Technique , 1988, Proceedings of the 1988 IEEE International Conference on Systems, Man, and Cybernetics.

[2]  Steven G. Louie,et al.  A Monte carlo simulated annealing approach to optimization over continuous variables , 1984 .

[3]  Patrick Siarry,et al.  Thermodynamic Optimization of Block Placement , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[4]  Robert Hooke,et al.  `` Direct Search'' Solution of Numerical and Statistical Problems , 1961, JACM.

[5]  Klaus Schittkowski,et al.  Test examples for nonlinear programming codes , 1980 .

[6]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[7]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[8]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[9]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[10]  Hugo De Man,et al.  SAMURAI: A general and efficient simulated-annealing schedule with fully adaptive annealing parameters , 1988, Integr..

[11]  F. Glover HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS , 1977 .

[12]  Sandro Ridella,et al.  Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithmCorrigenda for this article is available here , 1987, TOMS.

[13]  John A. Nelder,et al.  A Simplex Method for Function Minimization , 1965, Comput. J..

[14]  Wlodzimierz M. Zuberek,et al.  Integrated circuit performance optimization with simulated annealing algorithm and SPICE-PAC circuit simulator , 1990, [Proceedings] EURO ASIC `90.

[15]  V. Cerný Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm , 1985 .

[16]  Emile H. L. Aarts,et al.  Simulated Annealing: Theory and Applications , 1987, Mathematics and Its Applications.

[17]  Patrick Siarry,et al.  Learning of neural networks approximating continuous functions through circuit simulator SPICE-PAC driven by simulated annealing , 1994 .

[18]  H. Zimmermann Towards global optimization 2: L.C.W. DIXON and G.P. SZEGÖ (eds.) North-Holland, Amsterdam, 1978, viii + 364 pages, US $ 44.50, Dfl. 100,-. , 1979 .

[19]  C. M. Reeves,et al.  Function minimization by conjugate gradients , 1964, Comput. J..

[20]  G. T. Timmer,et al.  Stochastic global optimization methods part II: Multi level methods , 1987, Math. Program..

[21]  Klaus Schittkowski,et al.  More test examples for nonlinear programming codes , 1981 .

[22]  Edward E. Slaminka,et al.  An evaluating of the Sniffer global optimization algorithm using standard test functions , 1992 .

[23]  Roger Fletcher,et al.  A Rapidly Convergent Descent Method for Minimization , 1963, Comput. J..

[24]  Alexander H. G. Rinnooy Kan,et al.  Stochastic methods for global optimization , 1984 .