Results 231 to 240 of about 213,502 (282)
Hybrid genetic algorithm-simulated annealing based electric vehicle charging station placement for optimizing distribution network resilience. [PDF]
Sci RepKumar BA +5 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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
Simulated annealing on a multiprocessor
Proceedings 1988 IEEE International Conference on Computer Design: VLSI, 2003The authors present a method for parallelizing the simulated annealing algorithm by mapping the algorithm onto a dynamically structured tree of processors. The resulting parallel simulated annealing algorithm is discussed and its performance evaluated using simulation techniques.
Roger D. Chamberlain +3 more
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
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
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, Kate A. Smith
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
Proceedings of ISCAS'95 - International Symposium on Circuits and Systems, 2002
A simulated annealing algorithm for wire placement is proposed in which annealing is carried out under conditions of constant interconnection pressure rather than constant area. This is achieved by modifying the Metropolis criterion so that changes in the Gibbs free energy of the wires are calculated.
Phillip Christie +2 more
openaire +1 more source
A simulated annealing algorithm for wire placement is proposed in which annealing is carried out under conditions of constant interconnection pressure rather than constant area. This is achieved by modifying the Metropolis criterion so that changes in the Gibbs free energy of the wires are calculated.
Phillip Christie +2 more
openaire +1 more source