Numerical recipes in C (2nd ed.): the art of scientific computing
Numerical recipes in C (2nd ed.): the art of scientific computing
Genetic algorithms + data structures = evolution programs (2nd, extended ed.)
Genetic algorithms + data structures = evolution programs (2nd, extended ed.)
Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on uniform random number generation
An Introduction to Genetic Algorithms
An Introduction to Genetic Algorithms
Journal of Global Optimization
On Random Numbers And The Performance Of Genetic Algorithms
GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series)
Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series)
Soft Computing - A Fusion of Foundations, Methodologies and Applications
Editorial: Hybrid learning machines
Neurocomputing
Information Sciences: an International Journal
Editorial: Hybrid intelligent algorithms and applications
Information Sciences: an International Journal
Study on the effects of pseudorandom generation quality on the performance of differential evolution
ICANNGA'11 Proceedings of the 10th international conference on Adaptive and natural computing algorithms - Volume Part I
Sensitiveness of evolutionary algorithms to the random number generator
ICANNGA'11 Proceedings of the 10th international conference on Adaptive and natural computing algorithms - Volume Part I
Parallelism and evolutionary algorithms
IEEE Transactions on Evolutionary Computation
Hi-index | 0.00 |
This article presents an analysis of the sensitiveness of evolutionary algorithms to the change of the random number generator when using a real-world problem --the fitting of a theoretical curve to an experimental data set-- as test. On the one hand, the evolutionary algorithms selected: particle swarm algorithm, differential evolution and genetic algorithm are widely used in optimization problems. And, on the other hand, the random number generator used: Mersenne Twister and GCC rand(), are the most frequently linked to evolutionary algorithms, as well as they are considered as high-quality. As a consequence of this work, an assessment is stated about the sensitiveness of the evolutionary algorithms studied to the choice of the random number generator.