Simulated annealing with penalization for university course timetabling
From MaRDI portal
Recommendations
- Two-stage multi-neighborhood simulated annealing for uncapacitated examination timetabling
- A simulated annealing algorithm for university course timetabling considering travelling distances
- Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem
- Feature-based tuning of single-stage simulated annealing for examination timetabling
- Improved local search approaches to solve the post enrolment course timetabling problem
Cites work
- A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem
- A simulated annealing algorithm for university course timetabling considering travelling distances
- A simulated annealing and hill-climbing algorithm for the traveling tournament problem
- Adaptive tabu search for course timetabling
- An ILP based heuristic for a generalization of the post-enrollment course timetabling problem
- An overview of curriculum-based course timetabling
- Applying the threshold accepting metaheuristic to~curriculum based course timetabling
- Convergence of an annealing algorithm
- Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem
- ITC2007 solver description: a hybrid approach
- Local search and constraint programming for the post enrolment-based course timetabling problem
- Random partial neighborhood search for the post-enrollment course timetabling problem
- Simulated Annealing with a Temperature Dependent Penalty Function
- Stochastic Tunneling Approach for Global Minimization of Complex Potential Energy Landscapes
- The Theory and Practice of Simulated Annealing
Cited in
(1)
This page was built for publication: Simulated annealing with penalization for university course timetabling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6090224)