Generic Memetic Algorithm for Course Timetabling ITC2007
作者： Jorge Alberto Soria-Alcaraz , Juan Martín Carpio , Héctor Puga , Patricia Melin , Hugo Terashima-Marín
DOI: 10.1007/978-3-319-05170-3_33
关键词: Generality 、 Administrative Activity 、 Course (navigation) 、 Memetic algorithm 、 Generic algorithms 、 Artificial intelligence 、 Competition (economics) 、 Computer science
摘要: Course timetabling is an important and recurring administrative activity in most educational institutions. This chapter describes automated configuration of a generic memetic algorithm to solving this problem. shows competitive results on well-known instances compared against top participants the recent International ITC2007 Timetabling Competition. Importantly, our study illustrates case where algorithms with increased autonomy generality achieve performance human designed problem-specific algorithms.
springer.com
sci-hub.st 参考文章(28)
Soria-Alcaraz Jorge A., Carpio Martin, Puga Héctor, Terashima-Marin Hugo, Cruz Reyes Laura, Sotelo-Figueroa Marco A., Methodology of Design: A Novel Generic Approach Applied to the Course Timetabling Problem Soft Computing Applications in Optimization, Control, and Recognition. pp. 287- 319 ,(2013) , 10.1007/978-3-642-35323-9_12
Holger H. Hoos, Automated Algorithm Configuration and Parameter Tuning Autonomous Search. pp. 37- 71 ,(2011) , 10.1007/978-3-642-21434-9_3
A Soria-Alcaraz Jorge, Carpio Martín, Puga Héctor, Marco Aurelio Sotelo-Figueroa, None, Comparison of Metaheuristic Algorithms with a Methodology of Design for the Evaluation of Hard Constraints over the Course Timetabling Problem hybrid intelligent systems. pp. 289- 302 ,(2013) , 10.1007/978-3-642-33021-6_23
Santiago E. Conant-Pablos, Dulce J. Magaña-Lozano, Hugo Terashima-Marín, Pipelining Memetic Algorithms, Constraint Satisfaction, and Local Search for Course Timetabling mexican international conference on artificial intelligence. ,vol. 5845, pp. 408- 419 ,(2009) , 10.1007/978-3-642-05258-3_36
Tim B. Cooper, Jeffrey H. Kingston, The Complexity of Timetable Construction Problems Selected papers from the First International Conference on Practice and Theory of Automated Timetabling. pp. 283- 295 ,(1995) , 10.1007/3-540-61794-9_66
Alberto Colorni, Marco Dorigo, Vittorio Maniezzo, Metaheuristics for High School Timetabling Computational Optimization and Applications. ,vol. 9, pp. 275- 298 ,(1998) , 10.1023/A:1018354324992
Nicholas J. Radcliffe, Patrick D. Surry, Formal Memetic Algorithms artificial intelligence and the simulation of behaviour. pp. 1- 16 ,(1994) , 10.1007/3-540-58483-8_1
Gyuri Lajos, Complete University Modular Timetabling Using Constraint Logic Programming Selected papers from the First International Conference on Practice and Theory of Automated Timetabling. pp. 146- 161 ,(1995) , 10.1007/3-540-61794-9_57
Jonathan M. Thompson, Kathryn A. Dowsland, A robust simulated annealing based examination timetabling system Computers & Operations Research. ,vol. 25, pp. 637- 648 ,(1998) , 10.1016/S0305-0548(97)00101-9
Nasser R. Sabar, Masri Ayob, Graham Kendall, Rong Qu, A honey-bee mating optimization algorithm for educational timetabling problems European Journal of Operational Research. ,vol. 216, pp. 533- 543 ,(2012) , 10.1016/J.EJOR.2011.08.006