Results 251 to 260 of about 2,844,778 (299)

A simulated annealing algorithm for demand response

2011 2nd IEEE PES International Conference and Exhibition on Innovative Smart Grid Technologies, 2011
For many consumers there are loads which need to be on for a subinterval between two time instants, but it is immaterial during which subinterval it is run. In many price based Demand Response (DR) programs such as Time of Use (TOU), Critical Peak Pricing (CPP), Extreme Day Pricing customers are informed about the prices on a day ahead bases.
T. P. Imthias Ahamed, S. Danish Maqbool, Essam A. Al-Ammar, N. H. Malik   +3 more
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 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

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   +3 more sources

Simulated annealing algorithm with adaptive neighborhood

Applied Soft Computing, 2011
As we know, simulated annealing algorithm with large neighborhoods has greater probability of arriving at a global optimum than a small one has, if the other conditions, i.e., the initial configuration, initial temperature and temperature decreasing rate, are the same.
openaire   +2 more sources

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   +3 more sources

The Simulated Annealing Algorithm

1988
Most placement and global routing problems belong to the class of NP-complete problems.1 For problems in this class, there is no known exact algorithm whose worst-case time complexity is bounded by a polynomial in the size of the input. Consequently, heuristic algorithms are used to find solutions to these problems.
openaire   +1 more source

Implementing a Parallel Simulated Annealing Algorithm

2010
The MPI and OpenMP implementations of the parallel simulated annealing algorithm solving the vehicle routing problem (VRPTW) are presented. The algorithm consists of a number of components which co-operate periodically by exchanging their best solutions found to date.
Zbigniew J. Czech, Wojciech Mikanik, Rafal Skinderowicz   +2 more
openaire   +2 more sources

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