Hybrid Ant Colony Systems for course timetabling problems

2009 2nd Conference on Data Mining and Optimization, DMO 2009

Volumn , Issue , 2009, Pages 120-126

  Ayob, Masri ^a   Jaradat, Ghaith ^a  

^a UNIVERSITI KEBANGSAAN MALAYSIA   (Malaysia)

Author keywords

Ant Colony System; Course timetabling problem; Simulated annealing; Tabu search

Indexed keywords

ANT ALGORITHMS; ANT COLONY SYSTEMS; BENCHMARK TESTS; COMBINATIONAL OPTIMIZATION; COMPLEX OPTIMIZATION; COURSE TIMETABLING PROBLEM; FIXED NUMBERS; HEURISTIC INFORMATION; HYBRID ANT COLONY SYSTEMS; OPTIMALITY; SOFT CONSTRAINT; TIME SLOTS; TIMETABLING; TIMETABLING PROBLEM; UNIVERSITY COURSE;

ANNEALING; BENCHMARKING; TABU SEARCH;

SIMULATED ANNEALING;

EID: 72449125632     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DMO.2009.5341898     Document Type: Conference Paper

References (30)

1. S. Petrovic and E. K. Burke, "University timetabling", Ch. 45 in the Handbook of Scheduling: Algorithms, Models, and Performance Analysis (eds. J. Leung), Chapman Hall/CRC Press, 2004.
2. S. Even, A. Itai, and A. Shamir, "On the Complexity of Timetable and Multi commodity Flow Problem", SIAM J. Comput., 5(4): 691-703. 1976.
3. K. Socha, M. Samples, and M. Manfrin, "Ant algorithm for the university course timetabling problem with regard to the state-of-the-art", The Proceedings of the 3 European Workshop on Evolutionary Computation in Combinatorial Optimisation, Essex, UK, Lecture Notes in Computer science 2611, Springer-Verlag, 2003, pp. 334-345.
4. M. Chiarandini, M. Birattari, K. Socha, and O. Rossi-Doria, "An effective hybrid approach for the University Course Timetabling Problem", Springer Science + Business Media, JSched (2006) vol. 9, pp. 403-432. 2006.
5. J. Frausto-Solís, F. Alonso-Pecina, and J. Mora-Vargas, "An Efficient Simulated Annealing Algorithm for Feasible Solutions of Course Timetabling", In A. Gelbukh and E.F. Morales (Eds.): MICAI 2008, LNAI 5317, Springer-Verlag Berlin Heidelberg 2008, pp. 675-685, 2008.
6. O. Rossi-Doria, M. Samples, M. Birattari, M. Chiarandini, M. Dorigo, L. M. Gambardella, J. Knowels, M. Manfrin, M. Mastrolilli, B. Paechter, L. Paquete, and T. Stultzle, "A Comparison of the Performance of Different Metaheuristics on the Timetabling Problem", Lecture Notes in Computer Science, Berlin, Germany, Springer, 2003, vol. 2740, pp. 329-351.
7. P. Kostuch, "The University Course Timetabling problem with a Three Phase Approach". In Practice and Theory of Automated Timetabling V, Springer Berlin/Heidelberg, Vol. 3616/2005.
8. R. Bai, E. K. Burke, G. Kendall, and B. McCollum, "A simulated annealing hyper-heuristic for university course timetabling". In Proceedings of the 6th international conference on the practice and theory of automated timetabling (PATAT'06), pp. 345-350. 2006.
9. rd International Workshop on Ant Algorithms, ANTS 2002, Lecture Notes in Computer Science, 2002, 2463 (10), pp 1-13.
10. N. Ejaz and M. Javed, "An Approach for Course Scheduling Inspired by Die-Hard Co-Operative Ant Behavior", Proceedings of the IEEE International Conference on Automation and Logistics August 18 - 21, 2007, Jinan, China.
11. S. Abdullah, E.K. Burke and B. McCollum, "An investigation of a variable neighbourhood search approach for course timetabling", The Proceedings of the 2nd Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA 2005), New York, USA, pp. 413-427, 2005.
12. th United Kingdom Workshop on Computational Intelligence (UKCI05), London, UK, September 5th-7th, 302-309, 2005.
13. E. K. Burke, B. McCollum, A. Meisels, S. Petrovic, R. Qu, "A Graph-Based Hyper-Heuristic for Educational Timetabling Problems", European Journal of Operational Research, 2005.
14. S. Abdullah, E.K. Burke and B. McCollum, "Using a Randomised Iterative Improvement Algorithm with Composite Neighbourhood Structures for the University Course Timetabling Problem". In Metaheuristics - Progress in Complex Systems Optimization (Doerner K. F., Gendreau M., Greistorfer P., Gutjahr W. J., Hartl R. F., and Reimann M., Eds.), Computer Science Interfaces Book Series, Springer Operations Research, ISBN-13:978-0-387-71919-1, Vol 39, pp 153-169, 2007.
15. S. Abdullah, E.K. Burke, B. McCollum, "A hybrid evolutionary approach to the university course timetabling problem", In Proceedings of the IEEE Congress on Evolutionary Computation. Singapore, September 2007.
16. P. McMullan, "An Extended Implementation of the Great Deluge Algorithm for Course Timetabling", ICCS International Conference of Computational Science, Part I, LNCS Lecture Note in Computer Science, vol. 4487, pp. 538-545, Springer-Verlag Berlin Heidelberg, Germany, 2008.
17. D. Landa-Silva, and J. H. Obit, "Great Deluge with Non-linear Decay Rate for Course timetabling Problems", 2008 4th International IEEE Conference Intelligent Systems, 978-1-4244-1739-1/08/, 2008.
18. S. Abdullah, and H. Turabieh, "Generating University Course Timetabling Using Genetic Algorithm and Local Search", In the Third 2008 International Conference on Convergence and Hybrid Information Technology ICCIT, vol. I, 254-260, 2008.
19. S. Abdullah, and H. Turabieh, "Electromagnetic Like Mechanism and Great Deluge for Course Timetabling Problems", In the First 2008 Seminar on Data Mining and Optimization DMO, vol. I, ISBN 9778-967-5048-36-4, 21-25, 2008.
20. (2002) IRIDIA, Universite Libre de Bruxelles Website. [Online]. Available: http://iridia.ulb.ac.be/~msampels/tt.data/. Accessed 25 July 2009.
21. M. Dorigo, M. Birattari, and T. Stutzle, "Ant colony optimization", IEEE Computational Intelligence Magazine, 1(4):28-39, 2006.
22. E. Bonabeau, M. Dorigo, and G. Theraulaz, "From Natural to Artificial Swarm Intelligence", Oxford University Press, Oxford, 1999.
23. M. Dorigo, V. Maniezzo, and A. Colorni, "The Ant system: optimization by a colony of cooperating Agents". IEEE Transactions on Systems, Man, and Cybernetics-Part B, 26(1):29-41, 1996.
24. M. Dorigoa, B. Christian, "Ant Colony Optimization: A Survey", Elsevier B.V., doi:10.1016/j.tcs.2005.05.020. Theoretical Computer Science 344 (2005) 243 - 278. 2005.
25. P. Merz and B. Freisleben, "A Comparison of Memetic Algorithms, Tabu Search, and Ant Colonies for the Quadratic Assignment Problem". Evolutionary Computation, 1999. CEC 99. Proceedings of the 1999 Congress on Volume 3, Issue, 1999, Page(s): -2070 Vol. 3. doi: 10.1109/CEC.1999.785529.
26. M. Dorigo, L.M. Gambardella, "Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem". IEEE Trans. Evolutionary Computation 1, 1997, pp. 53-66. 1997.
27. (2002) Metaheuristics Network website. [Online]. Available: http://www.metaheuristics.net/. Accessed 25 July 2009.
28. H.H. Hoos, and T. Stutzle, "Stochastic Local Search: Foundations and Applications (2005)", Elsevier/Morgan Kaufmann, San Francisco. Mathematical Methods Of Operation Research, ISBN 1-55860-872-9658, Vol. 63, No. 11 February 2006, pp. 193-194. 2006.
29. (2002) International Timetabling Competition website. [Online]. Available: http://www.idsia.ch/Files/ttcomp2002/. Accessed 25 July 2009.
30. N. Liouane, I. Saad, S. Hammadi, and P. Borne, "Ant System & Local Search Optimization for flexible Job Shop Scheduling Production", The International Journal of Computers, Communications & Control, Vol. II (2007), No. 2, pp. 174-184, 2007.