Provably convergent inhomogeneous genetic annealing algorithm

Griff L. Bilbro; Jue Hall; Lawrence A. Ray

doi:10.1117/12.130816

16 December 1992 Provably convergent inhomogeneous genetic annealing algorithm

Griff L. Bilbro, Jue Hall, Lawrence A. Ray

Proceedings Volume 1766, Neural and Stochastic Methods in Image and Signal Processing; (1992) https://doi.org/10.1117/12.130816
Event: San Diego '92, 1992, San Diego, CA, United States

Abstract

We define genetic annealing as simulated annealing applied to a population of several solutions when candidates are generated from more than one (parent) solution at a time. We show that such genetic annealing algorithms can inherit the convergence properties of simulated annealing. We present two examples, one that generates each candidate by crossing pairs of parents and a second that generates each candidate from the entire population. We experimentally apply these two extreme versions of genetic annealing to a problem in vector quantization.

Citation Download Citation

Griff L. Bilbro, Jue Hall, and Lawrence A. Ray "Provably convergent inhomogeneous genetic annealing algorithm", Proc. SPIE 1766, Neural and Stochastic Methods in Image and Signal Processing, (16 December 1992); https://doi.org/10.1117/12.130816

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