A multi-start very large neighbourhood search approach with local search methods for examination timetabling

ICAPS 2006 - Proceedings, Sixteenth International Conference on Automated Planning and Scheduling

Volumn 2006, Issue , 2006, Pages 334-337

  Abdullah, Salwani ^a   Burke, Edmund K ^a  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATION; GRAPH THEORY; PHASE SPACE METHODS; PLANNING; PROBLEM SOLVING;

2 PHASE APPROACH; HYBRIDISATION; LOCAL SEARCH METHODS; TIMETABLING;

SCHEDULING;

EID: 33746036833     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. Abdullah, S., Ahmadi, S., Burke, E.K., Dror, M. 2006. Investigating Ahjuja-Orlin's Large Neighbourhood Search Approach for Examination Timetabling. Accepted for publication in OR Spectrum, to appear 2006.
2. Ahuja, R.K., Magnanti, L.T., Orlin, J.B. 1993. Network Flows: Theory. Algorithms, and Applications. ISBN 1000499012, Prentice Hall, New Jersey, 133-165.
3. Ahuja, R.K., Orlin, J.B., Sharma, D. 2001. Multiexchange Neighbourhood Search Algorithm for Capacitated Minimum Spanning Tree Problem. Math Problem 91, 71-97.
4. Ahuja, R.K., Ozlem Ergun, Orlin, J.B., Abraham, O. Punnen. 2001. A Survey Of Very Large-scale Neighborhood Search Techniques, Discrete Applied Mathematics 123, 75-102.
5. Ahuja, R.K., Orlin, J.B., Sharma, D. 2003. A Composite Neighbourhood Search Algorithm for Capacitated Spanning Tree Problem. Operations Research Letters 31, 185-194.
6. Asmuni, H., Burke, E.K., and Garibaldi, J.M. 2005. Fuzzy Multiple Ordering Criteria for Examination Timetabling. In Edmund Burke and Michael Trick, editors. The Practice and Theory of Automated Timetabling. Lecture Notes in Computer Science 3616. Springer-Verlag, Berlin, 334-353.
7. Ayob, M., Kendall, G. 2003. A Monte Carlo Hyper-Heuristic To Optimise Component Placement Sequencing For Multi Head Placement Machine. Proc. of the International Conference on Intelligent Technologies, In Teeh'03, Chiang Mai, Thailand, 132-141.
8. Brelaz, D. 1979. New Methods to Color the Vertices of A Graph. Communication of the ACM 22(4), 251-256.
9. Burke, E.K., Petrovic, S. 2002. Recent Research Direction in Automated Timetabling. European Journal of Operational Research 140, 266-280.
10. Burke, E.K., Newall, J.P. 2003. Enhancing Timetable Solutions with Local Search Methods. In Edmund Burke and Patrick De Causniaecker. editors. The Practice and Theory of Automated Timetabling. Lecture Notes in Computer Science 2740. Springer-Verlag, Berlin, 195-206.
11. Burke, E.K., Bykov, Y., Newall, J.P., Petrovic, S. 2004. A Time-Predefined Local Search Approach to Exam Timetabling Problem. IIE Transactions 36(6), 509-528.
12. Burke, E.K., Amnon Meisels, Petrovic, S. and Qu, R. 2006. A Graph-Based Hyper Heuristic for Timetabling Problems. Accepted for publication in the European Journal of Operational Research, to appear 2006.
13. Carter, M.W., Laporte, G. 1996. Recent Developments in Practical Examination Timetabling. In Edmund Burke and Peter Ross, editors. The Practice and Theory of Automated Timetabling. Lecture Notes in Computer Science 1153. Springer-Verlag, Berlin, 3-21.
14. Carter, M.W., Laporte, G., Lee, S.Y. 1996. Examination Timetabling: Algorithmic Strategies and Applications. Journal of the Operation Research Society 74, 373-383.
15. th Int. Workshop, Proc. WAE 2000 Saarbrucken, Germany, September. Lecture Notes in Computer Science 1982. Springer-Verlag, Berlin, 230-241.
16. Casey, S., Thompson, J. 2003. GRASPing the Examination Scheduling Problem. In Edmund Burke and Patrick DC Causmaecker, editors. The Practice and Theory of Automated Timetabling. Lecture Notes in Computer Science 2740. Springer-Verlag, Berlin, 232-244.
17. Di Gaspero, L., Schaerf, A. 2001. Tabu Search Techniques for Examination Timetabling. In Edmund Burke and Wilhelm Erbens, editors. The Practice and Theory of Automated Timetabling. Lecture Notes in Computer Science 2079. Springer-Verlag, Berlin, 104-117.
18. Dueck, G. 1993. New Optimization Heuristics. The Great Deluge Algorithm and the Record-to-Record Travel. Journal of Computational Physics 104, 86-92.
19. Higgins, A.J. 2001. A Dynamic Tabu Search for Large-Scale Generalised Assignment Problems. Computers and Operations Research, 28(10), 1039-1048.
20. Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P. 1983. Optimisation by Simulated Annealing. Science, 220, 671-380.
21. Merlot T.G. Liam, Boland, N., Hughes, D.B., Stuckey, J. P. 2003. A Hybrid Algorithm for the Examination Timetabling Problem. In Edmund Burke and Patrick De Causmaecker, editors. The Practice and Theory of Automated Timetabling. Lecture Notes in Computer Science 2740. Springer-Verlag, Berlin, 207-231.
22. Petrovic, S., Burke, E.K. 2004. University Timetabling. Ch. 45 in the Handbook of Scheduling: Algorithms, Models, and Performance Analysis (eds. J. Leung), Chapman Hall/CRC Press.
23. Yong, Y., Petrovic, S. 2005. A Novel Similarity Measure for Heuristic. In Edmund Burke and Micheal Trick, editors. The Practice and Theory of Automated Timetabling. Lecture Notes in Computer Science 3616. Springer-Verlag, Berlin, 247-269.