Results 281 to 290 of about 2,996,453 (335)
Some of the next articles are maybe not open access.
A fast simulated annealing algorithm for the examination timetabling problem
Expert systems with applications, 2019The timetabling problem involves the scheduling of a set of entities (e.g., lectures, exams, vehicles, or people) to a set of resources in a limited number of time slots, while satisfying a set of constraints.
Nuno Leite, F. Melício, A. Rosa
semanticscholar +1 more source
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
Optimizing simulated annealing
2006This paper reviews efforts towards optimizing simulated annealing. In particular we address the question of the optimal schedule and of how estimates of system properties needed in optimizing simulated annealing can be obtained. We describe the ensemble approach to simulated annealing which lends itself readily to the implementation on parallel and ...
Karl-Heinz Hoffmann 0002 +2 more
openaire +2 more sources
Simulated annealing — to cool or not
Systems & Control Letters, 1989zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hajek, Bruce, Sasaki, Galen
openaire +2 more sources
Simulated Annealing and Graph Colouring [PDF]
Combinatorics, Probability and Computing, 2001 Simulated annealing is a very successful heuristic for various problems in combinatorial optimization. In this paper an application of simulated annealing to the 3-colouring problem is considered. In contrast to many good empirical results we will show for a certain class of graphs that the expected first hitting time of a proper colouring, given an
Nolte, Andreas, Schrader, Rainer
openaire +3 more sources
On chaotic simulated annealing
IEEE Transactions on Neural Networks, 1998Chen and Aihara recently proposed a chaotic simulated annealing approach to solving optimization problems. By adding a negative self-coupling to a network model proposed earlier by Aihara et al. and gradually removing this negative self-coupling, they used the transient chaos for searching and self-organizing, thereby achieving remarkable improvement ...
Lipo Wang 0001, Kate A. Smith
openaire +2 more sources
Simulated annealing: An introduction
Statistica Neerlandica, 1989Simulated annealing is a general approach for approximately solving large combinatorial optimization problems. The algorithm is based on an intriguing combination of ideas from at first sight completely unrelated fields of science, viz. combinatorial optimization and statistical physics.
Aarts, E.H.L., Laarhoven, van, P.J.M.
openaire +2 more sources
A Hybrid Harmony search and Simulated Annealing algorithm for continuous optimization
Information Sciences, 2018Harmony search is a powerful metaheuristic algorithm with excellent exploitation capabilities but suffers a very serious limitation of premature convergence if one or more initially generated solutions/harmonies are in the vicinity of local optimal.
Assif Assad, K. Deep
semanticscholar +1 more source
Random Structures & Algorithms, 1992
AbstractThis article introduces the notion of restricted parallelism for networks, a generalization of the unlimited parallelism for Boltzmann machines. The convergence of the annealing algorithm in the restricted parallel form is established, for an arbitrary network.
openaire +2 more sources
AbstractThis article introduces the notion of restricted parallelism for networks, a generalization of the unlimited parallelism for Boltzmann machines. The convergence of the annealing algorithm in the restricted parallel form is established, for an arbitrary network.
openaire +2 more sources
Optimization and Engineering, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source