A hybrid simulated annealing with Kempe Chain neighborhood for the university timetabling problem

Proceedings - 6th IEEE/ACIS International Conference on Computer and Information Science, ICIS 2007; 1st IEEE/ACIS International Workshop on e-Activity, IWEA 2007

Volumn , Issue , 2007, Pages 400-405

  Tuga, Mauritsius ^a   Berretta, Regina ^a   Mendes, Alexandre ^a  

^a UNIVERSITY OF NEWCASTLE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ANNEALING; COMMUNICATION; CYBERNETICS; HEURISTIC METHODS; INFORMATION MANAGEMENT; INFORMATION SCIENCE; KNOWLEDGE MANAGEMENT; STANDARDS; STEEL ANALYSIS;

CURRENT STATE; DATA SETS; FEASIBLE SOLUTIONS; GRAPH-BASED; HARD CONSTRAINTS; IN ORDER; INTERNATIONAL (CO); INTERNATIONAL CONFERENCES; PAPER ADDRESSES; RELAXED PROBLEM; SIMULATED ANNEALING (SA); SOFT CONSTRAINTS; TIMETABLING PROBLEMS; UNIVERSITY COURSES;

SIMULATED ANNEALING;

EID: 46749122246     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICIS.2007.25     Document Type: Conference Paper

References (23)

1. S. Abdullah, E. Burke, and B. McCollum. An investigation of variable neighbourhood search for university course timetabling. In Proceedings of MISTA2005: The 2nd Multidisciplinary Conference on Scheduling: Theory and Applications, pages 413-427, New York, USA, 2005.
2. S. Abdullah, E. Burke, and B. McCollum. A randomised iterative improvement algorithm with composite neighbourhood structures for university course timetabling. In Proceedings of MIC05: The 6th Metaheuristic International Conference, Vienna, Austria, 2005.
3. V. Bardadym. Computer-aided school and university timetabling: The new wave. In E. Burke and P. Ross, editors, Proceedings of PATAT95, volume 1153 of Lecture Notes in Computer Science, pages 22-45. Springer-Verlag, Berlin, 1995.
4. E. Burke, A. Eckersley, B. McCollum, S. Petrovic, and R. Qu. Hybrid variable neighbourhood approaches to university exam timetabling. Technical Report NOTTCS-TR-2006-2, University of Nottingham, School of CSiT, 2006.
5. 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, 176:177-192, 2007.
6. Centre of Emergent Computing. http://www.emergentcomputing.org/ timetabling/harderinstances.htm, 2007.
7. M. Chiarandini, K. Socha, M. Birattari, and O. Rossi-Doria. An effective hybrid approach for the university course timetabling problem. Technical Report AIDA-03-05, TU Darmstadt, FG Intellektik, 2003.
8. S. Deris, S. Omatu, and H. Ohta. Timetabling planning using the constraint-based reasoning. Computers & Operations Research, 27:819-840, 2000.
9. J. K. E.K. Burke and D. de Werra. Applications to timetabling. In J. Gross and J. Yellen, editors, Handbook of Graph Theory, pages 445-474. Chapman Hall/CRC Press, 2004.
10. M. Elmohamed, P. Coddington, and G. Fox. A comparison of annealing techniques for academic course scheduling. In E. Burke and M. Carter, editors, Proceedings of PATAT'97, volume 1408 of Lecture Notes in Computer Science, pages 92-114. Springer-Verlag, Berlin, 1997.
11. S. Kirkpatrick, C. Gelatt, and M. Vecchi. Optimization by simulated annealing. Science, 4598:671-680, 1983.
12. P. Kostuch. The university course timetabling problem with a three-phase approach. In E. Burke and M. Trick, editors, Proceedings of PATAT 2004, volume 3616 of Lecture Notes in Computer Science, pages 109-125. Springer-Verlag, Berlin, 2004.
13. R. Lewis and B. Paechter. Finding feasible timetables using group based operators. IEEE Transactions on Evolutionary Computation, to appear.
14. R. Lewis and B. Paechter. Application of the grouping genetic algorithm to university course timetabling. In G. Raidl and J. Gottlieb, editors, Proceedings of EvoCOP 2005, volume 3448 of Lecture Notes in Computer Science, pages 144-153. Springer-Verlag, Berlin, 2005.
15. L. Merlot, N. Boland, B. Hughes, and P. Stuckey. A hybrid algorithm for the examination timetabling problem. In E. Burke and P. De Causmaecker, editors, Proceedings of PATAT 2002, volume 2740 of Lecture Notes in Computer Science, pages 207-231. Springer-Verlag, Berlin, 2002.
16. Metaheuristic Network. http://www.idsia.ch/files/ttcomp2002, 2007.
17. P. Ross, D. Corne, and H. Fang. Improving evolutionary timetabling with delta evaluation and direct mutation. Lecture Notes in Computer Science, 866:556-565, 1994.
18. O. Rossi-Doria et al. A comparison of the performance of different metaheuristics on the timetabling problem. In E. Burke and P. De Causmaecker, editors, Proceedings of PATAT 2002, volume 2740 of Lecture Notes in Computer Science, pages 329-351. Springer-Verlag, Berlin, 2002.
19. K. Socha, J. Knowles, and M. Sampels. A max-min ant system for the university course timetabling problem. In M. Dorigo et al., editor, Proceedings of ANTS 2002, volume 2463 of Lecture Notes in Computer Science, pages 1-13. Springer-Verlag, Berlin, 2002.
20. V. Tam and D. Ting. Combining the min-conflicts and look-forward heuristics to effectively solve a set of hard university timetabling problems. In Proceedings of ICTAT'03: The 15th IEEE International Conference on Tools with Artificial Intelligence, page 492, Sacramento, USA, 2003.
21. J. Thompson and K. Dowsland. General colling schedules for a simulated annealing based timetabling system. In E. Burke and P. Ross, editors, Proceedings of PATAT'95, volume 1153 of Lecture Notes in Computer Science, pages 345-363. Springer-Verlag, Berlin, 1995.
22. J. Thompson and K. Dowsland. A robust simulated annealing based examination timetabling system. Computers & Operations Research, 25:637-648, 1998.
23. G. White and J. Zhang. Generating complete university timetables by combining tabu search with constraint logic. In E. Burke and M. Carter, editors, Proceedings of PATAT'97, volume 1408 of Lecture Notes in Computer Science, pages 187-200. Springer-Verlag, Berlin, 1997.