Abstract
A recent trend in local search concerns the exploitation of several different neighbourhood functions so as to increase the ability of the algorithm to navigate the search space.
In this paper we investigate the use of local search techniques based on various combinations of neighbourhood functions, and we apply this to a timetabling problem. In particular, we propose a set of generic operators that automatically compose neighbourhood functions, giving rise to more complex ones. In the exploration of large neighbourhoods, we rely on constraint techniques to prune the list of candidates. In this way, we are able to select the most effective search technique through a systematic analysis of all possible combinations built upon a set of basic, human-defined, neighbourhood functions.
The proposed ideas are applied to a practical problem, namely the Course Timetabling problem. Our algorithms are systematically tested and compared on real-world instances. The experimental analysis shows that neighbourhood composition leads to much better results than traditional local search techniques.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aarts, E., Lenstra, J.K.: Local Search in Combinatorial Optimization. Wiley, Chichester (1997)
Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079. Springer, Berlin (2001)
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-2001), pp. 545–550 (2001)
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++
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++
Di Gaspero, L., Schaerf. A.: EasyLocal++: An Object-Oriented Framework for Flexible Design of Local Search Algorithms. Softw. – Pract. Exper. (to appear)
Glover, F., Laguna, M.: Tabu search. Kluwer, Dordrecht (1997)
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, pp. 433–458. Kluwer, Dordrecht (1999)
Laporte, G., Desroches, S.: Examination Timetabling by Computer. Comput. Oper. Res. 11, 351–360 (1984)
Lin, S.: Computer Solutions of the Traveling Salesman Problem. Bell Syst. Tech. J. 44, 2245–2269 (1965)
Lourenço, H.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)
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 1990). AAAI Press/MIT Press, Boston (1990)
Pesant, G., Gendreau, M.: A Constraint Programming Framework for Local Search Methods. J. Heuristics 5, 255–279 (1999)
Pesch, E., Glover, F.: TSP Ejection Chains. Discr. Appl. Math. 76, 175–181 (1997)
Schaerf, A.: Local Search Techniques for Large High-School Timetabling Problems. IEEE Trans. Syst. Man Cybern. 29, 368–377 (1999)
Schaerf, A.: A Survey of Automated Timetabling. Artif. Intell. Rev. 13, 87–127 (1999)
Selman, B., Kautz, H.A., Cohen, B.: Noise Strategies for Improving Local Search. In: Proc. 12th Natl Conf. Artif. Intell (AAAI 1994), pp. 337–343 (1994)
Selman, B., Levesque, H., Mitchell, D.: A New Method for Solving Hard Satisfiability Problems. In: Proc. 10th Natl Conf. Artif. Intell (AAAI 1992), pp. 440–446 (1992)
Vaessens, R., Aarts, E., Lenstra, J.K.: Job Shop Scheduling by Local Search. INFORMS J. Comput. 8, 302–317 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Di Gaspero, L., Schaerf, A. (2003). Multi-neighbourhood Local Search with Application to Course Timetabling. In: Burke, E., De Causmaecker, P. (eds) Practice and Theory of Automated Timetabling IV. PATAT 2002. Lecture Notes in Computer Science, vol 2740. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45157-0_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-45157-0_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40699-0
Online ISBN: 978-3-540-45157-0
eBook Packages: Springer Book Archive