A harmony search algorithm for university course timetabling
From MaRDI portal
Publication:1761885
DOI10.1007/s10479-010-0769-zzbMath1251.90310MaRDI QIDQ1761885
Mohammed Azmi Al-Betar, Ahamad Tajudin Khader
Publication date: 15 November 2012
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-010-0769-z
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
90B80: Discrete location and assignment
Related Items
An effective hybrid harmony search for the asymmetric travelling salesman problem, An integer program and a hybrid genetic algorithm for the university timetabling problem, Operational research in education, Novel selection schemes for harmony search, An analysis of selection methods in memory consideration for harmony search, Memetic techniques for examination timetabling, Hybridizing harmony search algorithm with different mutation operators for continuous problems, Practices in timetabling in higher education institutions: a systematic review, Recognizing faces prone to occlusions and common variations using optimal face subgraphs
Uses Software
Cites Work
- A survey of search methodologies and automated system development for examination timetabling
- An effective hybrid algorithm for university course timetabling
- Recent research directions in automated timetabling
- A graph-based hyper-heuristic for educational timetabling problems
- A survey of metaheuristic-based techniques for university timetabling problems
- A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice
- Hybridizing harmony search algorithm with sequential quadratic programming for engineering optimization problems
- Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition
- A time-predefined approach to course timetabling
- New methods to color the vertices of a graph
- Evolutionary Computation in Combinatorial Optimization
- Unnamed Item
- Unnamed Item