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...
Furkejuvvon:
| Váldodahkkit: | , , , |
|---|---|
| Materiálatiipa: | Artigo |
| Giella: | Inglês |
| Almmustuhtton: |
University of Baghdad, College of Science for Women
2021-12-01
|
| Ráidu: | مجلة بغداد للعلوم |
| Fáttát: | |
| Liŋkkat: | https://bsj.uobaghdad.edu.iq/index.php/BSJ/article/view/6674 |
| Fáddágilkorat: |
Eai fáddágilkorat, Lasit vuosttaš fáddágilkora!
|