Simulated Annealing And Balance Of Recurrence Orders
- Additional Document Info
- View All
Several important problems in diverse application areas such as image restoration, code design, and VLSI design, contain at their core an optimization problem whose solution crucially determines the performance of the resulting engineering system. Standard descent algorithms for such optimization problems, however, typically get trapped in local minima, and fail to reach solutions at or near the global minimum. Motivated by the problems of determining the global minima of optimization problems, the algorithm of simulated annealing for optimization has been proposed. Here we present recent results on the performance of this algorithm in reaching the global minimum of combinatorial optimization problems. © 1989 SPIE.
author list (cited authors)
complete list of authors