Application of an Annealed Neural Network to a Timetabling Problem
Helmut E. Mausser, Michael J. Magazine, John B. Moore
INFORMS Journal on Computing · 1996 · Volume 8 · Issue 2
Abstract
In this paper, we use an annealed neural network to solve a timetabling problem with contiguity and availability constraints. A novel feature of the problem is that it may not be possible to satisfy the complete set of scheduling requirements, forcing the network to exhibit selection capability. We formulate the problem in a manner consistent with neural computation, describe our implementation of the annealed neural network, and report computational results for a series of randomly-generated problems. Solution quality varies depending on the size and difficulty of the problem, as well as on the values of the penalty parameters used to weight the various constraints.
Keywords
computers/computer science, artificial intelligence, education systems, operations, neural networks, simulated annealing, timetabling
Enable JavaScript for citation tools and additional paper interactions.