Solving the Course Timetabling Problem with a Hybrid Heuristic Algorithm

DOI10.1007/978-3-540-85776-1_22MaRDI QIDQ3534665zbMATH OpenOpenAlexFDO

Authors Zhipeng Lü, Jin-Kao Hao

Publication date 4 November 2008

Published in Artificial Intelligence: Methodology, Systems, and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-85776-1_22

zbMATH Keywords

tabu searchiterated local searchtimetablinghybrid heuristicconstraint solving

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A heuristic approach to simultaneous course/student timetabling
• Hybrid heuristics for examination timetabling problem
• An effective hybrid algorithm for university course timetabling
• A tabu search algorithm to solve a course timetabling problem
• Metaheuristics for university course timetabling
• Effective learning hyper-heuristics for the course timetabling problem

Cites work

• scientific article; zbMATH DE number 1062113 (Why is no real title available?)
• A graph-based hyper-heuristic for educational timetabling problems
• A survey of metaheuristic-based techniques for university timetabling problems
• An effective hybrid algorithm for university course timetabling
• Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results
• ITC2007 solver description: a hybrid approach

Cited in

(13)

• Effective learning hyper-heuristics for the course timetabling problem
• An assignment problem and its application in education domain: a review and potential path
• Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem
• An effective hybrid algorithm for university course timetabling
• A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem
• Using a randomised iterative improvement algorithm with composite neighbourhood structures for the university course timetabling problem
• Minimum penalty perturbation heuristics for curriculum-based timetables subject to multiple disruptions
• Adaptive tabu search for course timetabling
• A harmony search algorithm for university course timetabling
• Applying the threshold accepting metaheuristic to~curriculum based course timetabling
• A tabu search algorithm to solve a course timetabling problem
• A time-predefined approach to course timetabling
• Adaptive large neighborhood search for the curriculum-based course timetabling problem

This page was built for publication: Solving the Course Timetabling Problem with a Hybrid Heuristic Algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3534665)