Neighborhood Portfolio Approach for Local Search Applied to Timetabling Problems
- First Online:
A recent trend in local search concerns the exploitation of several different neighborhoods so as to increase the ability of the algorithm to navigate the search space. In this work we investigate a hybridization technique, that we call Neighborhood Portfolio Approach, that consists in the interleave of local search techniques based on various combinations of neighborhoods. In particular, we are able to select the most effective search technique through a systematic analysis of all meaningful combinations built upon a set of basic neighborhoods. The proposed approach is applied to two practical problems belonging to the timetabling family, and systematically tested and compared on real-world instances. The experimental analysis shows that our approach leads to automatic design of new algorithms that provide better results than basic local search techniques.
Mathematical Subject Classifications (2000)90B40 Search theory 68W20 Randomized algorithms 68W40 Analysis of algorithms 90B35 Scheduling theory deterministic
Key wordslocal search neighborhood tabu search timetabling
Unable to display preview. Download preview PDF.
- 3.Birattari, M., Stützle, T., Paquete, L. and Varrentrapp, K.: A racing algorithm for configuring metaheuristics, in W. B. Langdon, E. Cantú-Paz, K. Mathias, R. Roy, D. Davis, R. Poli, K. Balakrishnan, V. Honavar, G. Rudolph, J. Wegener, L. Bull, M. A. Potter, A. C. Schultz, J. F. Miller, E. Burke and N. Jonoska (eds.), GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, New York, NY, USA, 2002, pp. 11–18.Google Scholar
- 4.Conover, W.: Practical Nonparametric Statistics, 3rd edn., John Wiley & Sons, New York, NY, USA, 1999.Google Scholar
- 7.Hansen, P. and Mladenović, N.: An introduction to variable neighbourhood search, in S. Voß, S. Martello, I. Osman and C. Roucairol (eds.), Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, Kluwer, Boston, MA, USA, 1999, pp. 433–458.Google Scholar
- 9.Itai, A., Rodeh, M. and Tanimoto, S. L.: Some matching problems for bipartite graphs, Technical Report TR93, IBM Israel Scientific Center, Haifa, Israel, 1977.Google Scholar
- 11.Lourenço, H. R., Martin, O. and Stützle, T.: Applying iterated local search to the permutation flow shop problem, in F. Glover and G. Kochenberger (eds.), Handbook of Metaheuristics, Kluwer, Boston, MA, USA, 2003.Google Scholar
- 13.Rossi-Doria, O. et al.: A comparison of the performance of different metaherustic on the timetabling problem, in E. Burke and P. D. Causmaecker (eds.), Proc. of the 4th Int. Conf. on the Practice and Theory of Automated Timetabling (PATAT-2002), Selected Papers, Vol. 2740 of Lecture Notes in Computer Science. Berlin-Heidelberg, Germany, 2003, pp. 329–351.Google Scholar
- 14.Schaerf, A.: Tabu search techniques for large high-school timetabling problems, in Proc. of the 13th Nat. Conf. on Artificial Intelligence (AAAI-96), Portland, OR, USA, 1996, pp. 363–368.Google Scholar
- 16.Selman, B., Kautz, H. A. and Cohen, B.: Noise strategies for improving local search, in Proc. of the 12th Nat. Conf. on Artificial Intelligence (AAAI-94). Seattle, WA, USA, 1994, pp. 337–343.Google Scholar
- 17.Stützle, T.: Iterated local search for the quadratic assignment problem, Technical Report AIDA-99-03, FG Intellektik, TU Darmstadt, 1998.Google Scholar