On the stability of the travelling salesman problem algorithm of Hopfield and Tank
Biological Cybernetics
“Teachers and classes” with neural networks
International Journal of Neural Systems
Exchanges procedures for timetabling problems
Discrete Applied Mathematics - Special issue: Timetabling and chromatic scheduling
Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
Annals of Operations Research - Special issue on Tabu search
Tabu Search
A Neural Network Parallel Algorithm for Meeting Schedule Problems
Applied Intelligence
Building University Timetables Using Constraint Logic Programming
Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
A Genetic Algorithm Solving a Weekly Course-Timetabling Problem
Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
Generating Complete University Timetables by Combining Tabu Search with Constraint Logic
PATAT '97 Selected papers from the Second International Conference on Practice and Theory of Automated Timetabling II
Recent Developments in Practical Course Timetabling
PATAT '97 Selected papers from the Second International Conference on Practice and Theory of Automated Timetabling II
Some Observations about GA-Based Exam Timetabling
PATAT '97 Selected papers from the Second International Conference on Practice and Theory of Automated Timetabling II
A Brute Forte and Heuristics Approach to Tertiary Timetabling
PATAT '97 Selected papers from the Second International Conference on Practice and Theory of Automated Timetabling II
A Comparison of Annealing Techniques for Academic Course Scheduling
PATAT '97 Selected papers from the Second International Conference on Practice and Theory of Automated Timetabling II
Off-the-Peg or Made-to-Measure? Timetabling and Scheduling with SA and TS
PATAT '97 Selected papers from the Second International Conference on Practice and Theory of Automated Timetabling II
Selected Papers from AISB Workshop on Evolutionary Computing
Specialised Recombinative Operators for Timetabling Problems
Selected Papers from AISB Workshop on Evolutionary Computing
Neural Networks for Combinatorial Optimization: a Review of More Than a Decade of Research
INFORMS Journal on Computing
FPGA Based Implementation of a Hopfield Neural Network for Solving Constraint Satisfaction Problems
EUROMICRO '98 Proceedings of the 24th Conference on EUROMICRO - Volume 2
Neural techniques for combinatorial optimization with applications
IEEE Transactions on Neural Networks
Existence and stability of equilibria of the continuous-time Hopfield neural network
Journal of Computational and Applied Mathematics
Classification with incomplete survey data: a Hopfield neural network approach
Computers and Operations Research
Computers and Operations Research
Applying evolutionary computation to the school timetabling problem: The Greek case
Computers and Operations Research
A MULTI-AGENT SYSTEM FOR UNIVERSITY COURSE TIMETABLING
Applied Artificial Intelligence
Solving Prize-Collecting Traveling Salesman Problem with Time Windows by Chaotic Neural Network
ISNN '07 Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks
An application of genetic algorithms to the school timetabling problem
Proceedings of the 2008 annual research conference of the South African Institute of Computer Scientists and Information Technologists on IT research in developing countries: riding the wave of technology
A simulated annealing algorithm with a new neighborhood structure for the timetabling problem
Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
A decision support model for scheduling exhibition projects in art museums
Expert Systems with Applications: An International Journal
Competitive Hopfield network combined with estimation of distribution for maximum diversity problems
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics - Special issue on cybernetics and cognitive informatics
Artificial Intelligence Review
A case study for timetabling in a dutch secondary school
PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
Expert Systems with Applications: An International Journal
A study into the use of hyper-heuristics to solve the school timetabling problem
SAICSIT '10 Proceedings of the 2010 Annual Research Conference of the South African Institute of Computer Scientists and Information Technologists
An informed genetic algorithm for the high school timetabling problem
SAICSIT '10 Proceedings of the 2010 Annual Research Conference of the South African Institute of Computer Scientists and Information Technologists
ISNN'05 Proceedings of the Second international conference on Advances in Neural Networks - Volume Part I
Solving effectively the school timetabling problem using particle swarm optimization
Expert Systems with Applications: An International Journal
Cyclic transfers in school timetabling
OR Spectrum
The university course timetabling problem with a three-phase approach
PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling
A hybrid particle swarm optimization based algorithm for high school timetabling problems
Applied Soft Computing
A comparative study of hyper-heuristics for solving the school timetabling problem
Proceedings of the South African Institute for Computer Scientists and Information Technologists Conference
Hi-index | 0.01 |
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.