Abstract
The timetabling problem at universities is an NP-hard problem under multiple constraints and limited resources. Thus a technique that can handle constraints is needed to optimize the problem. In this paper we proposed an Exam Timetable generator focusing on Particle Swarm Optimization (PSO) for finding optimal solutions to the problem at Universiti Kuala Lumpur, MIIT faculty and local institution. PSO is a promising scheme for solving NP - hard problems due to its fast convergence and fewer parameter settings. There are two objectives in this. First provide a detailed introduction to the topic of timetabling, Particle Swarm Optimization their method and their variations. The second objective is to apply them to the problem of Exam Timetabling. The proposed algorithm will be tested using the timetabling data from UniKL MIIT City Campus Kuala Lumpur as well as Politeknik Sultan Salahudin Abdul Aziz Shah, Shah Alam.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
