Hopfield neural networks for timetabling: formulations, methods, and comparative results

This paper considers the use of discrete Hopfield neural networks for solving school timetabling problems. Two alternative formulations are provided for the problem: a standard Hopfield-Tank approach, and a more compact formulation which allows the Hopfield network to be competitive with swapping heuristics. It is demonstrated how these formulations can lead to different results. The Hopfield network dynamics are also modified to allow it to be competitive with other metaheuristics by incorporating controlled stochasticities. These modifications do not complicate the algorithm, making it possible to implement our Hopfield network in hardware. The neural network results are evaluated on benchmark data sets and are compared with results obtained using greedy search, simulated annealing and tabu search.

[1]  Marimuthu Palaniswami,et al.  Traditional heuristic versus Hopfield neural network approaches to a car sequencing problem , 1996 .

[2]  George M. White,et al.  Generating Complete University Timetables by Combining Tabu Search with Constraint Logic , 1997, PATAT.

[3]  Wilhelm Erben,et al.  A Genetic Algorithm Solving a Weekly Course-Timetabling Problem , 1995, PATAT.

[4]  D. Abramson,et al.  School Timetables: A Case Study in Simulated Annealing , 1993 .

[5]  M Yoshikawa,et al.  Practical School Timetabling: a Hybrid Approach Using Solution Synthesis and Iterative Repair. In , 1998 .

[6]  J J Hopfield,et al.  Neurons with graded response have collective computational properties like those of two-state neurons. , 1984, Proceedings of the National Academy of Sciences of the United States of America.

