Simulated Annealing And Balance Of Recurrence Orders

P. R. Kumar

doi:10.1117/12.951672

17 May 1989 Simulated Annealing And Balance Of Recurrence Orders

P. R. Kumar

Proceedings Volume 1058, High Speed Computing II; (1989) https://doi.org/10.1117/12.951672
Event: OE/LASE '89, 1989, Los Angeles, CA, United States

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.

Citation Download Citation

P. R. Kumar "Simulated Annealing And Balance Of Recurrence Orders", Proc. SPIE 1058, High Speed Computing II, (17 May 1989); https://doi.org/10.1117/12.951672

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available