Share Email Print

Proceedings Paper

Simulated Annealing And Balance Of Recurrence Orders
Author(s): P. R. Kumar
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

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.

Paper Details

Date Published: 17 May 1989
PDF: 4 pages
Proc. SPIE 1058, High Speed Computing II, (17 May 1989); doi: 10.1117/12.951672
Show Author Affiliations
P. R. Kumar, University of Illinois (United States)

Published in SPIE Proceedings Vol. 1058:
High Speed Computing II
Keith Bromley, Editor(s)

© SPIE. Terms of Use
Back to Top