Resolving Timetable Scheduling Problem Based on Bio-inspired Genetic Algorithm
Journal Title: Journal of Advances in Mathematics and Computer Science - Year 2017, Vol 21, Issue 3
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.
Authors and Affiliations
Ebinum Wallace Ossai, B. Souley
Keywords
Related Articles
- EP ID EP322061
- DOI 10.9734/BJMCS/2017/30024
- Views 90
- Downloads 0
The Domination Number of Pm X Pn
A mixed graph GM(V, E, A) is a graph containing unoriented edges (set E) as well as oriented edges (set A), referred to as arcs. In this paper we calculate the domination number of the Cartesian product of a path Pm with...
Full Observability Criteria for Linear Impulsive Control Systems with Application to Diabetes Type I Dynamics
The main goal of this paper is to derive a full characterization of the observability of linear time-invariant impulsive systems. Two cases are studied. The rst case considers continuous outputs. A suitable adapted Kalm...
Viscosity Approximation Methods in Reexive Banach Spaces
In this paper, we study viscosity approximation methods in reexive Banach spaces. Let X be a re exive Banach space which admits a weakly sequentially continuous duality mapping j : X ! X, C a nonempty closed convex subs...
On a Discrete Time Semi-Markov Risk Model with Dividends and Stochastic Premiums
A discrete semi-Markov risk model with dividends and stochastic premiums is investigated. We derive recursive equations for the expected penalty function by using the technique of probability generating function. Finally...
Conflict Resolution for Sacramento-San-Joaquin Delta with Stability and Sensitivity Analyses Using the Graph Model
The goal of this paper is to resolve the strategic long-term dispute for the Sacramento-San Joaquin Delta California using the Graph Model approach for conflict resolution. To facilitate the analysis, a Decision Support...