Finding a feasible course schedule using Tabu search
Discrete Applied Mathematics - Special issue: Timetabling and chromatic scheduling
Metaheuristics for High School Timetabling
Computational Optimization and Applications
A Survey of Automated Timetabling
Artificial Intelligence Review
A Constructive Evolutionary Approach to School Timetabling
Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
Timetabling the Classes of an Entire University with an Evolutionary Algorithm
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Improving Evolutionary Timetabling with Delta Evaluation and Directed Mutation
PPSN III Proceedings of the International Conference on Evolutionary Computation. The Third Conference on Parallel Problem Solving from Nature: Parallel Problem Solving from Nature
A Hybrid Genetic Algorithm for School Timetabling
AI '02 Proceedings of the 15th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
A Genetic Algorithm Solving a Weekly Course-Timetabling Problem
Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
Recent Developments in Practical Course Timetabling
PATAT '97 Selected papers from the Second International Conference on Practice and Theory of Automated Timetabling II
Tabu Search Techniques for Examination Timetabling
PATAT '00 Selected papers from the Third International Conference on Practice and Theory of Automated Timetabling III
Fast Practical Evolutionary Timetabling
Selected Papers from AISB Workshop on Evolutionary Computing
Memetic algorithms for parallel code optimization
International Journal of Parallel Programming
Applying evolutionary computation to the school timetabling problem: The Greek case
Computers and Operations Research
A comprehensive analysis of hyper-heuristics
Intelligent Data Analysis
An application of genetic algorithms to the school timetabling problem
Proceedings of the 2008 annual research conference of the South African Institute of Computer Scientists and Information Technologists on IT research in developing countries: riding the wave of technology
A case study of memetic algorithms for constraint optimization
Soft Computing - A Fusion of Foundations, Methodologies and Applications - Special Issue on Emerging Trends in Soft Computing - Memetic Algorithms; Guest Editors: Yew-Soon Ong, Meng-Hiot Lim, Ferrante Neri, Hisao Ishibuchi
INFORMS Journal on Computing
Memes, self-generation and nurse rostering
PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
An experimental study on hyper-heuristics and exam timetabling
PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
Tabu search techniques for large high-school timetabling problems
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
An informed genetic algorithm for the high school timetabling problem
SAICSIT '10 Proceedings of the 2010 Annual Research Conference of the South African Institute of Computer Scientists and Information Technologists
Memetic algorithms for nurse rostering
ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
A multistage evolutionary algorithm for the timetable problem
IEEE Transactions on Evolutionary Computation
Meta-Lamarckian learning in memetic algorithms
IEEE Transactions on Evolutionary Computation
Classification of adaptive memetic algorithms: a comparative study
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A hyper-heuristic with a round robin neighbourhood selection
EvoCOP'13 Proceedings of the 13th European conference on Evolutionary Computation in Combinatorial Optimization
Evolutionary algorithms using cluster patterns for timetabling
Intelligent Decision Technologies
Hi-index | 0.01 |
Timetabling problems are well known NP-hard constraint satisfaction problems, and real-world cases often have complicated and challenging structures. For such problems, we present a new hybrid method, ''Interleaved Constructive Memetic Algorithm'' (ICMA) that interleaves memetic algorithms with constructive methods. ICMA works using an active subset of all the events. Starting with a few events, in multiple construction stages ICMA increases the active set to eventually include all of them. At each stage, a memetic algorithm (MA) is applied to improve the current partial solution before the next construction step. We also describe a real-world course timetabling problem, the ''Preparation School Timetabling Problem'' (PSTP), which is of particular interest because it has a highly hierarchical structure arising from various organisational requirements. An important advantage of ICMA is that both the constructive heuristics and MA can be tailored to exploit such hierarchical structures. We give empirical results showing that ICMA performs better than the corresponding conventional MA on the PSTP.