Knowledge discovery in hyper-heuristic using case-based reasoning on course timetabling

This paper presents a new hyper-heuristic method using Case-Based Reasoning (CBR) for solving course timetabling problems. The term Hyper-heuristics has recently been employed to refer to 'heuristics that choose heuristics' rather than heuristics that operate directly on given problems. One of the overriding motivations of hyper-heuristic methods is the attempt to develop techniques that can operate with greater generality than is currently possible. The basic idea behind this is that we maintain a case base of information about the most successful heuristics for a range of previous timetabling problems to predict the best heuristic for the new problem in hand using the previous knowledge. Knowledge discovery techniques are used to carry out the training on the CBR system to improve the system performance on the prediction. Initial results presented in this paper are good and we conclude by discussing the con-siderable promise for future work in this area

A Micro-Genetic Algorithm Approach for Soft Constraint Satisfaction Problem in University Course Scheduling

A university course timetabling problem is a combination of optimization problems. The problems are more challenging when a set of events need to be scheduled in the time slot, to be located to the suitable rooms, which is subjected to several sets of hard and soft constraints. All these constraints that exist as regulations within each resource for the event need to be fulfilled in order to achieve the optimum tasks. In addition, the design of course timetables for universities is a very difficult task because it is a non-deterministic polynomial, (NP) hard problem. This problem can be minimized by using a Micro Genetic Algorithm approach. This approach, encodes a chromosome representation as one of the key elements to ensure the infeasible individual chromosome produced is minimized. Thus, this study proposes an encoding chromosome representation using one-dimensional arrays to improve the Micro Genetic algorithm approach to soft constraint problems in the university course schedule. The research contribution of this study is in developing effective and feasible timetabling software using Micro Genetic Algorithm approach in order to minimize the production of an infeasible individual chromosome compared to the existing optimization algorithm for university course timetabling where UNITAR International University have been used as a data sample. The Micro Genetic Algorithm proposed has been tested in a test comparison with the Standard Genetic algorithm and the Guided Search Genetic algorithm as a benchmark. The results showed that the proposed algorithm is able to generate a minimum number of an infeasible individual chromosome. The result from the experiment also demonstrated that the Micro Genetic Algorithm is capable to produce the best course schedule to the UNITAR International University

Parallel Genetic Algorithms for University Scheduling Problem

University scheduling timetabling problem, falls into NP hard problems. Re-searchers have tried with many techniques to find the most suitable and fastest way for solving the problem. With the emergence of multi-core systems, the parallel implementation was considered for finding the solution. Our approaches attempt to combine several techniques in two algorithms: coarse grained algorithm and multi thread tournament algorithm. The results obtained from two algorithms are compared, using an algorithm evaluation function. Considering execution time, the coarse grained algorithm performed twice better than the multi thread algorithm

Course Time Table Scheduling for a Local College

This study dive into the field of course time table scheduling for a local institution. The subject of the study will be a local college in Malaysia, in particular on the SEGi College branch in Penang. This covers the development of the prototype software which will enable the simulation of the course time table for both the students and lecturers. The prototype software will be on a local search approach with reference to Hill Climbing with Random Walk algorithm and Best First Search algorithm. This research enables users to increase efficiency and performance in developing a course time table. Later,this research will be proposed for implementation to the management of SEGi College branch in Penang

Artificial Immune Algorithm for exams timetable

The Artificial Immune System is a novel optimization algorithm designed on the resilient behavior of the immune system of vertebrates. In this paper, this algorithm is used to solve the constrained optimization problem of creating a university exam schedule and assigning students and examiners to each of the sessions. Penalties are imposed on the violation of the constraints. Abolition of the penalties on the hard constraints in the first stage leads to feasible solutions. In the second stage, the algorithm further refines the search in obtaining optimal solutions, where the exam schedule matches the preferences of the examiners

University Course Timetabling with Genetic Algorithm: A Case Study

University Course Timetabling Problems is a scheduling problem to allocate some lectures with some constraint, such as the availability of lecturers, number of classrooms and time slot in each day. The schedule of courses is one of important factors before start the semester in order to manage the study process. Generally, the university course scheduling in some universities are usually created manually through administration office. It needs to synchronize for all schedules from all departments in faculty of the university. In addition, the limitations of classroom and timeslot can make collision of the courses, lecturers and also incompatibility between the room capacity and the number of students whom take the course in the class. This paper proposes the university course time tabling systems. Based on some simulations with 93 courses, 18 lecturers and up to six classrooms, the result is that the system will get the best violation if the system adds more number of iteration. This situation also happens in the result of the scheduling lectures, the system will get the best percentage when the number of iteration sets as maximum

MetroNG: Computer-Aided Scheduling and Collision Detection

In this paper, we propose a formal model of the objects involved in a class of scheduling problems, namely in the classroom scheduling in universities which allow a certain degree of liberty in their curricula. Using the formal model, we present efficient algorithms for the detection of collisions of the involved objects and for the inference of a tree-like navigational structure in an interactive scheduling software allowing a selection of the most descriptive view of the scheduling objects. These algorithms were used in a real-world application called MetroNG; a visual interactive tool that is based on more than 10 years of experience we have in the field. It is currently used by the largest universities and colleges in the Czech Republic. The efficiency and usability of MetroNG suggests that our approach may be applied in many areas where multi-dimensionally structured data are presented in an interactive application

A greedy gradient-simulated annealing selection hyper-heuristic

Educational timetabling problem is a challenging real world problem which has been of interest to many researchers and practitioners. There are many variants of this problem which mainly require scheduling of events and resources under various constraints. In this study, a curriculum based course timetabling problem at Yeditepe University is described and an iterative selection hyper-heuristic is presented as a solution method. A selection hyper-heuristic as a high level methodology operates on the space formed by a fixed set of low level heuristics which operate directly on the space of solutions. The move acceptance and heuristic selection methods are the main components of a selection hyper-heuristic. The proposed hyper-heuristic in this study combines a simulated annealing move acceptance method with a learning heuristic selection method and manages a set of low level constraint oriented heuristics. A key goal in hyper-heuristic research is to build low cost methods which are general and can be reused on unseen problem instances as well as other problem domains desirably with no additional human expert intervention. Hence, the proposed method is additionally applied to a high school timetabling problem, as well as six other problem domains from a hyper-heuristic benchmark to test its level of generality. The empirical results show that our easy-to-implement hyper-heuristic is effective in solving the Yeditepe course timetabling problem. Moreover, being sufficiently general, it delivers a reasonable performance across different problem domains