Google scholar arxiv informatics ads IJAIS publications are indexed with Google Scholar, NASA ADS, Informatics et. al.

Call for Paper


March Edition 2023

International Journal of Applied Information Systems solicits high quality original research papers for the March 2023 Edition of the journal. The last date of research paper submission is February 15, 2023.

Automatic Timetable Generation using Genetic Algorithm

Williams Kehinde Oladipo, Ajayi Olutayo Bamidele, Ajinaja Micheal Olalekan in Artificial Intelligence

International Journal of Applied Information Systems
Year of Publication: 2019
Publisher: Foundation of Computer Science (FCS), NY, USA
Authors:Williams Kehinde Oladipo, Ajayi Olutayo Bamidele, Ajinaja Micheal Olalekan
Download full text
  1. Williams Kehinde Oladipo, Ajayi Olutayo Bamidele and Ajinaja Micheal Olalekan. Automatic Timetable Generation using Genetic Algorithm. International Journal of Applied Information Systems 12(19):1-3, February 2019. URL, DOI BibTeX

    	author = "Williams Kehinde Oladipo and Ajayi Olutayo Bamidele and Ajinaja Micheal Olalekan",
    	title = "Automatic Timetable Generation using Genetic Algorithm",
    	journal = "International Journal of Applied Information Systems",
    	issue_date = "February, 2019",
    	volume = 12,
    	number = 19,
    	month = "February",
    	year = 2019,
    	issn = "2249-0868",
    	pages = "1-3",
    	url = "",
    	doi = "10.5120/ijais2019451779",
    	publisher = "Foundation of Computer Science (FCS), NY, USA",
    	address = "New York, USA"


The generation of timetables has always been tedious right from time and apart from being tedious, the timetable created has always been filled with series of errors and mistakes. So many techniques have been put forward to solving this problem. In this paper, genetic Algorithm was used by creating a group of time series randomly from a given time and courses in other to find a solution to the timetable problems. The courses thus formed are evaluated with the help of the evaluation function. system administrator logs into the system and then the administrator input the courses with their codes and the unit. At that point, the admin will keep adding until the number of courses needed has been inputted. The admin can remove a course that has been inputted in the case of error. After inputting the courses, it moves to the next page where all the lecture halls or rooms that will be used will be inputted. After inputting these, the system then generates the timetable system. This technique (genetic algorithm) used helps in reducing to barest minimum, errors and mistakes in encountered in developing an automatic timetable.


  1. Abramson, D. (1991). Constructing Schools Timetables Using Simulated Annealing: Sequential and Parallel Algorithms Management Science.
  2. Adejuwon, O. S. (2012). Development of a University timetable automation system.
  3. Anisha, J., Ganapathy, S. C., Harshita, G., & Rishabh, B. (2015). A Literature Review on Timetable generation algorithms based on Genetic Algorithm and Heuristic approach . International Journal of Advanced Research in COmputer and Communication Engineering , 159-163.
  4. Back, T. (1995). Evolutionary Algorithms in theory and practice.
  5. Baricelli Nils Aall. (1957). Symbiogenetic evolution preocesses realized by artificial methods. 143-182.
  6. Barkha, N., Ambika, G., & Rashmi, B. (2013, July). Use of Active Rules and Genetic Algorithm to Generate the Automatic Timetable. International Journal of Advances in Engineering Sciences Vol. 3 .
  7. Barricelli, N. A. (1963). Numerical testing of evolution theories. Part II. Preliminary test of performance, symboigenesis and terrestial life , 99-126.
  8. Bentley, L. D. Systems Analysis and Design for the Global Enterprise (7th Edition ed.).
  9. Buckles, B. P., & Petry, F. E. (1992). Genetic Algorithms.
  10. Bunday, B. D. (1984). Basic Optimization Methods Edward Arnold.
  11. Chamber, L. (1995). Practical Handbook on Genetic Algorithms: Appplications.
  12. Crosby, J. (1973). Computer Simulation in Genetics. London: John Wiley & Sons.
  13. Dikmann, R., Luling, R., & Simeon, J. (1993). PProblem independent distributed simulated annealing and its applications.
  14. Feiring, B. R. (1986). Linear Programming 60: An Introduction Publication .
  15. Forgel, D. (1998). Evolutionary Computation: the Fossiil Record . New York: IEEE Press.
  16. Fraser, A., & Burnell, D. (1970). Computer Models in Genetics. New York: McGraw-Hill.
  17. Glover, F. (1997). A Template for Scatter Search and Path Relinking. Lecture Notes in Computer Science .
  18. Glover, F., & Laguna, M. (1997). Tabu Search.
  19. Goldberg. (1989). Genetic Algorithm in Search, Optimization and Machine Learning.
  20. Makeower, M. S., & Williamson, E. (1975). Operational Research-Teach Yourself Books.
  21. Paulli, J. (1993). Information utilization in simulated annealing and tabu search.
  22. Rechenberg, I. (1973). Evolution Strategie. Stuttgart: Holzmann-Froboog.
  23. Sanchez, A., Shibata, T., & Zadeh, L. (1997). Genetic Algorithms and Fuzzy Logic Systems.
  24. Sharma, D., & Chandra, N. (1999). An evolutionary approach to constraint-based timetabling.
  25. Taha, T. R. (1987). Numerical schemes for nonlinear evolution equations. The College Jornal of Science and Technology (Jerusalem) .
  26. Tahir, A. M., Hikmat, U. K., & Sajjad, S. (2012). Dynamic Time Table Generation Conforming Constraints a Novel Approach. ICCIT .
  27. Turing, A. (1950). Computing machinery and Intelligence. 433-460.
  28. Ulrich, & Eppinger. (2016, May 27). System Design. Retrieved May 27, 2016, from wikipedia:
  29. Zoints, S. (1974). Linear and Integer Programming.


Automatic; timetable; generation; genetic; algorithm