Multi-neighbourhood local search with application to course timetabling

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2740, Issue , 2003, Pages 262-275

  Di Gaspero, Luca ^a   Schaerf, Andrea ^a  

^a UNIVERSITY OF UDINE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION ANALYSIS; SCHEDULING;

COURSE TIMETABLING; EXPERIMENTAL ANALYSIS; GENERIC OPERATORS; LOCAL SEARCH TECHNIQUES; PRACTICAL PROBLEMS; SEARCH TECHNIQUE; SYSTEMATIC ANALYSIS; TIMETABLING PROBLEM;

LOCAL SEARCH (OPTIMIZATION);

EID: 35248849915     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45157-0_17     Document Type: Article

References (19)

1. Aarts, E., Lenstra, Jan Karel.: Local Search in Combinatorial Optimization. Wiley, Chichester (1997)
2. Burke, E., Erben, W. (Eds.): Practice and Theory of Automated Timetabling III (PATAT 2000, Konstanz, Germany, August, selected papers). Lecture Notes in Computer Science, Vol. 2079. Springer-Verlag, Berlin Heidelberg New York (2001)
3. den Besten, M., Stützle, T.: Neighborhoods Revisited: An Experimental Investigation into the Effectiveness of Variable Neighborhood Descent for Scheduling. In: Pinho de Sousa, J. (Ed.): Proc. 4th Metaheuristics Int. Conf. (MIC-01) (2001) 545-550
4. Di Gaspero, L., Schaerf. A.: EASYLOCAL++: An Object-Oriented Framework for Flexible Design of Local Search Algorithms. Technical Report UDMI/13/2000/RR. Dipartimento di Matematica e Informatica, Università di Udine (2000). Available at http://www.diegm.uniud.it/schaerf/projects/local++
5. Di Gaspero, L., Schaerf. A.: A Case-Study for EASYLOCAL++: the Course Timetabling Problem. Technical Report UDMI/13/2001/RR. Dipartimento di Matematica e Informatica, Università di Udine (2001). Available at http://www.diegm.uniud.it/schaerf/projects/local++
6. Di Gaspero, L., Schaerf. A.: EASYLOCAL++: An Object-Oriented Framework for Flexible Design of Local Search Algorithms. Softw. - Pract. Exper. (to appear)
7. Glover, F., Laguna, M.: Tabu search. Kluwer, Dordrecht (1997)
8. Hansen, P., Mladenović, N.: An Introduction to Variable Neighbourhood Search. In: Voß, S., Martello, S., Osman, I.H., Roucairol, C. (Eds.): Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization. Kluwer, Dordrecht (1999) 433-458
9. Laporte, G., Desroches, S.: Examination Timetabling by Computer. Comput. Oper. Res. 11 (1984) 351-360
10. Lin, S.: Computer Solutions of the Traveling Salesman Problem. Bell Syst. Tech. J. 44 (1965) 2245-2269
11. Lourenço, II.R., Martin, O., Stützle, T.: Applying Iterated Local Search to the Permutation Flow Shop Problem. In: Glover, F., Kochenberger, G. (Eds.): Handbook of Metaheuristics. Kluwer, Dordrecht (2001) (to appear)
12. Minton, S., Johnston, M.D., Philips, A.B., Laird, P.: Solving Large-Scale Constraint Satisfaction and Scheduling Problems Using a Heuristic Repair Method. In: Proc. 8th Natl Conf. Artif. Intell. (AAAI'90) AAAI Press/MIT Press, Boston, MA (1990) 17-24
13. Pesant, G., Gendreau, M.: A Constraint Programming Framework for Local Search Methods. J. Heuristics 5 (1999) 255-279
14. Pesch, E., Glover, F.: TSP Ejection Chains. Discr. Appl. Math. 76 (1997) 175-181
15. Schaerf, A.: Local Search Techniques for Large High-School Timetabling Problems. IEEE Trans. Syst. Man Cybern. 29 (1999) 368-377
16. Schaerf, A.: A Survey of Automated Timetabling. Artif. Intell. Rev. 13 (1999) 87-127
17. Selman, B., Kautz, H.A., Cohen, B.: Noise Strategies for Improving Local Search. In: Proc. 12th Natl Conf. Artif. Intell. (AAAI'94) (1994) 337-343
18. Selman, B., Levesque, H., Mitchell, D.: A New Method for Solving Hard Satisfiability Problems. In: Proc. 10th Natl Conf. Artif. Intell. (AAAI'92) (1992) 440-446
19. Vaessens, R., Aarts, E., Lenstra, J.K.: Job Shop Scheduling by Local Search. INFORMS J. Comput. 8 (1996) 302-317