ROMANIAN JOURNAL OF INFORMATION SCIENCE AND TECHNOLOGY
Volume 1, Number 1, 1998, 3 - 21

Genetic Algorithms:
Theoretical Aspects and Applications

Alexandru AGAPIE, Marius GIUCLEA, Florin FAGARASAN, Horia DEDIU
National Institute of Microtechnology
PO Box 38-160, 72225, Bucharest, Romania
E-mail: agapie@oblio.imt.pub.ro , marius@oblio.imt.pub.ro , ff@oblio.imt.pub.ro , hd@imt.ro

Abstract.
Genetic Algorithms (GA) 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 present some of the GA's theoretical features. Then, two illustrative applications highlight the efficiency of GA on multi-parameter optimization tasks: on combinatorial (a bin-packing problem), as well as on a real-valued one (a fitting problem, from computational physics).