Application of an annealed neural network to a timetabling problem

INFORMS Journal on Computing

Volumn 8, Issue 2, 1996, Pages 103-117

  Mausser, Helmut E ^a   Magazine, Michael J ^b   Moore, John B ^c  

^a UNIVERSITY OF COLORADO   (United States)

^b UNIVERSITY OF CINCINNATI   (United States)

^c UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Neural networks; Simulated annealing; Timetabling

Indexed keywords

EID: 0000648536     PISSN: 10919856     EISSN: None     Source Type: Journal    
DOI: 10.1287/ijoc.8.2.103     Document Type: Article

References (17)

1. G. BILBRO, R. MANN, T.K. MILLER, W.E. SNYDER, D.E. VAN DEN BOUT, and M. WHITE, 1989. Optimization by Mean Field An-nealing, in Advances in Neural Information Processing Systems I (Denver 1988), D.S. Touretzky (ed.), Morgan Kaufman, San Mateo, pp. 91-98.
2. D. DE WERRA, 1985. An Introduction to Timetabling, European Journal of Operational Research 19, 151-162.
3. S. EVEN, A. ITAI, and A. SHAMIR, 1976. On the Complexity of Timetable and Multicommodity Flow Problems, SIAM Journal on Computing 5, 691-703.
4. L. GISLÉN, C. PETERSON, and B. SÖDERBERG, 1989. Teachers and Classes with Neural Networks, International Journal of Neural Systems 1, 167-176.
5. L. GISLÉN, C. PETERSON, and B. SÖDERBERG, 1992. Complex Scheduling with Potts Neural Networks, Neural Computation 4, 805-831.
6. F. GLOVER and H.J. GREENBERG, 1989. New Approaches for Heuristic Search: A Bilateral Linkage with Artificial Intelligence, European Journal of Operational Research 39, 119-130.
7. J.J. HOPFIELD, 1984. Neurons with Graded Response Have Collective Computational Properties Like Those of Two-State Neurons, Proceedings of the National Academy of Sciences USA 81, 3088-3092.
8. J.J. HOPFIELD and D.W. TANK, 1986. Simple Neural Optimization Networks: An A/D Converter, Signal Decision Circuit, and a Linear Programming Circuit, IEEE Transactions on Circuits and Systems CAS 33, 533-541.
9. H.E. MAUSSER, 1992. The Application of an Annealed Neural Net-work to a Timetabling Problem, Master's Thesis, University of Waterloo, Waterloo, Ontario.
10. C. PETERSON and J.R. ANDERSON, 1988. Neural Networks and NP-Complete Optimization Problems; A Performance Study on the Graph Bisection Problem, Complex Systems 2, 59-89.
11. C. PETERSON and B. SÖDERBERG, 1989. A New Method for Mapping Optimization Problems onto Neural Networks, International Journal of Neural Systems 1, 3-22.
12. J.Y. POTVIN, 1993. The Traveling Salesman Problem: A Neural Network Perspective, ORSA Journal on Computing 5, 328-348.
13. J. RAMANUJAM and P. SADAYAPPAN, 1988. Optimization by Neural Networks, IEEE International Conference on Neural Networks (San Diego 1988), Vol. II, IEEE, New York, pp. 325-332.
14. D.E. VAN DEN BOUT and T.K. MILLER III, 1989. Graph Partitioning Using Annealed Neural Networks, International Joint Conference on Neural Networks (Washington 1989), Vol. I, IEEE, New York, pp. 521-528.
15. D.E. VAN DEN BOUT and T.K. MILLER III, 1989. Improving the Performance of the Hopfield-Tank Neural Network Through Normalization and Annealing, Biological Cybernetics 62, 129-139.
16. D.E. VAN DEN BOUT and T.K. MILLER III, 1990. Graph Partitioning Using Annealed Neural Networks, IEEE Transactions on Neural Networks 1, 192-203.
17. E. WACHOLDER, 1989. A Neural Network-Based Optimization Algorithm for the Static Weapon-Target Assignment Problem, ORSA Journal on Computing 1, 232-246.