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

Authors

  • Irfan M Department of Computer Science and Applications, DeshBhagat College, Bardwal-Dhuri, India

DOI:

https://doi.org/10.26438/ijcse/v7i1.523525

Keywords:

NP hard problem, exhaustive approach

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.

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

Downloads

Published

2019-01-31
CITATION
DOI: 10.26438/ijcse/v7i1.523525
Published: 2019-01-31

How to Cite

[1]
M. Irfan, “A Technique of Crossover and Mutation to solve School Time Table Problem using Genetic Algorithm”, Int. J. Comp. Sci. Eng., vol. 7, no. 1, pp. 523–525, Jan. 2019.

Issue

Vol. 7 No. 1 (2019): IJCSE January Edition

Section

Research Article

License

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.