Advertisement

GA-based examination scheduling experience at Middle East Technical University

  • Ayhan Ergül
Genetic Algorithms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1153)

Abstract

In this paper, the development and implementation of a university examination scheduling system, based on a genetic algorithm, is described. The system has been used for scheduling examinations in two real instances so far at Middle East Technical University, involving 682 exams in one case and 1449 exams in the other. The methods employed are described including two adaptive mutation operators that yielded a more robust genetic search, a proximity matrix for efficient computation of the fitness function, a scaled conflict matrix and temporal suspension of highly conflicting exams resulting in schedules with better patterns.

Keywords

Genetic Algorithm Mutation Operator Mutation Probability Manual Schedule Proximity Matrix 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Arani T., Karwan M.H., Lotfi V., “A Langrangian Relaxation Approach to Solve the Second Phase of the Exam Scheduling Problem”, European Journal of Operational Research, Vol. 34, No. 3, pp. 372–383, 1988.Google Scholar
  2. [2]
    Balakrishnan N., “Examination Scheduling: A Computerized Application”, Omega, Vol. 19, No. 1, pp. 37–41, 1991.Google Scholar
  3. [3]
    Broder S., “Final Examination Scheduling”, Communications of the ACM, Vol. 7, 494–498, 1964.Google Scholar
  4. [4]
    Burke E.K., Elliman D.G., Weare R.F., “A Genetic Algorithm Based University Timetabling System”, East-West Conf. on Computer Technologies in Education, Vol. 1, pp. 35–40, Crimea, Ukraine, 19–23 Sept. 1994.Google Scholar
  5. [5]
    Carter M. W., Laporte G., Chinneck J.W., “A General Examination Scheduling System”, Interfaces, Vol. 24. No. 3, pp. 109–120, 1994.Google Scholar
  6. [6]
    Cobb H.G., Grefenstette J.J., “Genetic Algorithms for Tracking Changing Environments”, Proc. of the Fifth Int. Conf. on Genetic Algorithms, pp. 523–530, Morgan Kaufmann, San Mateo, CA, 1993.Google Scholar
  7. [7]
    Cole A.J., “The Preparation of Examination Timetables Using a Small-Store Computer”, Computer Journal, Vol. 7, pp. 117–121, 1964.Google Scholar
  8. [8]
    Corne D., Ross P., Fang H.-L., “Fast Practical Evolutionary Timetabling”, Lecture Notes in Computer Science, Vol. 865, pp. 250–263, Springer-Verlag, 1994.Google Scholar
  9. [9]
    Davis L., editor, Handbook of Genetic Algorithms, Van Nostrand Reinhold, New York, 1991.Google Scholar
  10. [10]
    Descroches S., Laporte G., Rousseau J.M., “HOREX: A Computer Program for the Construction of Examination Schedules”, INFOR, Vol. 16, No. 3, pp. 294–298, 1978.Google Scholar
  11. [11]
    Ergül, A., “A Genetic Algorithm for University Examination Scheduling”, Unpublished M.Sc. Thesis, Dept. of Computer Eng., Middle East Technical University, 1995.Google Scholar
  12. [12]
    Fogarty T.C., “Varying the Probability of Mutation in Genetic Algorithms”, Proc. of the Third Int. Conf. on Genetic Algorithms, pp. 104–109, 1989.Google Scholar
  13. [13]
    Foxley E., Lockyer K., “The Construction of Examination Timetables by Computer”, Computer Journal, Vol. 11, pp. 264–268, 1968.Google Scholar
  14. [14]
    Goldberg D.E., Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, Reading, MA, 1989.Google Scholar
  15. [15]
    Lotfi V., Cerveny R., “A Final-Exam-Scheduling Package”, Journal of the Operational Research Society, Vol. 42, No. 3, pp. 205–216, 1991.Google Scholar
  16. [16]
    Peck J.E.L., Williams M.R., “Algorithm 286: Examination Scheduling”, Communications of the ACM, Vol. 9, No. 6, pp 433–434, 1966.Google Scholar
  17. [17]
    Ross P., Corne D., Fang H.-L., “Improving Evolutionary Timetabling with Delta Evaluation and Directed Mutation”, Parallel Problem Solving from Nature III, Y. Davidor ed., Springer-Verlag, 1994.Google Scholar
  18. [18]
    Srinivas M., Patnaik L.M., “Adaptive Probabilities of Crossover and Mutation in Genetic Algorithms”, IEEE Trans. on Systems, Man and Cybernetics, Vol. 24, No. 4, pp. 656–667, 1994.Google Scholar
  19. [19]
    Whitley D., Starkweather, D., “GENITOR-II: A Distributed Genetic Algorithm”, J. Expt. Theor. Artif. Intell., Vol. 2, pp. 189–214, 1990. (As cited in Srinivas&Patnaik, 1994)Google Scholar
  20. [20]
    Wood D.C., “A System for Computing University Examination Timetables”, Computer Journal, Vol. 11, pp. 41–47, 1968.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Ayhan Ergül
    • 1
  1. 1.Department of Computer EngineeringMiddle East Technical UniversityAnkaraTurkey

Personalised recommendations