Exploring c Environment (S/O: 12826)
This research explores the potential used of fly-evolutionary resolution in an examination timetabling environment. Two novel works are expected from this research. First, we study a complex university examination timetabling problem in a higher education institution which involved real-world compli...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Monograph |
| Language: | English |
| Published: |
UUM
|
| Subjects: | |
| Online Access: | https://repo.uum.edu.my/id/eprint/31751/1/12826.pdf https://repo.uum.edu.my/id/eprint/31751/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | This research explores the potential used of fly-evolutionary resolution in an examination timetabling environment. Two novel works are expected from this research. First, we study a complex university examination timetabling problem in a higher education institution which involved real-world complicated constraints. Survey has shown that the university examination timetabling is a very difficult problem to be catered by the university management team (Burke et al., 1996). The problem has constraints which have not been modelled before; the timeslots and days assignment and splitting exams across several rooms. Subsequently, new objective function that attempts to maximize the spread of examination timeslots throughout the whole examination period is introduced. These constraints provide additional challenges in defining a suitable model and in finding a good timetable. The timetabling problem is to be rectified via hybridization of fly and suitable evolutionary algorithms. The Fruit Fly Optimization Algorithm (FOA) is a method that is still limited in optimization and artificial intelligence area. It is relatively new swarm intelligence method, and it belongs to a kind of interactive evolutionary computation. This approach is for finding global optimization based on the food finding behavior of the fruit fly. Thus, the intelligent approach to this examination timetabling is new within the timetabling research environment. The hybridized algorithm is expected to possess similar characteristics of a robust optimization algorithm as compared to previously complicated optimization algorithms. Hence, this research concentrates on resolving a complex university examination timetabling problem in Malaysia’s higher education institution which involves real complicated constraints. This innovative approach is able to produce a feasible and high quality timetable. Furthermore, the proposed approach can help the management of a higher education institution in making decision regarding the problem of assigning examinations to timeslots efficiently |
|---|