Great deluge with non-linear decay rate for solving course timetabling problems

2008 4th International IEEE Conference Intelligent Systems, IS 2008

Volumn 1, Issue , 2008, Pages 811-818

  Landa Silva, Dario ^a   Obit, Joe Henry ^a  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

Author keywords

Course timetabling; Great deluge algorithm; Local search; Meta heuristics

Indexed keywords

COMPLEX PROBLEMS; COURSE TIMETABLING; DECAY RATE; EDUCATIONAL INSTITUTIONS; GREAT DELUGE ALGORITHM; LOCAL SEARCH; META-HEURISTICS; NON-LINEAR; NON-LINEAR DECAY; TIME SLOTS; TIMETABLING; TIMETABLING PROBLEM;

DECAY (ORGANIC); HEURISTIC METHODS; INTELLIGENT SYSTEMS; WATER LEVELS;

ALGORITHMS;

EID: 67249127885     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IS.2008.4670447     Document Type: Conference Paper

References (16)

1. T. Cooper and H. Kingston, "The complexity of timetable construction problems," in Selected Papers from the 1st International Conference on the Practice and Theory of Automated Timetabling (PATAT 1995), LNCS 1153. Springer, 1996, pp. 283-295.
2. K. Socha, J. Knowles, and M. Samples, "A max-min ant system for the university course timetabling problem," in Ant Algorithms: Proceedings of the Third International Workshop (ANTS 2002), LNCS 2463. Springer, 2002, pp. 1-13.
3. G. Dueck, "New optimization heuristics: The great deluge algorithm and the record-to-record travel," Journal of Computional Physics, vol. 104, pp. 86-92, 1993.
4. A. Schaerf, "A survey of automated timetabling," Artificial Intelligence Review, vol. 13(2), pp. 87-127, 1999.
5. K. Socha, M. Sampels, and M. Manfrin, "Ant algorithms for the university course timetabling problem with regard to the state-of-the-art," in Applications of Evolutionary Computing: Proceedings of the 2003 EvoWorkshops, LNCS 2611. Springer, 2003, pp. 334-345.
6. E. Burke, G. Kendall, and E. Soubeiga, "A tabu-search hyperheuristic for timetabling and rostering," Journal of Heuristics, vol. 9, pp. 451-470, 2003.
7. O. Rossi-Doria, M. Sampels, M. Birattari, M. Chiarandini, M. Dorigo, L. Gambardella, J. Knowles, M. Manfrin, M. Mastrolilli, B. Paechter, L. Paquete, and T. Sttzle, "A comparion of the performance of di.erent metaheuristics on the timetabling problem," in Selected Papers from the 4th International Conference on the Practice and Theory of Automated Timetabling (PATAT 2002), LNCS 2740. Springer, 2003, pp. 330-352.
8. H. Asmuni, E. Burke, and J. Garibaldi, "Fuzzy multiple heuristic ordering for course timetabling," in Proceedings of the 5th United Kingdom Workshop on Computational Intelligence (UKCI 2005), 2005, pp. 302-309.
9. S. Abdullah, E. Burke, and B. McCollum, "An investigation of variable neighbourhood search for university course timetabling," in Proceedings of MISTA 2005: The 2nd Multidisciplinary Conference on Scheduling: Theory and Applications, 2005, pp. 413-427.
10. -, Metaheuristics - Progress in Complex Systems Optimization. Springer, 2007, ch. Using a Randomised Iterative Improvement Algorithm with Composite Neighborhood Neighborhood Structures for University Course Timetabling, pp. 153-172.
11. E. Burke, B. McCollum, A. Meisels, S. Petrovic, and R. Qu, "A graph-based hyper-heuristic for educational timetabling problems," European Journal of Operational Research, vol. 176, pp. 177-192, 2007.
12. S. Abdullah, E. Burke, and B. McCollum, "A hybrid evolutionary approach to the university course timetabling problem," in Proceedings of CEC 2007: The 2007 IEEE Congress on Evolutionary Computation, 2007, pp. 1764-1768.
13. E. Aarts and J. E. Korts, Simulated annealing and boltzman machines. Wiley, 1998.
14. E. Burke, Y. Bykov, J. Newall, and S. Petrovic, "A timeprede fined approach to course timetabling," Yugoslav Journal of Operations Research, vol. 13(2), pp. 139-151, 2003.
15. M. Chiarandini, M. Birattari, K. Socha, and O. Rossi-Doria, "An effective hybrid algorithm for university course timetabling," Journal of Scheduling, vol. 9(5), pp. 403-432, 2006.
16. S. Casey and J. Thompson, "Grasping the examination scheduling problem," in Selected Papers from the 4th International Conference on the Practice and Theory of Automated Timetabling (PATAT 2002), LNCS 2740. Springer, 2003, pp. 231-243.