16 December 1992 Provably convergent inhomogeneous genetic annealing algorithm
Author Affiliations +
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.
© (1992) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Griff L. Bilbro, Griff L. Bilbro, Jue Hall, Jue Hall, Lawrence A. Ray, Lawrence A. Ray, } "Provably convergent inhomogeneous genetic annealing algorithm", Proc. SPIE 1766, Neural and Stochastic Methods in Image and Signal Processing, (16 December 1992); doi: 10.1117/12.130816; https://doi.org/10.1117/12.130816
PROCEEDINGS
11 PAGES


SHARE
RELATED CONTENT

Global convergence of genetic algorithms
Proceedings of SPIE (December 15 1992)
Selecting materialized views using random algorithm
Proceedings of SPIE (April 08 2007)
Optimization filters design for GFT by genetic algorithm
Proceedings of SPIE (August 27 1995)
Multiscale image coder
Proceedings of SPIE (May 18 1992)

Back to Top