A comparison of discrete and continuous neural network approaches to solve the class/teacher timetabling problem

European Journal of Operational Research

Volumn 153, Issue 1, 2004, Pages 65-79

  Carrasco, M P ^a,b   Pato, M V ^b  

^a UNIVERSITY OF ALGARVE   (Portugal)

^b UNIVERSITY OF LISBON   (Portugal)

Author keywords

Metaheuristics; Neural networks; Timetabling

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER SIMULATION; GENETIC ALGORITHMS; HEURISTIC METHODS; MATHEMATICAL MODELS; NEURAL NETWORKS; SIMULATED ANNEALING;

METAHEURISTICS; TIMETABLING;

PROBLEM SOLVING;

EID: 0142094594     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(03)00099-7     Document Type: Conference Paper

References (34)

1. Abramson D. Constructing school timetables using simulated annealing: Sequential and parallel algorithms. Management Science. 37:1982;83-113.
2. Birbas T., Daskalaki S., Housos E. Timetabling for Greek high schools. Journal of the Operational Research Society. 48:1997;1191-1200.
3. Burke E., Elliman D., Weare R. Examination timetabling in British universities - A survey. Burke E., Ross P. The Practice and Theory of Automated Timetabling. LNCS vol. 1153:1996;76-90 Springer-Verlag, Edinburgh.
4. Beasley J. OR-Library: Distributing test problems by electronic mail. Journal of the Operational Research Society. 41(11):1990;1069-1072.
5. M.P. Carrasco, Redes Neuronais na Elaboração de Horários Escolares, Master thesis, Instituto Superior de Economia e Gestão, Universidade Técnica de Lisboa, 1995.
6. M.P. Carrasco, M.V. Pato, A potts neural network heuristic for the class/teacher timetabling problem, in: Proceedings of the 4th Metaheuristics International Conference, 2001, pp. 139-142.
7. Carrasco M.P., Pato M.V. A multiobjective genetic algorithm for the class/teacher timetabling problem. Burke E., Erben E. The Practice and Theory of Automated Timetabling III. LNCS vol. 2079:2001;3-17 Springer-Verlag, Konstanz.
8. Carter M., Laporte G. Recent developments in practical examination timetabling. Burke E., Ross P. The Practice and Theory of Automated Timetabling. LNCS vol. 1153:1996;3-21 Springer-Verlag, Edinburgh.
9. Carter M., Laporte G. Recent developments in pratical examination timetabling. Burke E., Carter M. The Practice and Theory of Automated Timetabling II. LNCS vol. 1408:1998;3-21 Springer-Verlag, Berlin.
10. A. Colorni, M. Dorigo, V. Maniezzo, Genetic algorithms and highly constrained problems: the timetabling case, in: Proceedings of the First International Conference on Parallel Problem Solving from Nature, 1982, pp. 55-59.
11. Colorni D., Dorigo M., Maniezzo V. Metaheuristics for high-school timetabling. Computational Optimization and Applications. 9(3):1998;277-298.
12. Costa D. A tabu search algorithm for computing an operational timetable. European Journal of Operational Research. 76:1994;98-110.
13. Dowsland K. A timetabling problem in which clashes are inevitable. Journal of the Operational Research Society. 41(10):1990;907-908.
14. Even S., Itai A., Shamir A. On the complexity of timetabling and multicommodity flow problems. SIAM Journal of Computation. 5(4):1976;691-703.
15. P. Gianoglio, Application of neural networks to timetable construction, in: Proceedings of the Third International Workshop on Neural Networks and Their Applications, Nîmes, France, 1990, pp. 53-77.
16. Gislén L., Peterson C., Söderberg B. Teachers and classes with neural networks. International Journal of Neural Systems. 1:1989;167-176.
17. Gislén L., Peterson C., Söderberg B. Complex scheduling with potts neural networks. Neural Computation. 4:1992;805-831.
18. Hopfield J., Tank D. Neural computation of decisions in optimization problems. Biological Cybernetics. 52:1985;141-152.
19. Looi C. Neural network methods in combinatorial optimization. Computer and Operations Research. 19(3/4):1992;191-208.
20. Kiar L., Yellen J. Weighted graphs and university course timetabling. Computer and Operations Research. 19(1):1992;59-67.
21. Kovacic M. Timetable construction with markovian neural networks. European Journal of Operational Research. 69:1993;92-96.
22. L. Paquete, C. Fonseca, A study of examination timetabling with multiobjective evolutionary algorithms, in: Proceedings of the 4th Metaheuristics International Conference, 2001, pp. 149-153.
23. Peterson C., Söderberg B. A new method for mapping optimization problems onto neural networks. International Journal of Neural Systems. 1(3):1989;3-22.
24. L. Ramanujam, P. Sadayappan, Optimization by neural networks, in: Proceedings of the IEEE Second International Neural Network Conference, vol. 2, 1988, pp. 325-332.
25. Schaerf A. A survey of automated timetabling. Artificial Intelligence Review. 13:1999;87-127.
26. A. Schaerf, Tabu search techniques for large high-school timetabling problems, in: Proceeding of the Fourteenth National Conference on Artificial Intelegence, Portland, 1996, pp. 363-368.
27. Smith K. Neural networks for combinatorial optimization: A review of more than a decade of research. INFORMS Journal on Computing. 11:1999;15-34.
28. Tsuchiya K., Takefuji Y. A neural network parallel algorithm for meeting schedule problems. International Journal of Artificial Intelligence, Neural Networks and Complex Problem-Solving Technologies. 7(3):1997;205-213.
29. Tripathy A. School timetabling - a case in large binary integer linear programming. Management Science. 30(12):1984;1473-1498.
30. Van Den Bout D., Miller T. Improving the performance of the hopfield-tank neural network through normalization and annealing. Biological Cybernetics. 62:1989;123-139.
31. M. Yoshikawa, E. Kaneko, Y. Nomura, M. Watanabe, A constraint-based approach to high-school timetabling problems: A case study, in: Proceedings of the 12th Conference on Artificial Intelligence, vol. 94, 1994, pp. 1111-1116.
32. Werra D. An introduction to timetabling. European Journal of Operational Research. 19:1985;151-162.
33. Werra D. Some combinatorial models for course scheduling. Burke E., Ross P. The Practice and Theory of Automated Timetabling. LNCS vol. 1153: 1996;296-308 Springer-Verlag, Edinburgh.
34. Werra D. The combinatorics of timetabling. European Journal of Operational Research. 96:1997;504-513.