Solving the Course Timetabling Problem with a Hybrid Heuristic Algorithm

DOI10.1007/978-3-540-85776-1_22zbMath1169.68608OpenAlexW1503005132MaRDI QIDQ3534665

Jin-Kao Hao, Zhipeng Lü

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 searchtimetablingconstraint solvingiterated local searchhybrid heuristic

Mathematics Subject Classification ID

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

Related Items (2)

A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem ⋮ An assignment problem and its application in education domain: a review and potential path

Cites Work

• Unnamed Item
• 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
• A graph-based hyper-heuristic for educational timetabling problems
• A survey of metaheuristic-based techniques for university timetabling problems

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