A Comparison of Discrete and Continuous Neural Network Approaches to Solve the ...

• Author(s): Carrasco, Marco Paulo ; Pato, Margarida Vaz
• Date: 2001
• Persistent ID: http://hdl.handle.net/10400.5/1427
• Origin: Repositório da UTL
• Subject(s): Timetabling; Metaheuristics; Neural Networks
• Document Type: Other
• Language: English

Description

This study explores the application of neural network-based heuristics to the class/teacher timetabling problem (CTTP). The paper begins by presenting the basic CTTP characteristics in terms of hard and soft constraints and proposing a formulation for the energy function required to map the problem within the artificial neural network model. There follow two distinct approaches to simulating neural network evolution. The first uses a Potts mean-field annealing simulation based on continuous Potts neurons, which has obtained favorable results in various combi¬natorial optimization problems. Afterwards, a discrete neural network simulation, based on discrete winner-take-all neurons, is proposed. The paper concludes with a comparison of the computational results taken from the application of both heuris¬tics to hard hypothetical and real CTTP instances. This experiment demonstrates that the discrete approach performs better, in terms of solution quality as well as execution time.