The Transactions of the Korea Information Processing Society (한국정보처리학회논문지)

Korea Information Processing Society (한국정보처리학회)
권호 표지

A Study of Genetic ALgorithm for Timetabling Problem

시간표 문제의 유저자 알고리즘을 이요한 해결에 관한 연구

  • 안종일 (용인송담대학 컴퓨터소프트웨어과)
  • Published : 2000.06.01
Download PDF
⟨ Previous Next ⟩

Abstract

This paper describes a multi-constrained university timetabling problem that is a one of the field of artificial intelligent research area. For this problem, we propose the 2type edge graph that is can be represented time-conflict and day-conflict constraints simultaneously. The genetic algorithms are devised and considered for it. And we describe a method of local search in traditional random operator for its search efficiency. In computational experiments, the solutions of proposed method are average 71% costs that ware compared with solutions of random method in 10,000 iterations.

본 논문은 인공지능의 한 연구 분야인 다중 제약을 갖든 대학의 시간표 작성 문제를 해결하는 것으로서, 이를 위해 두 강좌 간의 시간 충동 제약과 요일 충동 제약을 동시에 표현 가능하도록 2-유형 에지(edge) 그래프를 정의하였다. 또한 이를 유전자 알고리즘으로 해결하는 방법을 제안하고 무작위 탐색의 효율을 높이기 위해 국부 탐색을 수행하는 방법을 소개하였다. 본 논문에서는 제안된방버버이 실험결과가 무작위 탐새고가비교하여 탐색 비용을 10000번의 반복횟수에서 평균 71% 달한 것으로 나타났다.

Keywords

References

  1. Ahn J.I., and Chung T.C., 'Graph coloring algorithm to Make Timetable for Lessons Requiring :Multiple Slots,' Proceedings of the 2nd international Conference on the Practice and Theory of Automated Timetabling. pp.281- 284, 1997
  2. Burke E.K, Elliman D.G' 'A University Timetabling System based on Graph coloring and Constraint Manipulation,' Journal of research on computing in Education,Vol.27, No.1, pp,1-18, 1993
  3. Cangalovic M. and Schreuder J.A.M., 'Exact coloring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths,' European Journal of Operational Research 51, pp.248-258, 1991 https://doi.org/10.1016/0377-2217(91)90254-S
  4. Clementson A.T. and Elphick C.H., 'Approximate Colouring Algorithms for Composite Graphs.' Operational Research Vol 34, No.6, pp.503-509. 1983 https://doi.org/10.2307/2581125
  5. Ferland J., 'Generalized Assignment-Type Problems: A Powerful Modeling Scheme,' Proceedings of the 2nd international Conference on the Practice and Theory of Automated Timetabling, pp.27-54, 1997
  6. Jensen T.R and Toft B., 'Graph Coloring Problems,' Wiley- Interscience publication, pp.7-8, 1995
  7. Krarup J. and D. de Werra, 'Chromatic Optimization : Limitation, Objectives, Uses, References,' European Journal of Operational research 11, (1982), pp. 1-19 https://doi.org/10.1016/S0377-2217(82)80002-7
  8. Lawton G., 'Genetic Algorithms for Scheduling Optimization,' AI Expert, pp.23-29, 1992
  9. Schaerf A., 'A Survey of Automated Timetabling,' Center voor Wiskunde en Infomatica Report CSR9567, 1995
  10. Werra D. de, 'An Introduction to timetabling,' European Journal of Operational Research 19, pp,151-162, 1985
  11. Winston P.H, 'Genetic Algorithms Artificial Intelligence 3rd.' Addison-Wesley publishing Company, pp.505-528, 1992
  12. Taghi Ariani, 'A Three Phased Approach To Final Exam Scheduling,' Vol.21, No.1, IIE Transaction, pp. 86-96, March 1989 https://doi.org/10.1080/07408178908966211