Evolutionary programming using mutations based on the Levy probability distribution
IEEE Transactions on Evolutionary Computation
Levy walk evolution for global optimization
Proceedings of the 10th annual conference on Genetic and evolutionary computation
A T-cell algorithm for solving dynamic optimization problems
Information Sciences: an International Journal
Hi-index | 0.00 |
Efficiency of two mutation operators applied in a clonalselection based optimization algorithm AIIA for non-stationarytasks is investigated. In both operators traditional Gaussianrandom number generator was exchanged by α-stablerandom number generator and thus αbecame one of theparameters of the algorithm. Obtained results showed thatappropriate tuning of the αparameter allows tooutperform the results of algorithms with the traditionaloperators.