×

Timetable construction with Markovian neural network. (English) Zbl 0784.90038

Summary: A neural network which efficiently and nearly optimally solves combinatorial optimization problems was applied to the timetable problem. The network was tested on a real-world timetable problem. The results indicate that the Markovian neural network is an efficient and flexible tool for solving real-world combinatorial optimization problems such as construction of a timetable for high schools.

MSC:

90B35 Deterministic scheduling theory in operations research
92B20 Neural networks for/in biological studies, artificial life and related topics
90C27 Combinatorial optimization
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Bonomi, E.; Lutton, J., The \(N\)-city Travelling Salesman Problem: Statistical mechanics and the metropolis algorithm, SIAM Review, 26, 551-568 (1984) · Zbl 0551.90095
[2] Golombic, M. C.; Markovich, M.; Tsur, S.; Schild, U. J., A knowledge-based expert system for student advising, IEEE Transactions on Education, E-29, 120-124 (1986)
[3] Kirkpatrick, S.; Gelatt, C. D.; Vecchi, M. P., Optimization by simulated annealing, Science, 220, 671-680 (1983) · Zbl 1225.90162
[4] Kovačič, M., Markovian neural networks, Biological Cybernetics, 64, 337-342 (1991) · Zbl 0722.90060
[5] Metropolis, N.; Rosenbluth, A. W.; Rosenbluth, M. N.; Teller, A. H.; Teller, W., Equation of state calculations by fast computing machines, Journal of Chemical Physics, 21, 1087-1092 (1953) · Zbl 1431.65006
[6] Takács, L., Stochastic Processes (1960), Wiley: Wiley New York · Zbl 0096.11301
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.