𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Techniques for bounding the convergence rate of genetic algorithms

✍ Scribed by Yuri Rabinovich; Avi Wigderson

Publisher
John Wiley and Sons
Year
1999
Tongue
English
Weight
308 KB
Volume
14
Category
Article
ISSN
1042-9832

No coin nor oath required. For personal study only.

✦ Synopsis

The main purpose of the present paper is the study of computational aspects,

Ε½

. and primarily the convergence rate, of genetic algorithms GAs . Despite the fact that such algorithms are widely used in practice, little is known so far about their theoretical properties, and in particular about their long-term behavior. This situation is perhaps not too surprising, given the inherent hardness of analyzing nonlinear dynamical systems, and the complexity of the problems to which GAs are usually applied. In the present paper we concentrate on a number of very simple and natural systems of this sort, and show that at least for these systems the analysis can be properly carried out. Various properties and tight quantitative bounds on the long-term behavior of such systems are established. It is our hope that the techniques developed for analyzing these simple systems prove to be applicable to a wider range of genetic algorithms, and contribute to the development of the mathematical foundations of this promising optimization method.

πŸ“œ SIMILAR VOLUMES

Robustness and convergence rate of a dis
Robustness and convergence rate of a discrete-time learning control algorithm for a class of nonlinear systems
✍ Samer S. Saab πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 127 KB πŸ‘ 1 views

In this paper, we apply a discrete-time learning algorithm to a class of discrete-time varying nonlinear systems with a$ne input action and linear output having relative degree one. We investigate the robustness of the algorithm to state disturbance, measurement noise and reinitialization errors. We

Application of the genetic algorithm for
Application of the genetic algorithm for microwave imaging of a layered dielectric object via the regular shape expansion technique
✍ Ching-Lieh Li; Yu-Yi Cheng πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 457 KB πŸ‘ 1 views

A novel method combining the genetic algorithm (GA) and regular shape expansion technique is reported for electromagnetic imaging of a multilayer dielectric object of arbitrary shape. By measuring the scattered field, the shape, location, size, and permittivity of each layer of the object are retrie

ON THE CONVERGENCE OF ZERO-FINDING EIGEN
ON THE CONVERGENCE OF ZERO-FINDING EIGENSOLUTION ALGORITHMS FOR SOLVING NON-LINEAR EIGENVALUE PROBLEMS
✍ MOHAMMEDI R. ABDEL-AZIZ πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 118 KB πŸ‘ 1 views

This paper presents a convergence theory for non-linear eigenvalue methods. The basic idea of these methods, which have been described by the author in an earlier paper, 1 is to apply an eigen-solver in conjunction with a zero-ΓΏnding technique for solving the non-linear eigenvalue problems. The main

An extrapolation technique for predictin
An extrapolation technique for predicting the RCS characteristics of large objects using the genetic algorithm and Prony's method
✍ Sourav Chakravarty; Raj Mittra; Elif Aydin πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 374 KB πŸ‘ 1 views

A simple solution for the wavelength-routing assignment problem has been presented. This solution relies on a basic algorithm, and the first aim of the solution is either to propose a minimum delay path or, as far as possible, to minimize the number of wavelengths in the network. The solution also r