ROMJIST Volume 1, No. 1, 1998, pp. 3-21
Alexandru AGAPIE, Marius GIUCLEA, Florin FAGARASAN, Horia DEDIU Genetic Algorithms: Theoretical Aspects and Applications
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).Full text not available