An Improved Clustering Based Genetic Algorithm for Solving Complex NP Problems
R. Sivaraj and T. Ravichandran
DOI : 10.3844/jcssp.2011.1033.1037
Journal of Computer Science
Volume 7, Issue 7
Problem statement: The selection process is a major factor in genetic algorithm which determines the optimality of solution for a complex problem. The selection pressure is the critical step which finds out the best individuals in the entire population for further genetic operators. The proposed algorithm tries to find out the best individuals with reduced selection pressure than standard genetic algorithm which is commonly used. Approach: The selection process is refined in the proposed algorithm by using the concept of clustering rather than traditional selection mechanisms like Roulette wheel selection, Rank selection, Tournament selection. Results: As the selection process is improved in our approach, the convergence velocity of the genetic algorithm is improved by reaching the optimal solution quickly and the optimality of the solution is also fine-tuned. Conclusion: A new variant of the standard genetic algorithm is proposed which reduces the execution time of the algorithm by gearing up the selection process to reach the most efficient solution. The fit individuals are selected for crossover and mutation in all generations thereby reaching the solution without much complex process.
© 2011 R. Sivaraj and T. Ravichandran. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.