Results 251 to 260 of about 937,899 (294)
Some of the next articles are maybe not open access.
On Simulated Annealing and Nested Annealing
Journal of Global Optimization, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
1989
The goal of the research out of which this monograph grew, was to make annealing as much as possible a general purpose optimization routine. At first glance this may seem a straight-forward task, for the formulation of its concept suggests applicability to any combinatorial optimization problem.
Otten, R.H.J.M., Ginneken, van, L.P.P.P.
openaire +2 more sources
The goal of the research out of which this monograph grew, was to make annealing as much as possible a general purpose optimization routine. At first glance this may seem a straight-forward task, for the formulation of its concept suggests applicability to any combinatorial optimization problem.
Otten, R.H.J.M., Ginneken, van, L.P.P.P.
openaire +2 more sources
The annealing and re-annealing of glass
Transactions of the Optical Society, 1924In Part III of this paper the formulae deduced in the previous parts are applied to the case of heating glass under constant gradient and the temperature at which strain disappears is obtained, the effect of the known change in the coefficient of expansion on this temperature being discussed.
openaire +1 more source
Nature, 1948
IT is well known that the relaxation of stress in glass during annealing does not follow the Maxwellian relaxation formula. Indeed, annealing schedules for glass are always based on Adams and Williamson‘s1empirical law that the reciprocal of the stress is proportional to the time.
openaire +2 more sources
IT is well known that the relaxation of stress in glass during annealing does not follow the Maxwellian relaxation formula. Indeed, annealing schedules for glass are always based on Adams and Williamson‘s1empirical law that the reciprocal of the stress is proportional to the time.
openaire +2 more sources
2016
Metaheuristics exhibit desirable properties like simplicity, easy parallelizability, and ready applicability to different types of optimization problems. After a comprehensive introduction to the field, the contributed chapters in this book include explanations of the main metaheuristics techniques, including simulated annealing, tabu search ...
openaire +2 more sources
Metaheuristics exhibit desirable properties like simplicity, easy parallelizability, and ready applicability to different types of optimization problems. After a comprehensive introduction to the field, the contributed chapters in this book include explanations of the main metaheuristics techniques, including simulated annealing, tabu search ...
openaire +2 more sources
IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 2010
We present a new class of methods for the global optimization of continuous variables based on simulated annealing (SA). The coupled SA (CSA) class is characterized by a set of parallel SA processes coupled by their acceptance probabilities. The coupling is performed by a term in the acceptance probability function, which is a function of the energies ...
Samuel Xavier de Souza +3 more
openaire +2 more sources
We present a new class of methods for the global optimization of continuous variables based on simulated annealing (SA). The coupled SA (CSA) class is characterized by a set of parallel SA processes coupled by their acceptance probabilities. The coupling is performed by a term in the acceptance probability function, which is a function of the energies ...
Samuel Xavier de Souza +3 more
openaire +2 more sources
SIAM Journal on Optimization, 1995
Summary: By cooling slightly more slowly than the canonical schedule and simulating direct self-loop sequences implicitly, the computer time to execute simulated annealing given the number of accepted moves becomes proportional to that number in expectation and, in a certain sense, almost surely.
openaire +1 more source
Summary: By cooling slightly more slowly than the canonical schedule and simulating direct self-loop sequences implicitly, the computer time to execute simulated annealing given the number of accepted moves becomes proportional to that number in expectation and, in a certain sense, almost surely.
openaire +1 more source
On Eigenvalues and Annealing Rates
Mathematics of Operations Research, 1988We evaluate asymptotically the eigenvalues of transition rate matrices (Qijϵ)i,j=1n with Qijϵ ∼ exp(−(U(j) − U(i))+/ϵ) for some function U using Ventcel's graphic method. As a consequence, we can compare the “nearly optimal” annealing rate in (Gidas, B. 1985. Global optimization via the Langevin equation. Proc. 24th IEEE Conf. Decision and Control, Ft.
Tzuu-Shuh Chiang, Yunshyong Chow
openaire +1 more source
Optimization by Simulated Annealing
Science, 1983There is a deep and useful connection between statistical mechanics (the behavior of systems with many degrees of freedom in thermal equilibrium at a finite temperature) and multivariate or combinatorial optimization (finding the minimum of a given function depending on many parameters).
Scott Kirkpatrick +2 more
openaire +2 more sources