منابع مشابه
Generalized Simulated Annealing
We propose a new stochastic algorithm (generalized simulated annealing) for computationally finding the global minimum of a given (not necessarily convex) energy/cost function defined in a continuous D-dimensional space. This algorithm recovers, as particular cases, the so called classical (“Boltzmann machine”) and fast (“Cauchy machine”) simulated annealings, and can be quicker than both. Key-...
متن کاملRelative Frequencies of Generalized Simulated Annealing
We consider a class of non-homogeneous Markov chains arising in simulated annealing and related stochastic search algorithms. Using only elementary first principles, we analyze the convergence and rate of convergence of the relative frequencies of visits to states in the Markov chain. We describe in detail three examples, including the standard simulated annealing algorithm, to show how our fra...
متن کاملGeneralized simulated annealing: Application to silicon clusters
We have compared the recently introduced generalized simulated annealing ~GSA! with conventional simulated annealing ~CSA!. GSA was tested as a tool to obtain the ground-state geometry of molecules. We have used selected silicon clusters (Sin , n54 – 7,10) as test cases. Total energies were calculated through tightbinding molecular dynamics. We have found that the replacement of Boltzmann stati...
متن کاملConvergence of simulated annealing by the generalized transition probability
We prove weak ergodicity of the inhomogeneous Markov process generated by the generalized transition probability of Tsallis and Stariolo under power-law decay of the temperature. We thus have a mathematical foundation to conjecture convergence of simulated annealing processes with the generalized transition probability to the minimum of the cost function. An explicitly solvable example in one d...
متن کاملSolving the generalized minimum spanning tree problem with simulated annealing
We consider a generalization of the minimum spanning tree problem, called the generalized minimum spanning tree problem, denoted by GMST. It is known that the GMST problem is NP-hard. We present an effective algorithm for this problem. The method combines a simulated annealing algorithm (SA) with a local greedy algorithm. The heuristic that we proposed found solutions that were optimal for grap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physica A: Statistical Mechanics and its Applications
سال: 1996
ISSN: 0378-4371
DOI: 10.1016/s0378-4371(96)00271-3