[7]  Yoshiyasu Takefuji,et al.  A Neural Network Parallel Algorithm for Meeting Schedule Problems , 1996, Proceedings of Digital Processing Applications (TENCON '96).

[8]  David Abramson,et al.  A simulated annealing code for general integer linear programs , 1999, Ann. Oper. Res..

[9]  Edmund K. Burke,et al.  Specialised Recombinative Operators for Timetabling Problems , 1995, Evolutionary Computing, AISB Workshop.

[10]  Kate A. Smith,et al.  Neural Networks for Combinatorial Optimization: a Review of More Than a Decade of Research , 1999 .

[11]  L. Bianco,et al.  A heursitic procedure for the crew rostering problem , 1992 .

[12]  Alon Itai,et al.  On the Complexity of Timetable and Multicommodity Flow Problems , 1976, SIAM J. Comput..

[13]  Nirbhay K. Mehta.  The Application of a Graph Coloring Method to an Examination Scheduling Problem , 1981 .

[14]  George Papageorgiou,et al.  Improved exploration in Hopfield network state-space through parameter perturbation driven by simulated annealing , 1998, Eur. J. Oper. Res..

[15]  Jeffrey H. Kingston,et al.  The Solution of Real Instances of the Timetabling Problem , 1993, Comput. J..

[16]  Carsten Peterson,et al.  "Teachers and Classes" with Neural Networks , 1991, Int. J. Neural Syst..

[17]  Ibrahim H. Osman,et al.  Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem , 1993, Ann. Oper. Res..

[18]  INPG-LTIRF.  Scheduling with neural networks : Application to timetable construction , 2003 .

[19]  D. de Werra,et al.  An introduction to timetabling , 1985 .

[20]  D. Costa,et al.  A tabu search algorithm for computing an operational timetable , 1994 .

[21]  S. W. Melville,et al.  A Brute Forte and Heuristics Approach to Tertiary Timetabling , 1997, PATAT.

[22]  Marimuthu Palaniswami,et al.  Neural techniques for combinatorial optimization with applications , 1998, IEEE Trans. Neural Networks.

[23]  J J Hopfield,et al.  Neural networks and physical systems with emergent collective computational abilities. , 1982, Proceedings of the National Academy of Sciences of the United States of America.

[24]  David Connolly.  An improved annealing scheme for the QAP , 1990 .

[25]  J. J. Hopfield,et al.  “Neural” computation of decisions in optimization problems , 1985, Biological Cybernetics.

[26]  George M. White,et al.  An heuristic method for optimizing examination schedules which have day and evening courses , 1983 .

[27]  Matevž Kovačič,et al.  Timetable construction with Markovian neural network , 1993 .

[28]  John B. Moore,et al.  Application of an Annealed Neural Network to a Timetabling Problem , 1996, INFORMS J. Comput..

[29]  Marco Dorigo,et al.  Genetic Algorithms: A New Approach to the Timetable Problem , 1992 .

[30]  Yoshiyasu Takefuji,et al.  A Neural Network Parallel Algorithm for Meeting Schedule Problems , 2004, Applied Intelligence.

[31]  A. Hertz.  Tabu search for large scale timetabling problems , 1991 .

[32]  Éric D. Taillard,et al.  Robust taboo search for the quadratic assignment problem , 1991, Parallel Comput..

[33]  Gilbert Laporte,et al.  Recent Developments in Practical Course Timetabling , 1997, PATAT.

[34]  Patrice Boizumault,et al.  Building University Timetables Using Constraint Logic Programming , 1995, PATAT.

[35]  David Connolly,et al.  General Purpose Simulated Annealing , 1992 .

[36]  A. Pascu.  Operational research '81: J.P. Brans (Ed.) Proceedings of the Ninth IFORS International Conference on Operational Research, Hamburg, Germany, July 20–24, 1981, North-Holland, Amsterdam, 1981, xx + 984 pages, Dfl.250.000 , 1982 .

[37]  George M. White,et al.  A logic approach to the resolution of constraints in timetabling , 1992 .

[38]  Joo-Hwee Lim,et al.  Timetable scheduling using neural networks with parallel implementation on transputers , 1991, [Proceedings] 1991 IEEE International Joint Conference on Neural Networks.

[39]  G. Fandel,et al.  Lecture Notes in Economics and Mathematics Systems , 1997 .

[40]  Kate Smith-Miles,et al.  Neural Networks for Combinatorial Optimization: A Review of More Than a Decade of Research , 1999, INFORMS J. Comput..

[41]  Gilbert Laporte,et al.  Metaheuristics: A bibliography , 1996, Ann. Oper. Res..

[42]  Helmut Mausser,et al.  Comparison of neural and heuristic methods for a timetabling problem , 1996 .

[43]  D. E. Van den Bout,et al.  Improving the performance of the Hopfield-Tank neural network through normalization and annealing , 1989, Biological Cybernetics.

[44]  Kathryn A. Dowsland,et al.  Off-the-Peg or Made-to-Measure? Timetabling and Scheduling with SA and TS , 1997, PATAT.

[45]  Peter Ross,et al.  Some Observations about GA-Based Exam Timetabling , 1997, PATAT.

[46]  G. Pawley,et al.  On the stability of the Travelling Salesman Problem algorithm of Hopfield and Tank , 2004, Biological Cybernetics.

[47]  Geoffrey C. Fox,et al.  A Comparison of Annealing Techniques for Academic Course Scheduling , 1997, PATAT.

[48]  David Abramson,et al.  FPGA based implementation of a Hopfield neural network for solving constraint satisfaction problems , 1998, Proceedings. 24th EUROMICRO Conference (Cat. No.98EX204).

[49]  Peter Ross,et al.  Comparing Genetic Algorithms, Simulated Annealing, and Stochastic Hillclimbing on Timetabling Problems , 1995, Evolutionary Computing, AISB Workshop.

[50]  David Abramson,et al.  Constructing school timetables using simulated annealing: sequential and parallel algorithms , 1991 .

[51]  Ibrahim H. Osman,et al.  Heuristics for the generalised assignment problem: simulated annealing and tabu search approaches , 1995 .

[52]  Edmund K. Burke,et al.  The practice and theory of automated timetabling , 2014, Annals of Operations Research.

[53]  Jacques A. Ferland,et al.  Exchanges procedures for timetabling problems , 1992, Discret. Appl. Math..

[54]  Mike Wright,et al.  School Timetabling Using Heuristic Search , 1996 .

[55]  Marcus Randall,et al.  A General Meta-Heuristic Based Solver for Combinatorial Optimisation Problems , 2001, Comput. Optim. Appl..

[56]  Peter L. Hammer,et al.  Discrete Applied Mathematics , 1993 .

[57]  Edmund K. Burke,et al.  Practice and Theory of Automated Timetabling II , 1997, Lecture Notes in Computer Science.

[58]  Edmund Ph. D. Burke,et al.  Practice and theory of automated timetabling II : second International Conference, PATAT '97, Toronto, Canada, August 20-22, 1997 : selected papers , 1998 .

[59]  D. de Werra,et al.  Chromatic optimisation: Limitations, objectives, uses, references , 1982 .