Genetic Algorithms

Theory and Applications

p. 35-44

Abstract

Genetic Algorithms (GAs) are robust probabilistic algorithms for optimization, relying strongly on parallel computation. Their power comes from multi-point exploiting of the searching space, avoiding the stagnation in local optima. First we review the state of art in GA theory. Next, two illustrative original applications highlight the efficiency of GA on multi-parameter optimization tasks: on solving systems of fuzzy relational equations, and on optimizing the parameters involved in an economic forecasting task.

Text

Download Facsimile [PDF, 3.8M]

References

Bibliographical reference

Alexandru Agapie, « Genetic Algorithms », CASYS, 7 | 2000, 35-44.

Electronic reference

Alexandru Agapie, « Genetic Algorithms », CASYS [Online], 7 | 2000, Online since 26 September 2024, connection on 14 November 2024. URL : http://popups.lib.uliege.be/1373-5411/index.php?id=3565

Author

Alexandru Agapie

National Institute of Microtechnology, PO Box 38-160, 72225, Bucharest, Romania

Copyright

CC BY-SA 4.0 Deed