BASIC PRINCIPLES OF GENETIC ALGORITHMS

Authors

  • Er.Twinkle Dahiya M.Tech. Student ,SPITM, Sonepat
  • Er.Aakash Goyal A.P.,JIET ,Jind
  • ,Er.kapil HOD CSE,SPITM

Keywords:

Genetic Algorithms, Fitness, Crossover, Optimizations

Abstract

Genetic Algorithms were developed scientist John Holland based on the theory of natural selection which takes population of 'solutions' and use these solutions to multiply and take the best characteristics of their predecessors. Fitness value of thus produced progeny is calculated and further breeding is done for millions of generations and the best offspring can be selected as the solution to the problem i.e. timetable optimization, CPU scheduling etc. This paper reviews the genetic algorithm its benefits, applications and various steps need to be applied to use genetic algorithm or problem solving.

References

NA

Downloads

Published

30-06-2015

How to Cite

Er.Twinkle Dahiya, Er.Aakash Goyal, & ,Er.kapil. (2015). BASIC PRINCIPLES OF GENETIC ALGORITHMS. International Journal for Research Publication and Seminar, 6(2). Retrieved from https://jrps.shodhsagar.com/index.php/j/article/view/712

Issue

Vol. 6 No. 2 (2015): Volume 6 | Issue 2 | May-Jun 2015

Section

Original Research Article

License

Copyright (c) 2015 International Journal for Research Publication and Seminar

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Re-users must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use. This license allows for redistribution, commercial and non-commercial, as long as the original work is properly credited.