The influence of random numbers generators upon genetic algorithms
by Marius Olteanu; Nicolae Paraschiv
International Journal of Reasoning-based Intelligent Systems (IJRIS), Vol. 5, No. 4, 2013

Abstract: Genetic algorithms represent a technique of artificial intelligence which has developed from the paradigm of biological evolution. They use a population of potential solutions which gradually evolve toward the best solution which satisfies an objective function. By their nature, genetic algorithms use random numbers. In a typical algorithm running, a random number generator is used in many occasions, like selection of the best individuals, choosing the parents for crossover and actually applying crossover, and in mutation. Relying on a standard algorithm for random numbers has the advantage of simplicity and easy implementation (for example in embedded applications), but the quality of the random numbers could influence the final results. In this paper we investigate the effect of the random number generator used by a genetic algorithm in finding the optimal solution for two test functions.

Online publication date: Sat, 18-Jan-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Reasoning-based Intelligent Systems (IJRIS):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com