Investigating a round robin strategy over multi algorithms in optimising the quality of university course timetables
This paper tackles university course timetabling problems (UCTP) to find a (near) optimal solution (timetable) while satisfying hard constraints (essential requirements) and minimizing as much as possible the violations of the soft constrains (desirable requirements). In this study, we apply three a...
保存先:
主要な著者: | , , |
---|---|
その他の著者: | |
フォーマット: | 論文 |
出版事項: |
2023
|
主題: | |
タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|