Skip to main content
SpringerLink
Log in

Very Large-Scale Neighborhood Search Techniques in Timetabling Problems

  • Conference paper
Practice and Theory of Automated Timetabling VI (PATAT 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3867))

Abstract

We describe the use of very large-scale neighborhood search (VLSN) techniques in examination timetabling problems. We detail three applications of VLSN algorithms that illustrate the versatility and potential of such algorithms in timetabling. The first of these uses cyclic exchange neighborhoods, in which an ordered subset of exams in disjoint time slots are swapped cyclically such that each exam moves to the time slot of the exam following it in the order. The neighborhood of all such cyclic exchanges may be searched effectively for an improving set of moves, making this technique computationally reasonable in practice. We next describe the idea of optimized crossover in genetic algorithms, where the parent solutions used in the genetic algorithm perform an optimization routine to produce the ‘most fit’ of their children under the crossover operation. This technique can be viewed as a form of multivariate large-scale neighborhood search, and it has been applied successfully in several areas outside timetabling. The final topic we discuss is functional annealing, which gives a method of incorporating neighborhood search techniques into simulated annealing algorithms. Under this technique, the objective function is perturbed slightly to avoid stopping at local optima, while neighborhood search techniques help provide an effective search of the feasible space.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abdullah, S., Ahmadi, S., Burke, E.K., Dror, M.: Investigating Ahuja–Orlin’s large neighbourhood search approach for examination timetabling. OR Spectrum 29, 351–372 (2007)

    Article  MATH  Google Scholar 

  2. Abdullah, S., Ahmadi, S., Burke, E.K., Dror, M., McCollum, B.: A tabu-based large neighbourhood search methodology for the capacitated examination timetabling problem. Journal of the Operational Research Society (to appear, 2007)

    Google Scholar 

  3. Agarwal, R., Ahuja, R., Laporte, G., Shen, Z.: A composite very large-scale neighborhood search algorithm for the vehicle routing problem. In: Handbook of Scheduling: Algorithms, Models and Performance Analysis, ch. 49, Chapman and Hall/CRC, Boca Raton, FL (2003)

    Google Scholar 

  4. Agarwal, R., Ergun, Ö., Orlin, J., Potts, C.: Solving parallel machine scheduling problems with variable depth local search. Working Paper, Operations Research Center, MIT, Cambridge, MA (2004)

    Google Scholar 

  5. Aggarwal, C., Orlin, J., Tai, R.: Optimized crossover for the independent set problem. Operations Research 45, 226–234 (1997)

    MATH  MathSciNet  Google Scholar 

  6. Ahuja, R., Ergun, Ö., Orlin, J., Punnen, A.: A survey of very large-scale neighborhood search techniques. Discrete Applied Mathematics 123, 75–102 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  7. Ahuja, R., Ergun, Ö., Orlin, J., Punnen, A.: Very large-scale neighborhood search: theory, algorithms, and applications. Working Paper, Operations Research Center, MIT, Cambridge, MA (2006)

    Google Scholar 

  8. Ahuja, R., Jha, K., Orlin, J., Sharma, D.: Very large-scale neighborhood search for the quadratic assignment problem. Working Paper, Operations Research Center, MIT, Cambridge, MA (2002)

    Google Scholar 

  9. Ahuja, R., Orlin, J., Magnanti, T.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Upper Saddle River, NJ (1993)

    Google Scholar 

  10. Ahuja, R., Orlin, J., Sharma, D.: Very large-scale neighborhood search. International Transactions in Operational Research 7, 301–317 (2000)

    Article  MathSciNet  Google Scholar 

  11. Ahuja, R., Orlin, J., Sharma, D.: Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem. Mathematical Programming 91, 71–97 (2001)

    MATH  MathSciNet  Google Scholar 

  12. Ahuja, R., Orlin, J., Tiwari, A.: A greedy genetic algorithm for the quadratic assignment problem. Computers and Operations Research 27, 917–934 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  13. Alvarez-Valdes, R., Martin, G., Tamarit, J.: Constructing good solutions for the spanish school timetabling problem. Journal of the Operational Research Society 47, 1203–1215 (1996)

    Article  MATH  Google Scholar 

  14. Avella, P., D’Auria, B., Salerno, S., Vasil’ev, I.: Computational experience with very large-scale neighborhood search for high-school timetabling. Working Paper, Research Center on Software Technology, Università del Sannio, Italy (2006)

    Google Scholar 

  15. Ayob, M., Kendall, G.: A Monte Carlo hyper heuristic to optimise component placement sequencing for multi-head placement machine. In: Proceedings of the 4th International Conference on Intelligent Technologies, Chiang Mai, Thailand, pp. 132–141. Institute for Science and Technology Research and Development, Chiang Mai University (2003)

    Google Scholar 

  16. Balas, E., Niehaus, W.: Finding large cliques in arbitrary graphs by bipartite matching. In: Clique, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, pp. 29–53. AMS (1996)

    Google Scholar 

  17. Balas, E., Niehaus, W.: Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems. Journal of Heuristics 4, 107–122 (1998)

    Article  MATH  Google Scholar 

  18. Bertsimas, D., Tsitsiklis, J.: Introduction to Linear Optimization, Athena Scientific, Belmont, MA (1997)

    Google Scholar 

  19. Bullnheimer, B.: An examination scheduling model to maximize students’ study time. In: Burke, E.K., Carter, M. (eds.) PATAT 1997. LNCS, vol. 1408, pp. 78–91. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  20. Burke, E.K., Elliman, D., Weare, R.: A hybrid genetic algorithm for highly constrained timetabling problems. In: Proceedings of the 6th International Conference on Genetic Algorithms, Pittsburgh, PA, pp. 605–610. Morgan Kaufmann, San Mateo, CA (1995)

    Google Scholar 

  21. Burke, E.K., Newall, J., Weare, R.: A memetic algorithm for university exam timetabling. In: Burke, E.K., Ross, P. (eds.) Practice and Theory of Automated Timetabling. LNCS, vol. 1153, pp. 241–250. Springer, Heidelberg (1996)

    Google Scholar 

  22. Burke, E.K., Petrovic, S.: Recent research directions in automated timetabling. European Journal of Operational Research 140, 266–280 (2002)

    Article  MATH  Google Scholar 

  23. Carter, M.: A comprehensive course timetabling and student scheduling system at the University of Waterloo. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, pp. 64–82. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  24. Carter, M., Laporte, G.: Recent developments in practical examination timetabling. In: Burke, E.K., Ross, P. (eds.) Practice and Theory of Automated Timetabling. LNCS, vol. 1153, pp. 3–21. Springer, Heidelberg (1996)

    Google Scholar 

  25. Carter, M., Laporte, G.: Recent developments in practical course timetabling. In: Burke, E.K., Carter, M. (eds.) PATAT 1997. LNCS, vol. 1408, pp. 3–19. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  26. Cheng, C., Kang, L., Leung, N., White, G.: Investigations of a constraint logic programming approach to university timetabling. In: Burke, E.K., Ross, P. (eds.) Practice and Theory of Automated Timetabling. LNCS, vol. 1153, pp. 112–129. Springer, Heidelberg (1996)

    Google Scholar 

  27. Colorni, A., Dorigo, M., Maniezzo, V.: Metaheuristics for high-school timetabling. Computational Optimization and Applications 9, 275–298 (1998)

    Article  MATH  Google Scholar 

  28. Corne, D., Ross, P., Fang, H.: Fast practical evolutionary timetabling. In: Fogarty, T.C. (ed.) Evolutionary Computing. LNCS, vol. 865, pp. 251–263. Springer, Heidelberg (1994)

    Google Scholar 

  29. Deineko, V., Woeginger, G.: A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem. Mathematical Programming 87, 255–279 (2000)

    MathSciNet  Google Scholar 

  30. Ergun, Ö.: New neighborhood search algorithms based on exponentially large neighborhoods. Ph.D. Dissertation, Massachusetts Institute of Technology (June 2001)

    Google Scholar 

  31. Fang, H.: Genetic algorithms in timetabling and scheduling. Ph.D. Dissertation, University of Edinburgh (September 1994)

    Google Scholar 

  32. Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)

    MATH  Google Scholar 

  33. Glover, F.: Ejection chains, reference structures and alternating path methods for traveling salesman problems. Discrete Applied Mathematics 65, 223–253 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  34. Jha, K.: Very large-scale neighborhood search heuristics for combinatorial optimization problems. Ph.D. Dissertation, University of Florida (June 2004)

    Google Scholar 

  35. Junginger, W.: Timetabling in Germany – a survey. Interfaces 16, 66–74 (1986)

    Article  Google Scholar 

  36. Lin, S., Kernighan, B.: An effective heuristic algorithm for the traveling salesman problem. Operations Research 21, 498–516 (1973)

    MATH  MathSciNet  Google Scholar 

  37. Lourenço, H., Paixão, J., Portugal, R.: Multiobjective metaheuristics for the bus driver scheduling problem. Transportation Science 35, 331–343 (2001)

    Article  MATH  Google Scholar 

  38. Mitchell, M.: An Introduction to Genetic Algorithms. MIT Press, Cambridge, MA (1996)

    Google Scholar 

  39. Neufeld, G., Tartar, J.: Graph coloring conditions for the existence of solutions to the timetable problem. Communications of the ACM 17, 450–453 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  40. Punnen, A., Kabadi, S.: Domination analysis of some heuristics for the traveling salesman problem. Discrete Applied Mathematics 119, 117–128 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  41. Ribeiro, C., Vianna, D.: A genetic algorithm for the phylogeny problem using an optimized crossover strategy based on path relinking. In: Proceedings of the 2nd Brazilian Workshop on Bioinformatics, Macaé, Brazil, pp. 97–102. SBC (2003)

    Google Scholar 

  42. Ropke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Working Paper, Department of Computer Science, University of Copenhagen, Denmark (2005)

    Google Scholar 

  43. Schaerf, A.: Local search techniques for large high school timetabling problems. IEEE Transactions on Systems, Man, and Cybernetics – Part A: Systems and Humans 29, 368–377 (1999)

    Article  Google Scholar 

  44. Schaerf, A.: A survey of automated timetabling. Artificial Intelligence Review 13, 87–127 (1999)

    Article  Google Scholar 

  45. Sharma, D., Sukhapesna, S.: Functional annealing technique for very large-scale neighborhood search. Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, MI (in preparation)

    Google Scholar 

  46. Sukhapesna, S.: Generalized annealing algorithms for discrete optimization problems. Ph.D. Dissertation, University of Michigan (September 2005)

    Google Scholar 

  47. Thompson, P.: Local search algorithms for vehicle routing and other combinatorial problems. Ph.D. Dissertation, Massachusetts Institute of Technology (May 1988)

    Google Scholar 

  48. Thompson, J., Dowsland, K.: A robust simulated annealing based examination timetabling system. Computers and Operations Research 25, 637–648 (1998)

    Article  MATH  Google Scholar 

  49. Thompson, P., Orlin, J.: The theory of cyclic transfers. Working Paper OR 200-89, Operations Research Center, MIT, Cambridge, MA (1989)

    Google Scholar 

  50. Thompson, P., Psaraftis, H.: Cyclic transfer algorithms for multivehicle routing and scheduling problems. Operations Research 41, 935–946 (1993)

    MATH  MathSciNet  Google Scholar 

  51. Yagiura, M., Ibaraki, T.: Recent metaheuristic algorithms for the generalized assignment problem. In: Proceedings of the 12th International Conference on Informatics Research for Development of Knowledge Society Infrastructure, Kyoto, Japan, pp. 229–237. IEEE Computer Society Press, Los Alamitos, CA (2004)

    Chapter  Google Scholar 

  52. Yagiura, M., Iwasaki, S., Ibaraki, T., Glover, F.: A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem. Discrete Optimization 1, 87–98 (2004)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Operations Research Center, Massachusetts Institute of Technology, 77 Massachusetts Avenue, E40-130, Cambridge, MA 02139, USA

    Carol Meyers

  2. Sloan School of Management, Massachusetts Institute of Technology, 77 Massachusetts Avenue, E53-363, Cambridge, MA 02139, USA

    James B. Orlin

Authors
  1. Carol Meyers
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. James B. Orlin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Edmund K. Burke Hana Rudová

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Meyers, C., Orlin, J.B. (2007). Very Large-Scale Neighborhood Search Techniques in Timetabling Problems. In: Burke, E.K., Rudová, H. (eds) Practice and Theory of Automated Timetabling VI. PATAT 2006. Lecture Notes in Computer Science, vol 3867. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77345-0_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-77345-0_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-77344-3

  • Online ISBN: 978-3-540-77345-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation