1 / 14

Timetabling with Genetic Algorithms

The university class timetabling problem is a highly complex NP-Hard challenge faced by institutions, such as the School of Computing. With hundreds of interactions between students and lecturers each week, creating an effective timetable requires navigating a complex set of constraints, including a limited number of rooms (approximately 50 across various sites) and a fixed schedule of 40 hours per week. Genetic algorithms offer a robust solution by simulating natural selection to optimize scheduling, ensuring efficient use of resources while accommodating diverse class requirements.

anemone
Download Presentation

Timetabling with Genetic Algorithms

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

    More Related