A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem
From MaRDI portal
Publication:339653
DOI10.1016/j.cor.2012.03.011zbMath1349.90349OpenAlexW2048957381MaRDI QIDQ339653
Kim Leng Poh, Kien Ming Ng, Aldy Gunawan
Publication date: 11 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://ink.library.smu.edu.sg/sis_research/3983
Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (8)
A MILP model for the teacher assignment problem considering teachers' preferences ⋮ Developing compact course timetables with optimized student flows ⋮ A fix-and-optimize heuristic for the high school timetabling problem ⋮ Optimization in dubbing scheduling ⋮ Variable neighborhood descent search based algorithms for course timetabling problem: application to a Tunisian university ⋮ Simulated annealing with penalization for university course timetabling ⋮ Solving university course timetabling problems using constriction particle swarm optimization with local search ⋮ Solving a real constraint satisfaction model for the university course timetabling problem: a case study
Cites Work
- Unnamed Item
- Optimization by Simulated Annealing
- A heuristic approach to simultaneous course/student timetabling
- A mixed-integer programming approach to a class timetabling problem: a case study with gender policies and traffic considerations
- An effective hybrid algorithm for university course timetabling
- A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times
- Application of a real-world university-course timetabling model solved by integer programming
- Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems
- Decomposition, reformulation, and diving in university course timetabling
- Computerised decision aid for timetabling --- a case analysis
- The teacher assignment problem: A special case of the fixed charge transportation problem
- Applied simulated annealing
- An integer programming formulation for a case study in university timetabling.
- Design and implementation of a course scheduling system using Tabu Search
- Future paths for integer programming and links to artificial intelligence
- Efficient solutions for a university timetabling problem through integer programming
- A decomposed metaheuristic approach for a real-world university timetabling problem
- Adaptive tabu search for course timetabling
- New integer linear programming approaches for course timetabling
- A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem
- Neighborhood portfolio approach for local search applied to timetabling problems
- A Lagrangian relaxation approach to multi-period inventory/distribution planning
- Solving the Course Timetabling Problem with a Hybrid Heuristic Algorithm
- A Lagrangian Relaxation Approach To The Classroom Assignment Problem*
- A Lagrangean Relaxation Approach to Course Timetabling
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- On the Complexity of Timetable and Multicommodity Flow Problems
- Tabu search embedded simulated annealing for the shortest route cut and fill problem
This page was built for publication: A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem
