Effective Solution of University Course Timetabling using Particle Swarm Optimizer based Hyper Heuristic approach
The university course timetable problem (UCTP) is typically a combinatorial optimization problem. Manually achieving a useful timetable requires many days of effort, and the results are still unsatisfactory. unsatisfactory. Various states of art methods (heuristic, meta-heuristic) are used to satisf...
Uloženo v:
| Hlavní autoři: | , , , |
|---|---|
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
University of Baghdad, College of Science for Women
2021-12-01
|
| Edice: | مجلة بغداد للعلوم |
| Témata: | |
| On-line přístup: | https://bsj.uobaghdad.edu.iq/index.php/BSJ/article/view/6674 |
| Tagy: |
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
