Journal of the Korea Society of Computer and Information (한국컴퓨터정보학회논문지)

Korean Society of Computer Information (한국컴퓨터정보학회)
권호 표지
DOI QR코드

DOI QR Code

Chromatic Number Algorithm for Exam Scheduling Problem

시험 일정 계획 수립 문제에 관한 채색 수 알고리즘

  • Lee, Sang-Un (Dept. of Multimedia Eng., Gangneung-Wonju National University)
  • 이상운 (강릉원주대학교 멀티미디어공학과)
  • Received : 2015.01.21
  • Accepted : 2015.03.04
  • Published : 2015.04.30
Download PDF
⟨ Previous Next ⟩

Abstract

The exam scheduling problem has been classified as nondeterministic polynomial time-complete (NP-complete) problem because of the polynomial time algorithm to obtain the exact solution has been unknown yet. Gu${\acute{e}}$ret et al. tries to obtain the solution using linear programming with $O(m^4)$ time complexity for this problem. On the other hand, this paper suggests chromatic number algorithm with O(m) time complexity. The proposed algorithm converts the original data to incompatibility matrix for modules and graph firstly. Then, this algorithm packs the minimum degree vertex (module) and not adjacent vertex to this vertex into the bin $B_i$ with color $C_i$ in order to exam within minimum time period and meet the incompatibility constraints. As a result of experiments, this algorithm reduces the $O(m^4)$ of linear programming to O(m) time complexity for exam scheduling problem, and gets the same solution with linear programming.

시험 일정 계획 수립 문제는 정확한 해를 다항시간으로 구하는 알고리즘이 알려져 있지 않은 NP-완전이다. 이 문제에 대해, Gu${\acute{e}}$ret et al.은 $O(m^4)$ 수행 복잡도의 선형계획법으로 해를 얻고자 하였다. 반면에, 본 논문에서는 O(m) 복잡도의 채색 수 알고리즘을 제안하였다. 제안된 방법은 원 데이터를 교과목에 대한 부적합성 행렬과 그래프로 변환시켰다. 다음으로, 부적합성 제약조건을 충족하면서 최소의 시간으로 시험을 치루기 위해, 최소 차수 정점(교과목)부터 인접하지 않은 정점들을 $C_i$ 색으로 배정하여 $B_i$ 상자에 채웠다. 실험 결과, 제안된 알고리즘은 시험 일정 계획 수립 문제에 대해 선형계획법의 $O(m^4)$를 O(m)으로 단축시키면서도 동일한 해를 얻었다.

Keywords

References

  1. C. Gueret, X. Prins, andM. Sevaux, "Applications of Optimizationwith Xpress-MP: 14.4 ExamScheduling," Dash Optimization Ltd., pp. 220-221, Feb. 2005.
  2. M. Edvall, "ExamScheduling," TomlabOptimization Inc, http://tomsym.com/examples/tomsym_examscheduling.html, Apr. 2009.
  3. E. Falkenauer, "AHybridGrouping Genetic Algorithm for Bin Packing," Journal of Heuristics, Vol. 2, No. 1, pp 5-30, Aug. 1996. https://doi.org/10.1007/BF00226291
  4. M.Malkawi.M. A.H. Hassan, andO. A.H. Hassan, "A New Exam Scheduling Algorithm Using Graph Coloring," The International Arab Journal of Information Technology, Vol. 5, No. 1, pp. 80-87, Jan. 2008.
  5. F. T. Leighton, "AGraph Coloring Algorithmfor Large Scheduling Problems," Journal of Research of the National Bureou of Standards, Vol. 84, No. 6, pp. 489-506, Nov. 1979. https://doi.org/10.6028/jres.084.024
  6. A. Akbulut andG. Yilmaz, "UniversityExamScheduling SystemUsing Graph Coloring Algorithmand RFID Technology," International Journal of Innovation, Management and Technology, Vol. 4, No. 1, pp. 66-72, Feb. 2013.
  7. D. Kordalewski, C. Liu, and K. Salvesen, "Solving an ExamScheduling ProblemUsing a Genetic Algorithm," Department of Statistics, University of Toronto, Toronto, Canada, TR-2009-1, 2009.
  8. O. T. Arogundade, A. T. Akinwale, andO.M. Aweda, "A Genetic Algorithm Approach for a Real-World University Examination Timetabling Problem," International Journal of Computer Applications, Vol. 12, No. 5, pp. 1-4, Dec. 2012. https://doi.org/10.5120/1678-2083
  9. G.White, B. Xie, and S. Zonjic, "Using Tabu Search with Longer TermMemory and Relaxation to Create Examination Timetables", European Journal of Operational Research, Vol. 153, No. 16, pp.80-91, Feb. 2004. https://doi.org/10.1016/S0377-2217(03)00100-0
  10. M. Eley, "Ant Algorithms for the ExamTimetabling Problem," Proceedings of the 6th International Conference on Practice and Theory of Automated Timetabling VI, Lecture Notes in Computer Science Vol. 3867, pp. 364-382, Aug. 2007.
  11. C.Marco, B. Mauro, and S. Krzysztof, "An Effective Hybrid Algorithmfor University Course Timetabling", Journal of Scheduling, Vol. 9, No. 5, pp. 403-432, Oct. 2006. https://doi.org/10.1007/s10951-006-8495-8
  12. L. T. G.Merlot, N. Boland, B. D. Hughes, and P. J. Stuckey, "A Hybrid Algorithmfor the Examination Timetabling Problem," 4th International Conference on Practice and Theory of Automated Timetabling IV, Lecture Notes in Computer Science, Vol. 2740, pp. 207-231. Aug. 2002.