Analysis of Selection Schemes for Solving an Optimization Problem in Genetic Algorithm

  • Sharma P
  • Wadhwa A
  • Komal K
N/ACitations
Citations of this article
41Readers
Mendeley users who have this article in their library.

Abstract

Genetic algorithm is a population based an adaptive search and optimizations techniques and genetic mimic the natural evolution process. The Genetic operators include selection, crossover and mutation. The aim to present this paper is it gives comparative selection strategies for solving an optimization problem in genetic algorithm and evaluates their performance.

Cite

CITATION STYLE

APA

Sharma, P., Wadhwa, A., & Komal, K. (2014). Analysis of Selection Schemes for Solving an Optimization Problem in Genetic Algorithm. International Journal of Computer Applications, 93(11), 1–3. https://doi.org/10.5120/16256-5714

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free