Now showing items 1-3 of 3
Bi-Criteria Simulated Annealing Algorithms for the Robust University Course Timetabling Problem
A bi-criteria version of the curriculum-based university timetabling problem of ITC-2007 is solved using a multi-objective simulated annealing (MOSA) algorithm that identifies an approximation to the optimal Pareto front. ...
A Bi-criteria Hybrid Genetic Algorithm with Robustness Objective for the Course Timetabling Problem
Traditional methods of generating timetables may not yield robust solutions that may easily be adapted to changing inputs. Incorporating late changes by making minimum modifications is an important need in many ...
Search Space Sampling by Simulated Annealing for Identifying Robust Solutions in Course Timetabling
(Institute of Electrical and Electronics Engineers Inc., 2020)
For many combinatorial optimization problems, it is important to identify solutions that can be repaired without degrading solution quality in case changes in the data associated with the constraints make the initial ...