CFP last date
20 December 2024
Reseach Article

Heuristics based Learning on Human Psychology

Published on February 2013 by R. Lakshmi, K. Vivekanandan
National Conference on Future Computing 2013
Foundation of Computer Science USA
NCFC - Number 1
February 2013
Authors: R. Lakshmi, K. Vivekanandan
96fae4cf-2d51-4359-ae84-6be42f457895

R. Lakshmi, K. Vivekanandan . Heuristics based Learning on Human Psychology. National Conference on Future Computing 2013. NCFC, 1 (February 2013), 26-29.

@article{
author = { R. Lakshmi, K. Vivekanandan },
title = { Heuristics based Learning on Human Psychology },
journal = { National Conference on Future Computing 2013 },
issue_date = { February 2013 },
volume = { NCFC },
number = { 1 },
month = { February },
year = { 2013 },
issn = 0975-8887,
pages = { 26-29 },
numpages = 4,
url = { /proceedings/ncfc/number1/10405-1007/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Proceeding Article
%1 National Conference on Future Computing 2013
%A R. Lakshmi
%A K. Vivekanandan
%T Heuristics based Learning on Human Psychology
%J National Conference on Future Computing 2013
%@ 0975-8887
%V NCFC
%N 1
%P 26-29
%D 2013
%I International Journal of Computer Applications
Abstract

This paper summarizes recent research on heuristic based learning procedures called Genetic Algorithms (GAs) and particularly focuses on genetic primary operators. There are different types of genetic operators existing that serve to improve the performance of genetic algorithms. Genetic Algorithm is composed of genetic operators and other genetic parameters. The primary genetic operators are selection, crossover and mutation. The performance of Genetic Algorithm mainly depends on its Genetic Operators. While solving a particular problem, 70% of the time will be spent in searching the appropriate genetic operators and their probability values. So it is much important to select the correct operator and their probabilities so as to provide optimal solutions for a given complete problem. The ultimate aim of genetic algorithm is to minimize the time and space complexities and produces optimized results. This research helps in how primary genetic operator is modified or enriched to improve the performance of genetic algorithms.

References
  1. Arthur L. Corcoran, Roger L. Wainwright, "Reducing disruption of superior building blocks in genetic algorithms", Proceedings of the, ACM SIGAPP Symposium on Applied Computing February, 2003.
  2. Davis L. "Handbook of Genetic Algorithms" Van Nostrand Reinhold, 1991.
  3. Ayed A. Salman, Kishan Mehrotra, and Chilukuri K. Mohan, "Adaptive linkage crossover evolutionary computation", Evolutionary computation, Vol. 8 1(3), September 2000.
  4. Dr. Sabry M. Abdel-Moetty "Enhanced Traveling Salesman Problem Solving using Genetic Algorithm Technique with modified Sequential Constructive Crossover Operator", IJCSNS International Journal of Computer Science and Network Security, VOL. 12 No. 6, June 2012
  5. Chen, Y. -p. , & Goldberg, D. E. , "An analysis of a reordering operator with tournament selection on a GA-hard problem", Lecture Notes in Computer Science (LNCS), 2723, pp. 825–836, 2009.
  6. Chen, Y. -p. , Peng, W. -C. , & Jian, M. -c, "Particle swarm optimization with recombination and dynamic linkage discovery", IEEE Transactions on Systems, Vol. 37(6): pp. 1460–1470, 2012
  7. European Graduate Student, "Workshop on Evolutionary Computation" 2012
  8. S. Siva Sathya, S. Kuppuswami, Department of Computer Science, Pondicherry University, "Gene Silencing for Course Time-Tabling with Genetic Algorithm".
  9. Anabela Simões, Ernesto Costa, 2003, "Improving the Genetic Algorithm?s Performance when Using Transformation", in Proc. of the Sixth International Conference on Neural Networks and Genetic Algorithms (ICANNGA'03), Springer, pp. 175-181, April-2003
Index Terms

Computer Science
Information Sciences

Keywords

Genetic Algorithms Heuristics Binary Encoding Crossover Operator Mutation Fitness Score Optimization Psychology