Open Access   Article Go Back

A Technique of Crossover and Mutation to solve School Time Table Problem using Genetic Algorithm

Mohd. Irfan1

Section:Research Paper, Product Type: Journal Paper
Volume-7 , Issue-1 , Page no. 523-525, Jan-2019

CrossRef-DOI:   https://doi.org/10.26438/ijcse/v7i1.523525

Online published on Jan 31, 2019

Copyright © Mohd. Irfan . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

View this paper at   Google Scholar | DPI Digital Library

XML View
PDF Download

How to Cite this Paper

  • IEEE Citation
  • MLA Citation
  • APA Citation
  • BibTex Citation
  • RIS Citation

IEEE Style Citation: Mohd. Irfan, “A Technique of Crossover and Mutation to solve School Time Table Problem using Genetic Algorithm,” International Journal of Computer Sciences and Engineering, Vol.7, Issue.1, pp.523-525, 2019.

MLA Style Citation: Mohd. Irfan "A Technique of Crossover and Mutation to solve School Time Table Problem using Genetic Algorithm." International Journal of Computer Sciences and Engineering 7.1 (2019): 523-525.

APA Style Citation: Mohd. Irfan, (2019). A Technique of Crossover and Mutation to solve School Time Table Problem using Genetic Algorithm. International Journal of Computer Sciences and Engineering, 7(1), 523-525.

BibTex Style Citation:
@article{Irfan_2019,
author = {Mohd. Irfan},
title = {A Technique of Crossover and Mutation to solve School Time Table Problem using Genetic Algorithm},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {1 2019},
volume = {7},
Issue = {1},
month = {1},
year = {2019},
issn = {2347-2693},
pages = {523-525},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=3536},
doi = {https://doi.org/10.26438/ijcse/v7i1.523525}
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
DO = {https://doi.org/10.26438/ijcse/v7i1.523525}
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=3536
TI - A Technique of Crossover and Mutation to solve School Time Table Problem using Genetic Algorithm
T2 - International Journal of Computer Sciences and Engineering
AU - Mohd. Irfan
PY - 2019
DA - 2019/01/31
PB - IJCSE, Indore, INDIA
SP - 523-525
IS - 1
VL - 7
SN - 2347-2693
ER -

VIEWS PDF XML
330 313 downloads 118 downloads
  
  
           

Abstract

Creating school time table lies under the category of NP hard problems. If we try to create a time table using exhaustive approach i.e applying all possible combinations, then it can take a huge amount of time to solve the problem. So Genetic Algorithm is a good way to solve such problems. Instead of using traditional techniques of Crossover and Mutation in genetic algorithm we have applied a better technique of crossover and mutation which reduces the search space by deducting invalid time tables from the search space. We have also done some experiments which show the variation of number of generations to solve the problem with mutation rate.

Key-Words / Index Term

NP hard problem,exhaustive approach

References

[1] Man, K. F., Tang, K. S., &Kwong, S. (1996). Genetic algorithms: concepts and applications [in engineering design]. IEEE Transactions on Industrial Electronics, 43(5), 519–534.doi:10.1109/41.538609
[2] E. Canth-Paz, “A summary of research on parallel genetic algorithms,” Illinois Genetic Algorithms Lab., Univ. Illinois at Urbana-Champaign, IlliGAL Rep. 95007, July 1995.
[3] Manoj Garg and Dinesh Kumar, "Simple GA & Hybrid GA for Basis Path Testing under BDFF", International Journal of Scientific Research in Computer Science and Engineering, Vol.4, Issue.6, pp.28-35, 2016
[4] S. Dubey, R. Jhaggar, R. Verma, D. Gaur, "Encryption and Decryption of Data by Genetic Algorithm", International Journal of Scientific Research in Computer Science and Engineering, Vol.5, Issue.3, pp.47-52, 2017
[5] https://en.wikipedia.org/wiki/Genetic_algorithm