A global optimization method based on simulated annealing and evolutionary strategy

Authors:
DarYun Chiang;JauSung Moh
Affiliations:
Department of Aeronautics and Astronautics, National Cheng Kung University, Tainan, Taiwan, Republic of China;Department of Aeronautics and Astronautics, National Cheng Kung University, Tainan, Taiwan, Republic of China
Venue:
ICIC'06 Proceedings of the 2006 international conference on Intelligent Computing - Volume Part I
Year:
2006

Citing 3
Cited 0

Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing

Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing
Random tunneling by means of acceptance-rejection sampling for global optimization

Journal of Optimization Theory and Applications
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning

Quantified Score

Hi-index	0.00

Visualization

Abstract

A global optimization method is proposed to improve the conventional method of simulated annealing. By introducing the probability distribution function for the objective function and the concept of stable energy for detecting thermal equilibrium during annealing, the selection of initial temperature and equilibrium criterion becomes easy and effective. Furthermore, the efficiency and robustness of the proposed method is retained by employing the technique of region reduction and an adaptive neighborhood structure. In the case where multiple (global) optima may exist, a technique based on the method of simulated evolution is developed to circumvent the difficulty of convergence of population. Numerical studies of some standard test functions and an optimum structural design problem show that the proposed method is effective in solving global optimization problems.