Journal of Global Optimization
Proceedings of the 2006 ACM symposium on Applied computing
EvoCOP'05 Proceedings of the 5th European conference on Evolutionary Computation in Combinatorial Optimization
Evolutionary programming made faster
IEEE Transactions on Evolutionary Computation
Learning and optimization using the clonal selection principle
IEEE Transactions on Evolutionary Computation
Cooperative mutation based evolutionary programming for continuous function optimization
Operations Research Letters
Maximal age in randomized search heuristics with aging
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Proceedings of the 12th annual conference on Genetic and evolutionary computation
On benefits and drawbacks of aging strategies for randomized search heuristics
Theoretical Computer Science
Hi-index | 0.00 |
This work presents an analysis of the static Aging operator for different evolutionary algorithms: two immunological algorithms (OptIA and Clonalg), a standard genetic algorithm SGA, and Differential Evolution (DE) algorithm. The algorithms were tested against standard benchmarks in both unconstrained and dynamic optimisation problems. This work analyses whether the aging operator improves the results when applied to evolutionary algorithms. With the exception of DE, the results report that every algorithm shows an improvement in performance when used in combination with Aging.