Abstract
In this paper we report on a computational experience with a local search algorithm for High-school Timetabling Problems. The timetable has to satisfy “hard” requirements, that are mandatory, and should minimize the violation of “soft” constraints. In our approach, we combine Simulated Annealing with a Very Large-Scale Neighborhood search where the neighborhood is explored by solving an Integer Programming problem. We report on a computational experience validating the usefulness of the proposed approach.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aarts, E., Korst, J.: Selected topics in simulated annealing. In: Hansen, P. Ribeiro, C. (eds.) Essays and Surveys in Metaheuristics, vol. 15, pp. 1–38. Kluwer Academic, Dordrecht (2001)
Abramson, D., Dang, H.: School timetables: a case study in simulated annealing: sequential and parallel algorithms. In: Vidal, V. (ed.) Lecture Notes in Economics and Mathematics Systems, pp. 103–124. Springer, New York (1993)
Ahuja, R.K., Orlin, J.B.: Very large-scale neighborhood search for airline fleet scheduling. SIAM News 35(9) (2002)
Ahuja, R.K., Ergun, O., Orlin, J.B., Punnen, A.P.: A survey of very large-scale neighborhood search techniques. Discret. Appl. Math. 123, 75–102 (2002)
Asratian, A.S., de Werra, D.: A generalized classteacher model for some timetabling problems. Eur. J. Oper. Res. 143, 531–542 (2002)
Bardadym, V.A.: Computer aided school and university timetabling: The new wave. In: E. Burke, P. Ross (eds.) The Practice and Theory of Automated Timetabling: Selected Papers from the 1st International Conference on the Practice and Theory of Automated Timetabling. Lecture Notes in Computer Science, vol. 1153, pp. 22–45. Springer, Berlin (1995),
Burke, E., Carter, M. (eds.): The Practice and Theory of Automated Timetabling II: Selected Papers from the 2nd International Conference on the Practice and Theory of Automated Timetabling, University of Toronto, 20–22 August 1998. Lecture Notes in Computer Science, vol. 1408. Springer, New York (1998)
Burke, E., De Causmaecker, P. (eds.): Practice and Theory of Automated Timetabling IV 4th International Conference, PATAT 2002, Gent, Belgium, 21–23 August 2002. Lecture Notes in Computer Science, Selected Revised Papers, vol. 2740. Springer, Berlin (2003)
Burke, E., Erben, W. (eds.): The Practice and Theory of Automated Timetabling III: Selected Papers the 3rd International Conference on the Practice and Theory of Automated Timetabling, Konstanz, Germany, 16–18 August 2001. Lecture Notes in Computer Science, vol. 2079. Springer, Berlin (2001)
Burke, E.K., Petrovic, S.: Recent research trends in automated timetabling. Eur. J. Oper. Res. 140(2), 266–280 (2002)
Burke, E., Ross, P. (eds.): The Practice and Theory of Automated Timetabling: Selected Papers from the 1st International Conference on the Practice and Theory of Automated Timetabling, Edinburgh, August/September 1995. Lecture Notes in Computer Science, vol. 1153. Springer, Berlin (1995)
Burke, E.K., Jackson, K.S., Kingston, J.H., Weare, R.F.: Automated timetabling: The state of the art. Comput. J. 40(9), 565–571 (1997)
Burke, E., de Werra, D., Kingston, J.: Applications to timetabling. In: Gross, J., Yellen, J. (eds.) Handbook of Graph Theory, pp. 445–474. CRC, Boca Raton (2003)
Carter, M.W.: Timetabling. In: Gass, S., Harris, C.M. (eds.) Encyclopedia of Operations Research and Management Science, pp. 833–836. Kluwer, Dordrecht (2001)
Colorni, A., Dorigo, M., Maniezzo, V.: Metaheuristics for high school timetabling. Comput. Optim. Appl. 9, 275–298 (1998)
CPLEX: ILOG CPLEX 8.0 Reference Manual. ILOG, Boca Raton (2002)
de Werra, D.: An introducing to timetabling. Eur. J. Oper. Res. 19, 151–162 (1985)
de Werra, D.: The combinatorics of timetabling. Eur. J. Oper. Res. 96, 504–513 (1997)
de Werra, D., Asratian, A.S., Durand, S.: Complexity of some types of timetabling problems. J. Schedul. 5, 171–183 (2002)
Di Stefano, C., Tettamanzi, A.G.B.: An evolutionary algorithm for solving the school timetabling problem. In: Applications of Evolutionary Computing: EvoWorkshops 2001. Lecture Notes in Computer Science, vol. 2037, pp. 452–462. Springer, Berlin (2001)
Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671–680 (1983)
Lantiv Timetabler 6.2: User’s Manual. http://www.lantiv.com
Randall, M., Abramson, D.: A general meta-heuristic based solver for combinatorial optimisation problems. Comput. Optim. Appl. 20(2), 185–210 (2001)
Schaerf, A.: A survey of automated timetabling. Artif. Intell. Rev. 13, 87–127 (1999a)
Schaerf, A.: Local search techniques for large high-school timetabling problems. IEEE Trans. Systems Man Cybernet. 29(4), 368–377 (1999b)
Smith, K.A., Abramson, D., Duke, D.: Hopfield neural networks for timetabling: formulations, methods, and comparative results. Comput. Ind. Eng. 44, 283–305 (2003)
van Laarhoven, P.J.M., Aarts, E.H.L.: Simulated Annealing: Theory and Application. Reidel, Dordrecht (1988)
Wren, A.: Scheduling, timetabling and rostering—a special relationship? In: Burke, E., Ross, P. (eds.) The Practice and Theory of Automated Timetabling: Selected Papers from the 1st International Conference on the Practice and Theory of Automated Timetabling. Lecture Notes in Computer Science, vol. 1153, pp. 46–75. Springer, Berlin (1995),
Author information
Authors and Affiliations
Corresponding author
Additional information
Support for I. Vasil’ev was provided by NATO grant CBP.NR.RIG.911258.
Rights and permissions
About this article
Cite this article
Avella, P., D’Auria, B., Salerno, S. et al. A computational study of local search algorithms for Italian high-school timetabling. J Heuristics 13, 543–556 (2007). https://doi.org/10.1007/s10732-007-9025-3
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10732-007-9025-3