Very large-scale neighborhood search techniques in timetabling problems

  • Authors:

  • Carol Meyers;James B. Orlin

  • Affiliations:

  • Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA;Sloan School of Management, Massachusetts Institute of Technology, Cambridge, MA

  • Venue:
  • PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

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.