Results 81 to 90 of about 207,768 (122)
Some of the next articles are maybe not open access.
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 ...
Ke-Lin Du, M. N. S. Swamy
openaire +3 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 ...
Ke-Lin Du, M. N. S. Swamy
openaire +3 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
American Journal of Mathematical and Management Sciences, 1988
SYNOPTIC ABSTRACTThe principal shortcoming of simulated annealing (SA) is that it takes too much computer time. We present a few “swindling” ideas for speeding up SA by simulating its action on a problem. The increase in speed is attained at the cost of decreasing generality — the methods all require the use of problem-specific information.
openaire +1 more source
SYNOPTIC ABSTRACTThe principal shortcoming of simulated annealing (SA) is that it takes too much computer time. We present a few “swindling” ideas for speeding up SA by simulating its action on a problem. The increase in speed is attained at the cost of decreasing generality — the methods all require the use of problem-specific information.
openaire +1 more source
On Simulated Annealing and Nested Annealing
Journal of Global Optimization, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Integrative oncology: Addressing the global challenges of cancer prevention and treatment
Ca-A Cancer Journal for Clinicians, 2022Jun J Mao,, Msce +2 more
exaly