A Crossover Probability Distribution in Genetic Algorithm Under process Scheduling Problem

Main Article Content

Er.Rajiv Kumar
Er Sanjeev Gill, Er. Ashwani Kaushik


This paper describe the effect of crossover probability on the convergence of genetic algorithm. Genetic Algorithm have been
designed as general purpose optimization method. The power of the genetic algorithm is depends upon the proper use of their operators such as
selection, crossover and mutation. In this paper we apply the varying crossover probability under the operating system process scheduling
problem. The diversity of the population of the individuals are determine by the probability of crossover in the genetic algorithm. Crossover is
work as a diversifier for the population of solution in the genetic algorithm. The experiments shows that as the probability of cross over increase
more easily the GA adapt to the problem and converge to the best solution state.


Keywords: Genetic algorithm, NP-hard, Process Scheduling, Crossover


Download data is not yet available.

Article Details