Results 91 to 100 of about 3,468,093 (146)

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.
Xin Yao
exaly   +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
exaly   +2 more sources

Adaptive simulated annealing genetic algorithm for system identification

Engineering Applications of Artificial Intelligence, 1996
Genetic algorithms and simulated annealing are leading methods of search and optimization. This paper proposes an efficient hybrid genetic algorithm named ASAGA (Adaptive Simulated Annealing Genetic Algorithm).
Ju-Jang Lee
exaly   +2 more sources

Parallel Simulated Annealing Algorithms

Journal of Parallel and Distributed Computing, 1996
Simulated annealing (SA) has been considered a good tool for complex nonlinear optimization problems. The technique has been widely applied to a variety of problems. However, a major disadvantage of the technique is that it is extremely slow and hence not suitable for complex optimization problems such as scheduling.
D. Janaki Ram, T. H. Sreenivas, K. Ganapathy Subramaniam   +2 more
openaire   +2 more sources

A parallel simulated annealing algorithm

Parallel Computing, 1993
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nicolas Boissin, Jean-Luc Lutton
openaire   +2 more sources

Aspiration Based Simulated Annealing Algorithm

Journal of Global Optimization, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
M. M. Ali, C. Storey
openaire   +1 more source

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

Simulated annealing algorithms: an overview

IEEE Circuits and Devices: the Magazine of Electronic and Photonic Systems, 1989
A brief introduction is given to the actual mechanics of simulated annealing, and a simple example from an IC layout is used to illustrate how these ideas can be applied. The complexities and tradeoffs involved in attacking a realistically complex design problem are illustrated by dissecting two very different annealing algorithms for VLSI chip ...
R A Rutenbar
exaly   +2 more sources

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

NEW SIMULATED ANNEALING ALGORITHMS FOR CONSTRAINED OPTIMIZATION [PDF]

Asia-Pacific Journal of Operational Research, 2010
We propose a Population based dual-sequence Non-Penalty Annealing algorithm (PNPA) for solving the general nonlinear constrained optimization problem. The PNPA maintains a population of solutions that are intermixed by crossover to supply a new starting solution for simulated annealing throughout the search. Every time the search gets stuck at a local
Linet Özdamar, Chandra Sekhar Pedamallu
openaire   +2 more sources