Call for Paper - May 2023 Edition
IJCA solicits original research papers for the May 2023 Edition. Last date of manuscript submission is April 20, 2023. Read More

New Approach to Standard Genetic Algorithm

Print
PDF
 
Download Full Text
International Journal of Computer Applications
© 2011 by IJCA Journal
Number 1 - Article 1
Year of Publication: 2011
Authors:
Fariborz Ahmadi
Amir Sheikhahma Di
Reza Tati
Soraia Ahmadi
10.5120/3949-5503

Fariborz Ahmadi, Amir Sheikhahmadi, Reza Tati and Soraia Ahmadi. Article:New Approach to Standard Genetic Algorithm. International Journal of Computer Applications 32(10):46-50, October 2011. Full text available. BibTeX

@article{key:article,
	author = {Fariborz Ahmadi and Amir Sheikhahmadi and Reza Tati and Soraia Ahmadi},
	title = {Article:New Approach to Standard Genetic Algorithm},
	journal = {International Journal of Computer Applications},
	year = {2011},
	volume = {32},
	number = {10},
	pages = {46-50},
	month = {October},
	note = {Full text available}
}

Abstract

Genetic algorithm (GA) uses the principle of natural selection of Darwin to find the most suitable formula for prediction or pattern matching. Shortly, it is said that GA is a programming technique that uses the genetic evolution to solve a problem. The problem that should be solved is the input of evolution and its solution are encoded according to the problem. The main problem of this algorithm is that after passing through some generations, it may be produced some chromosomes that had been produced in previous generations. To from this disadvantage, All individuals in this work divided into two categories, namely, male (chromosome) and female (ovum). In crossover operation, only one chromosome and one ovum can be existed and under some conditions these two individuals recombine with each other. In this work, a new approach has been invented and the results of implementation and evaluations show the technique efficiency in proportion to standard genetic algorithm.

Reference

  • Goldberg d., Genetic algorithm in search optimization and machine learning, Addison-welsey publishing, 1989.
  • Goldberg D., and R. lingle, traveling salesman problem , proc of an international conference on genetic algorithm and their applications,1985
  • J.chlebikova. approximating the maximally balanced connected partion problem in graphs. Information processing Letters, 1996.
  • Haritigan, J.A., clustering algorithms, jhon wiley & sons, 1975.
  • Srinivas, M., Patnaik, L. M. (1994), "Genetic Algorithms: A Survey",IEEE Trans. Computer,June 1994.
  • Srinivas, M., Patnaik, L. M. (1994), "Adaptive Probabilities of Crossover and Mutation in Genetic Algorithms", IEEE Trans. Systems, Man and Cybernetics, Apr.1994.
  • Jakobovic, D. (1997) "Adaptive Genetic Operators in limination Genetic Algorithm", Proc. 19th International Conference ITI'97, Pula, 17-20 June 1997, pp.351-356.