Ara
Toplam kayıt 2, listelenen: 1-2
Bi-Criteria Simulated Annealing Algorithms for the Robust University Course Timetabling Problem
(PATAT, 2018)
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
(Patat, 2016)
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 ...