Metaheuristics for High School Timetabling
作者： Alberto Colorni , Marco Dorigo , Vittorio Maniezzo
关键词:
摘要: In this paper we present the results of an investigation possibilities offered by three well-known metaheuristic algorithms to solve timetable problem, a multi-constrained, NP-hard, combinatorial optimization problem with real-world applications. First, our model including definition hierarchical structure for objective function, and neighborhood search operators which apply matrices representing timetables. Then report about outcomes utilization implemented systems specific case generation school timetable. We compare obtained simu lated annealing, tabu two versions, without local search, genetic algorithm. Our show that GA based on temporary relaxations both outperform simulated annealing handmade
springer.com
ulb.ac.be
acm.org 
researchgate.net 
sci-hub.se 参考文章(30)
Andrea Schaerf, Marco Schaerf, Local Search Techniques for High School Timetabling PATAT. ,(1995)
John H. Holland, Adaptation in natural and artificial systems ,(1992)
David C. Rich, A Smart Genetic Algorithm for University Timetabling Selected papers from the First International Conference on Practice and Theory of Automated Timetabling. pp. 181- 197 ,(1995) , 10.1007/3-540-61794-9_59
E. K. Burke, J. P. Newall, R. F. Weare, A Memetic Algorithm for University Exam Timetabling Selected papers from the First International Conference on Practice and Theory of Automated Timetabling. pp. 241- 250 ,(1995) , 10.1007/3-540-61794-9_63
Alberto Colorni, Marco Dorigo, Vittorio Maniezzo, Genetic Algorithms: A New Approach to the Timetable Problem Combinatorial Optimization. ,vol. 82, pp. 235- 239 ,(1992) , 10.1007/978-3-642-77489-8_14
Wilhelm Erben, Jürgen Keppler, A Genetic Algorithm Solving a Weekly Course-Timetabling Problem Selected papers from the First International Conference on Practice and Theory of Automated Timetabling. pp. 198- 211 ,(1995) , 10.1007/3-540-61794-9_60
E. Taillard, Paper: Robust taboo search for the quadratic assignment problem parallel computing. ,vol. 17, pp. 443- 455 ,(1991) , 10.1016/S0167-8191(05)80147-4
J. Csima, C. C. Gotlieb, Tests on a computer method for constructing school timetables Communications of the ACM. ,vol. 7, pp. 160- 163 ,(1964) , 10.1145/363958.363986
Pablo Moscato, An introduction to population approaches for optimization and hierarchical objective functions: A discussion on the role of tabu search Annals of Operations Research. ,vol. 41, pp. 85- 121 ,(1993) , 10.1007/BF02022564
Jacques A. Ferland, Serge Roy, Timetabling problem for university as assignment of activities to resources Computers & Operations Research. ,vol. 12, pp. 207- 218 ,(1985) , 10.1016/0305-0548(85)90045-0