Coupling Stochastic and Deterministic Local Search in Examination Timetabling

References

• Asmuni H., Burke E. K., Garibaldi J. M., Burke E., Trick M. Fuzzy multiple ordering criteria for examination timetabling. Practice and Theory of Automated Timetabling (2004) V(Pittsburgh, PA)334–353PATAT 2004Google Scholar
• Burke E. K., Newall J. P. A multi-stage evolutionary algorithm for the timetabling problem. IEEE Trans. Evolutionary Comput. (1999) 3(1):63–74Crossref, Google Scholar
• Burke E. K., Newall J. P., Burke E. K., De Causmaecker P. Enhancing timetable solutions with local search methods. Practice and Theory of Automated Timetabling, Vol. IV. PATAT 2002, Gent, Belgium, August, selected papers. Lecture Notes in Computer Science (2003) 2740(Springer-Verlag, Berlin, Heidelberg, New York) 195–206Crossref, Google Scholar
• Burke E. K., Newall J. P. Solving examination timetabling problems through adaptation of heuristic orderings. Ann. Oper. Res. (2004) 129:107–134Crossref, Google Scholar
• Burke E. K., Petrovic S. Recent research directions in automated timetabling. Eur. J. Oper. Res. (2002) 140(2):266–280Crossref, Google Scholar
• Burke E. K., Elliman D. G., Weare R. F., Eshelman L. J. A hybrid genetic algorithm for highly constrained timetabling problems. Genetic Algorithms: Proc. 6th Internat. Conf. (1995a) (Morgan Kaufmann, San Francisco, CA) 605–610Google Scholar
• Burke E. K., Elliman D. G., Weare R. F., Fogarty T. C. Specialized recombinative operators for timetabling problems. Evolutionary Computing, AISB Workshop, Sheffield, UK, April, selected papers. Lecture Notes in Computer Science (1995b) 993(Springer-Verlag, Berlin, Heidelberg, New York) 75–85Google Scholar
• Burke E. K., Newall J. P., Weare R. F., Burke E. K., Ross P. A memetic algorithm for university exam timetabling. Practice and Theory of Automated Timetabling I. PATAT 1995, Edinburgh, Scotland, Aug./Sept., selected papers. Lecture Notes in Computer Science (1996) 1153(Springer-Verlag, Berlin, Heidelberg, New York) 241–250Crossref, Google Scholar
• Burke E. K., Bykov Y., Newall J. P., Petrovic S. A time-predefined local search approach to exam timetabling problems. IIE Trans. Oper. Engrg. (2004) 36(6):509–528Crossref, Google Scholar
• Caramia M., Dell’Olmo P., Italiano G. F., Naher S., Wagner D. New algorithms for examination timetabling. Algorithm Engineering 4th International Workshop, WAE 2000, Saarbrucken, Germany, September, selected papers. Lecture Notes in Computer Science (2001) 1982(Springer-Verlag, Berlin, Heidelberg, New York) 230–241Crossref, Google Scholar
• Carter M. W. A decomposition algorithm for practical timetabling problem. (1983) . Working Paper 83-06, Department of Industrial Engineering, University of Toronto, Toronto, Ontario, CanadaGoogle Scholar
• Carter M. W., Laporte G., Lee S. Y. Examination timetabling: Algorithm strategies and applications. J. Oper. Res. Soc. (1996) 47:373–383Crossref, Google Scholar
• Casey S., Thompson J., Burke E. K., De Causmaecker P. GRASPing the examination scheduling problem. Practice and Theory of Automated Timetabling, Vol. IV. PATAT 2002, Gent, Belgium, August, selected papers. Lecture Notes in Computer Science (2003) 2740(Springer-Verlag, Berlin, Heidelberg, New York) 232–244Crossref, Google Scholar
• Corne D., Ross P., Burke E. K., Ross P. Peckish initialisation strategies for evolutionary timetabling. The Practice and Theory of Automated Timetabling. ICPTAT 1995. Lecture Notes in Computer Science (1996) 1153(Springer-Verlag, Berlin, Heidelberg, New York) 227–240Crossref, Google Scholar
• Corne D., Fang H. L., Mellish C., Chung P., Lovegrove G. L., Ali M. Solving the module exam scheduling problem with genetic algorithms. Proc. 6th Internat. Conf. Indust. and Engrg. Appl. Artificial Intelligence and Expert Systems (1993) (Gordon and Breach Science Publishers, New York) 370–373Google Scholar
• Corne D., Ross P., Fang H. L., Fogarty T. Fast practical evolutionary timetabling. Evolutionary Computing. Lecture Notes in Computer Science (1994) 865(Springer-Verlag, Berlin, Heidelberg, New York) 250–263Crossref, Google Scholar
• Cote P., Wang T., Sabourin R., Burke E., Trick M. Application of a hybrid multi-objective evolutionary algorithm to the uncapacitated exam proximity problem. Practice and Theory of Automated Timetabling (2004) V(Pittsburgh, PA). PATAT 2004Google Scholar
• Di Gaspero L., Schaerf A., Burke E. K., Erben W. Tabu search techniques for examination timetabling problems. Practice and Theory of Automated Timetabling, Vol. III. PATAT 2000, Konstanz, Germany. Lecture Notes in Computer Science (2001) 2079(Springer-Verlag, Berlin, Heidelberg, New York) 104–117Google Scholar
• Dorigo M. Optimization, learning and natural algorithms (in Italian). (1992) . Ph.D. thesis, Dipartimento di Elettronica, Politecnico di Milano, ItalyGoogle Scholar
• Dorigo M., Di Caro G., Corne D., Dorigo M., Glover F. The ant colony optimization meta-heuristic. New Ideas in Optimization (1999) (McGraw Hill, UK) 11–32Crossref, Google Scholar
• Dorigo M., Di Caro G., Gambardella L. M. Ant algorithms for discrete optimization. Artificial Life (1999) 5(2):137–172Crossref, Google Scholar
• Dowsland K. A., Thompson J. Ant colony optimization for the examination scheduling problem. J. Oper. Res. Soc. (2005) 56:426–438Crossref, Google Scholar
• Erben W., Burke E. K., Erben W. A grouping genetic algorithm for graph coloring and exam timetabling. Practice and Theory of Automated Timetabling III. PATAT 2000, Konstanz, Germany. Lecture Notes in Computer Science (2001) 2079(Springer-Verlag, Berlin, Heidelberg, New York) 132–156Google Scholar
• Ergul A., Burke E. K., Ross P. GA-based examination scheduling experience at Middle East Technical University. The Practice and Theory of Automated Timetabling. ICPTAT 1995. Lecture Notes in Computer Science (1996) 1153(Springer-Verlag, Berlin, Heidelberg, New York) 216–226Crossref, Google Scholar
• Kendall G., Hussin N. Mohd, Kendall G., Burke E., Petrovic S. An investigation of a tabu search based hyper-heuristic for examination timetabling. 1st Multidisciplinary Internat. Conf. on Scheduling: Theory and Applications (2003) MISTA 2003, Nottingham, UK:226–233Google Scholar
• Merlot L. T. G., Boland N., Hughes B. D., Stuckey P. J., Burke E. K., De Causmaecker P. A hybrid algorithm for the examination timetabling problem. Practice and Theory of Automated Timetabling, Vol. IV. PATAT 2002, Gent, Belgium. Lecture Notes in Computer Science (2003) 2740(Springer-Verlag, Berlin, Heidelberg, New York) 207–231Crossref, Google Scholar
• Paquete L., Stutzle T., Burke E. K., De Causmaecker P. Empirical analysis of tabu search for the lexicographic optimisation of the examination timetabling problem. Practice and Theory of Automated Timetabling, Vol. IV. PATAT 2002, Gent, Belgium. Lecture Notes in Computer Science (2002) 2740(Springer-Verlag, Berlin, Heidelberg, New York) 413–420Google Scholar
• Petrovic S., Yang Y., Dror M., Kendall G., Burke E., Petrovic S. Case-based initialisation of metaheuristics for examination timetabling. 1st Multidisciplinary Internat. Conf. on Scheduling: Theory and Applications (2003) MISTA 2003, Nottingham, UK:137–154Google Scholar
• Stutzle T., Hoos H. H. MAX-MIN ant system. J. Future Generation Comput. Systems (2000) 16:889–914Crossref, Google Scholar
• Weare R. F. Automated examination timetabling. (1995) . Ph.D. dissertation, Department of Computer Science, University of Nottingham, Nottingham, UKGoogle Scholar
• White G. M., Xie B. S., Burke E. K., Erben W. Examination timetables and tabu search with longer-term memory. Practice and Theory of Automated Timetabling, Vol. III. PATAT 2000, Konstanz, Germany. Lecture Notes in Computer Science (2001) 2079(Springer-Verlag, Berlin, Heidelberg, New York) 85–103Crossref, Google Scholar
• Yang Y., Petrovic S., Burke E., Trick M. A novel similarity measure for heuristic selection in examination timetabling. Practice and Theory of Automated Timetabling (2004) V(PATAT 2004, Pittsburgh, PA) 377–396Google Scholar