Optimization of university course scheduling problem with a hybrid artificial bee colony algorithm

2011 IEEE Congress of Evolutionary Computation, CEC 2011

Volumn , Issue , 2011, Pages 339-346

  Oner, Adalet ^a   Ozcan, Sel ^a   Dengi, Derya ^a  

^a YASAR UNIVERSITY   (Turkey)

Author keywords

artificial bee colony algorithm; course scheduling problem; node coloring

Indexed keywords

ARTIFICIAL BEE COLONIES; COURSE SCHEDULING; DISCRETE OPTIMIZATION PROBLEMS; FEASIBLE SOLUTION; FOOD SOURCES; HYBRID ALGORITHMS; KNOWLEDGE IT; NODE COLORING; SOLUTION PROCEDURE; UNIVERSITY COURSE;

CURRICULA; HEURISTIC ALGORITHMS; OPTIMIZATION; SCHEDULING ALGORITHMS; TEACHING;

EVOLUTIONARY ALGORITHMS;

EID: 80052020907     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2011.5949638     Document Type: Conference Paper

References (32)

1. Shiau, D., A hybrid particle swarm optimization for a university course scheduling problem with flexible preferences. Expert Systems with Applications, 38, pp. 235-248, 2011.
2. Pongcharoen, P., Promtet, W., Yenradee, P., and Hicks, C., Stochastic optimisation timetabling tool for university course scheduling. International Journal of Production Economics, 112(2), 903-918, 2008. (Pubitemid 351289080)
3. Gunawan, A., Ng, J. M., & Poh, K. L., Solving the teacher assignment-course scheduling problem by a hybrid algorithm. International Journal of Computer, Information, and System Science, and Engineering, 1(2), 136-141, 2007.
4. Chiarandini, M., Birattari, M., Socha, K., and Rossi-Doria, O., An effective hybrid algorithm for university course timetabling. Journal of Scheduling, 9(5), 403-432, 2006.
5. Karaboga, D., An idea based on honey bee swarm for numerical optimization Technical Report-TR06, Erciyes University, Engineering Faculty, Computer Engineering Department, 2005
6. Azimi, Z. N., Hybrid heuristics for examination timetabling problem. Applied Mathematics and Computation, 163(2), 705-733, 2005.
7. Duong, T. A., & Lam, K. H., Combining constraint programming and simulated annealing on university exam timetabling. In Proceedings of international conference RIVF'04, Hanoi (pp. 205-210), 2004.
8. Wang, Y. Z., Using genetic algorithm methods to solve course scheduling problems. Expert Systems with Applications, 25(1), 39-50, 2003.
9. Chiarandini, M., & Stützle, T., A landscape analysis for a hybrid approximate algorithm on a timetabling problem. TU Darmstadt Technical Report AIDA-03-05, 2003.
10. Alvarez-Valdes, R., Crespo, E., & Tamarit, J. M., Design and implementation of a course scheduling system using tabu search. European Journal of Operational Research, 137(3), 512-523, 2002. (Pubitemid 34086565)
11. Merlot, L. T. G., Boland, N., Hughes, B. D., and Stuckey, P. J,. A hybrid algorithm for the examination timetabling problem. In E. Burke & M. Carter (Eds.), Practice and theory of automated timetabling IV. Lecture notes in computer science (vol. 2740, pp. 207-231). New York: Springer-Verlag, 2002.
12. Wang, Y. Z., An application of genetic algorithm methods for teacher assignment problems. Expert Systems with Applications, 22(4), 295-302, 2002.
13. Badri, M. A., Davis, D. L., Davis, D. F. and Hollingsworth, J., A multi-objective course scheduling Model: combining faculty preferences for courses and times. Computers and Operations Research 25(4), 303-316, 1998.
14. Thompson, J. M., and Dowsland, K. A., A robust simulated annealing based examination timetabling system. Computers and Operations Research, 25(7-8), 637-648, 1998.
15. Drexl, A., & Salewski, F., Distribution requirements and compactness constraints in school timetabling. European Journal of Operational Research, 102(1), 193-214, 1997. (Pubitemid 127397961)
16. Deris, S. B., Ormatu, S., Ohta, H and Samat, P. A., B. D. University timetabling by constraint-based reasoning: a case study. Journal of the Operational Research Society, 48, 1178-1190, 1997. (Pubitemid 127624627)
17. Hultberg, T. H and Cardoso, D. M., The teacher assignment problem: a specialD caseD of fixed chargeD transportation problem. European Journal of Operational Research, 101, 463-473, 1997. (Pubitemid 127399934)
18. Alvarez-Valdes, R., Martin, G. and Tamarit, J. M., Construction good solutions for the Spanish school timetabling problem. Journal of Operational Research Society, vol. 47, pp. 1203-1215, 1996. (Pubitemid 126580553)
19. Carter, M. W., Laporte, G and Lee, S. Y., Examination timetabling: Algorithmic Strategies and Applications. Journal of Operational Research Society, 47, 373-383, 1996. (Pubitemid 126576128)
20. Wright, M., School timetabling using heuristic search. Journal of Operational Research Society, 47, 347-357, 1996. (Pubitemid 126576125)
21. Weare, R., Burke, E., & Elliman, D., A hybrid genetic algorithm for examination timetabling problem. University of Nottingham, Computer Science Technical Report no. NOTTCS-TR-1995-8, 1995.
22. Carter, M. W., Laporte, G and Chinneck, J. W., A general examination scheduling system. Interfaces, 24, 109-120, 1994.
23. Hertz, A., Tabu search for large scale timetabling problems. European Journal of Operataions Research, 54, 39-47, 1991. (Pubitemid 21712572)
24. Carter, M. W., A survey of practical applications examination timetabling algorithms. Operations Research, 34, 193-202, 1986.
25. Laporte, G, and Desroches, S., Examination timetabling by computer. Computers and Operations Research, 11, 351-360, 1984.
26. McClure, R and Wells, C, A mathematical model for faculty course assignment. Decision Science, 15, 409-420, 1984.
27. Mehta, N. K., Application of a graph coloring method to an examination scheduling problem. Interfaces, 11, 57-64, 1981.
28. Tripathy, A., A Lagrangean relaxation approach to course timetabling. Journal of Operational Research Society, 31, 599-603, 1980. (Pubitemid 10487118)
29. J. Brelaz, D., New methods to color the vertices of a graph. Comm. A. CM. 22, pp. 251-256, 1979.
30. Shih, W., and Sullivan, J., Dynamic course scheduling for college faculty via zero-one programming. Decision Science, 8, 711-721, 1977.
31. Lawrie, N. L., An integer linear programming model of a school timetabling problem. The Computer Journal, 12, 307-316, 1969
32. Akkoyunlu, E. A., A linear algorithm for computing the optimum university timetable. The Computer Journal, 16(4), 347-350, 1973.