Investigating a round robin strategy over multi algorithms in optimising the quality of university course timetables

International Journal of Physical Sciences

Volumn 6, Issue 6, 2011, Pages 1452-1462

  Abdullah, Salwani ^a   Shaker, Khalid ^a   Shaker, Hothefa ^b  

^a UNIVERSITI KEBANGSAAN MALAYSIA   (Malaysia)

^b Universiti Tenaga Nasional   (Malaysia)

Author keywords

Great deluge; Hill climbing algorithm; Round robin; Simulated annealing; University course timetabling problem

Indexed keywords

EID: 79957936133     PISSN: 19921950     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (35)

1. Abdullah S, Turabieh H (2008). Generating university course timetable using genetic algorithms and local search. The Third int. Conf. Convergence Hybrid Inf. Technol., ICCIT, 1: 254-260.
2. Abdullah S, Burke EK, McCollum B (2007). A Hybrid Evolutionary Approach to the University Course Timetabling Problem. IEEE Congress on Evolutionary Computation, ISBN: 1-4244-1340-0, pp. 1764-1768.
3. Abdullah S, Burke EK, McCollum B (MISTA 2005). An investigation of variable neighbourhood search for university course timetabling. The 2nd Multidisciplinary International Conference on Scheduling: Theory and Applications.
4. Abdullah S, Burke EK, McCollum B (2007). Using a Randomised Iterative Improvement Algorithm with Composite Neighbourhood Structures for University Course Timetabling. In: Metaheuristics Progress in Complex Systems Optimization, Springer, pp. 153-169.
5. Abdullah S, Shaker K, McCollum B, McMullan P (2010). Dual Sequence Simulated Annealing with Round-Robin Approach for University Course Timetabling. EVOCOP 2010, LNCS 6022, Springer-Berlin /Heidelberg, pp. 1-10.
6. Al-Betar M, Khader A, Yi Liao I (2010). A Harmony Search with Multipitch Adjusting Rate for the University Course Timetabling. In: Z.W. Geem: Recent Advances in Harmony Search Algorithm. SCI, Springer, Heidelberg, 270: 147-161.
7. Asmuni H, Burke EK, Garibaldi JM (2005). Fuzzy multiple heuristic ordering for course timetabling. The Proceedings of the 5th United Kingdom Workshop on Computational Intelligence (UKCI05), pp. 302-309.
8. Burke EK, Bykov Y, Newall J, Petrovic S (2003). A Time-Predefined Approach to Course Timetabling. Yugoslav J. Oper. Res., (YUJOR), 13(2): 139-151.
9. Burke EK, Kendall G, Soubeiga E (2003). A tabu search hyperheuristic for timetabling and rostering. J. Heuristics, 9(6): 451-470.
10. Burke EK, Marěcek J, Parkes AJ, Rudová H (2009). Decomposition, reformulation, and diving in university course timetabling, Comp. Oper. Res., doi:10.1016/j.cor.2009.02.023.
11. Burke EK, McCollum B, Meisels A, Petrovic S, Qu R (2007). A Graph-Based Hyper Heuristic for Educational Timetabling Problems, Eur. J. Oper. Res., 176(1): 177-192.
12. Cesco De F, Di Gaspero L, Schaerf A (2008). Benchmarking curriculum-based course timetabling: Formulations, data format, instances, validation and results. In Proceedings of the 7th PATAT Conference.
13. Chiarandini M, Birattari M, Socha K, Rossi-Doria O (2006). An effective hybrid algorithm for university course timetabling. J. Scheduling, 9(5): 403-432
14. Clark M, Henz M, Love B (2008). QuikFix: A repair-based timetable solver. In Proceedings of the 7th PATAT Conference.
15. Di Gaspero L, McCollum B, Schaerf A (2007). The Second International Timetabling Competition (ITC2007): Curriculum-based Course Timetabling Track3, the 14th RCRA workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion.
16. Dimopoulou M, Miliotis P (2004). An automated university course timetabling system developed in a distributed environment: A case study. Eur. J. Oper. Res., 153(1): 136-147.
17. Gaspero LD, Schaerf A (2003). Multi-neighbourhood local search with application to course timetabling. In Emund Burke and Patrick De Causmaecker, editors. Proceedings of the 4th International Conference on the Practice and Theory of Automated Timetabling (PATAT-2002), selected papers, volume 2740 of Lecture Notes in Computer Science, Springer, pp. 262-275.
18. Geiger MJ (2008). An application of the threshold accepting metaheuristic for curriculum-based course timetabling. In Proceedings of the 7th PATAT Conference.
19. Glover F, Laguna M (1997). Tabu Search. Kluwer Academic, Boston
20. Kostuch P, Socha K (2004). Hardness Prediction for the University Course Timetabling Problem. Proceedings of the Evolutionary Computation in Combinatorial Optimization (EvoCOP 2004), Coimbra, Portugal. Springer Lecture Notes Comput. Sci., 3004: 135-144.
21. Kostuch P (2005). The university course timetabling problem with a three-phase approach. Practice and Theory of Automated Timetabling V (eds. Burke and Trick), Springer Lecture Notes in Comput. Sci., 3616: 109-125.
22. Lach G, Lubbecke ME (2008). Curriclum-based course timetabling: Optimal solutions to the udine benchmark instances. In Proceedings of the 7th PATAT Conference.
23. Landa-Silva D, Obit JH (2008). Great Deluge with Nonlinear Decay Rate for Solving Course Timetabling Problems. Proceedings of the 2008 IEEE Conference on Intelligent Systems (IS 2008). IEEE Press, 8: 11-8.18.
24. Lewis R, Paechter B (2004). New crossover operators for timetabling with evolutionary algorithms. Proceedings of the 5th International Conference on Recent Advances in Soft Computing (ed. Lotfi), UK, December 16th-18th, pp. 189-194.
25. Lewis R (2008). A survey of metaheuristic-based techniques for university timetabling problems. OR Spectr., 30(1): 167-190
26. Lu Z, Hao J (2009). Adaptive Tabu Search for Course Timetabling. Eur. J. Oper. Res., doi:10.1016.j.ejor.2008.12.007.
27. Lu Z, Hao J (2008). Solving the Course Timetabling Problem with a Hybrid Heuristic Algorithm. AIMSA 2008, LNAI, Springer-Verlag Berlin Heidelberg, 5253: 262-273.
28. McCollum B (2007). A perspective on bridging the gap between theory and practice in university timetabling. LNCS 3867, Springer-Verlag, 3-23.
29. McCollum B, Burke EK, McMullan P (2010). A review and description of datasets, formulations and solutions to the University Course Timetabling Problem. To be submitted April 2010 to the J. Scheduling.
30. McMullan P (2007). An Extended Implementation of the Great Deluge Algorithm for Course Timetabling. Lecture Notes Comput. Sci., Springer, 4487: 38-545.
31. Müller T (2008). ITC2007: Solver Description. Proceedings of the 7th International Conference on the Practice and Theory of Automated Timetabling.
32. Ross P, Corne D (1995). Comparing genetic algorithms, simulated annealing, and stochastic hill climbing on timetabling problems. In: GOOS, G. HARTMANIS, J. and LEEUWEN, J. (eds.) Evolutionary Computation, AISB Workshop, 94-102. Lecture Notes in Computer Science, Springer-Verlag, Sheffield, p. 993.
33. Shaker K, Abdullah S (2009). Incorporating Great Deluge Approach with Kempe Chain Neighbourhood Structure for Curriculum-Based Course Timetabling Problems. 2nd IEEE Conference on Data Mining and Optimization (DMO'09), pp. 149-153.
34. Socha K, Knowles J, Samples M (2002). A max-min ant system for the university course timetabling problem. Proceedings of the 3rd International Workshop on Ant Algorithms (ANTS 2002), Springer Lecture Notes in Comput. Sci., 2463: 1-13.
35. Turabieh H, Abdullah S (2009). McCollum, B.: Electromagnetism-like Mechanism with Force Decay Rate Great Deluge for the Course Timetabling Problem. In: RSKT 2009. LNCS, Springer, Heidelberg, 5589: 497-504.