Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Hopfield Neural Networks for Timetabling: Formulations, Methods, and Comparative Results
 

Summary: 1
Hopfield Neural Networks for Timetabling: Formulations, Methods,
and Comparative Results
Kate A. Smith1*
, David Abramson2
, and David Duke2
1
School of Business Systems, and
2
School of Computer Science and Software Engineering
P. O. Box 63B, Monash University
Victoria 3800
Australia
Abstract
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

  

Source: Abramson, David - Caulfield School of Information Technology, Monash University

 

Collections: Computer Technologies and Information Sciences