Resolving Timetable Scheduling Problem Based on Bio-inspired Genetic Algorithm

Ossai, Ebinum and Souley, B (2017) Resolving Timetable Scheduling Problem Based on Bio-inspired Genetic Algorithm. British Journal of Mathematics & Computer Science, 21 (3). pp. 1-19. ISSN 22310851

[thumbnail of Ossai2132016BJMCS30024.pdf] Text
Ossai2132016BJMCS30024.pdf - Published Version

Download (1MB)

Abstract

Timetabling is the task of assigning sets of events to periods of time, taking into account resource-constraints and preferences among assignments. This involves combinatorial optimization, time-based planning, in order to realize a highly constrained problems that addresses a multi-dimensional complexities. This paper investigated the use of activity matrix to reduce the complexity of timetabling and applying genetic algorithm to resolving Colleges of Education Timetabling Problem. In this study, Course, Rooms and Time slots are represented in the form of a multidimensional array. On this is applied certain genetic operators such as crossover operator in a manner that does not violate the hard constraints and then a local is performed to obtain an optimal solution. The fittest solution (optimum timetable) is then displayed as the final timetable. Based on the evaluation carried out on the completed system it was revealed that the completed system worked effectively well.

Item Type: Article
Subjects: Pustaka Library > Computer Science
Depositing User: Unnamed user with email support@pustakalibrary.com
Date Deposited: 10 Jun 2023 06:32
Last Modified: 12 Jan 2024 07:36
URI: http://archive.bionaturalists.in/id/eprint/843

Actions (login required)

View Item
View Item