Results 261 to 270 of about 34,283 (310)

Analysis of Static Simulated Annealing Algorithms

Journal of Optimization Theory and Applications, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Orosz, J. E., Jacobson, S. H.
openaire   +1 more source

Deployment algorithm using simulated annealing

2011 16th International Conference on Methods & Models in Automation & Robotics, 2011
In this paper, a novel information design algorithm is proposed. It is based on the simulated annealing, which is regarded as one of the important meta-heuristic optimization methods. The idea behind our algorithm originates from the search for optimal solution, where selection avoids local minima.
Slawomir Nikiel, Pawel Dabrowski
openaire   +1 more source

Note on the Convergence of Simulated Annealing Algorithms

SIAM Journal on Control and Optimization, 1991
Generalizing the results of the first author and \textit{R. Schrader} [Inf. Process. Lett. 27, 189-194 (1988; Zbl 0638.65054)] a short inductive proof is given that shows that the stationary distributions of a simulated annealing algorithm converge to a distribution where nonoptimal elements are generated with probability zero, provided that the ``weak
Faigle, U., Kern, W.
openaire   +2 more sources

A new simulated annealing algorithm

International Journal of Computer Mathematics, 1995
Simulated Annealing (SA) is a powerful stochastic search algorithm applicable to a wide range of problems for which little prior knowledge is available. The annealing schedule, i.e., the temperature decreasing rate used in SA is an important factor which affects SA's rate of convergence.
openaire   +1 more source

A new multiobjective simulated annealing algorithm

Journal of Global Optimization, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ozan Tekinalp, Gizem Karsli
openaire   +2 more sources

A simulated annealing algorithm for the clustering problem

Pattern Recognition, 1991
Abstract In this paper we discuss the solution of the clustering problem usually solved by the K -means algorithm. The problem is known to have local minimum solutions which are usually what the K -means algorithm obtains. The simulated annealing approach for solving optimization problems is described and is proposed for solving the clustering ...
Shokri Z. Selim, K. Alsultan
openaire   +1 more source

Parallel Simulated Annealing Algorithms in Global Optimization

Journal of Global Optimization, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Esin Onbasçioglu, Linet Özdamar
openaire   +2 more sources

Combining the Perceptron Algorithm with Logarithmic Simulated Annealing

Neural Processing Letters, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Andreas Alexander Albrecht, C. K. Wong
openaire   +2 more sources

Truss Optimization using the Simulated Annealing Algorithm

Proceedings of the 10th International Conference on Information Systems and Technologies, 2020
This document presents the results of our work aiming to create a tool for generating trusses. The generated structures undergo an optimizing process to be in the best possible form. The automatic generation of the truss structure is done using an algorithm adapted to the type of an initial design domain.
Zineb Biallaten, Raddouane Chiheb, Abdellatif El Afia   +2 more
openaire   +1 more source

New simulated annealing algorithms

Proceedings of 1997 IEEE International Symposium on Circuits and Systems. Circuits and Systems in the Information Age ISCAS '97, 2002
This paper introduces a new class of D-dimensional density probability functions to be used in Simulated Annealing algorithms and derives an appropriate cooling schedule that is proved to be inversely proportional to a previously chosen power n of time.
P.R.S. Mendonca, L.P. Caloba
openaire   +1 more source