Global convergence of genetic algorithms

Gunar E. Liepins

doi:10.1117/12.130817

16 December 1992 Global convergence of genetic algorithms

Gunar E. Liepins

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

Abstract

We extend an approach to global convergence for genetic algorithms via a homogeneous Markov chain argument that does not depend on mutation. Our result is a proof of convergence to a set of populations which contain the optimal.

Citation Download Citation

Gunar E. Liepins "Global convergence of genetic algorithms", Proc. SPIE 1766, Neural and Stochastic Methods in Image and Signal Processing, (16 December 1992); https://doi.org/10.1117/12.130817

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