Solving Timetabling Problems by Hybridizing Genetic Algorithms and Tabu Search
نویسندگان
چکیده
As demand for Education increases and diversifies, so does the difficulty of designing workable timetables for schools and academic institutions. Besides the intractability of the basic problem, there is an increasing variety of constraints that come into play. In this paper we present a hybrid of two metaheuristics (genetic algorithm and tabu search) to tackle the problem in its most general setting. Promising experimental results are shown.
منابع مشابه
A genetic algorithm selection perturbative hyper-heuristic for solving the school timetabling problem
Research in the domain of school timetabling has essentially focused on applying various techniques such as integer programming, constraint satisfaction, simulated annealing, tabu search and genetic algorithms to calculate a solution to the problem. Optimization techniques like simulated annealing, tabu search and genetic algorithms generally explore a solution space. Hyper-heuristics, on the o...
متن کاملHybridizing Meta-heuristics Approaches for Solving University Course Timetabling Problems
In this paper we have presented a combination of two metaheuristics, namely great deluge and tabu search, for solving the university course timetabling problem. This problem occurs during the assignment of a set of courses to specific timeslots and rooms within a working week and subject to a variety of hard and soft constraints. Essentially a set of hard constraints must be satisfied in order ...
متن کاملSynthesis-Algo: An Inclusive Timetable Generating Algorithm
Timetabling manually is a complex activity that is time-consuming and stressful because a high number of high and soft constraints need to be satisfied; there is therefore the need to automate the timetabling process. Timetabling automating involves combinatorial optimization, time-based planning, realizing highly constrained problems and addressing multi-dimensional complexities. Researchers h...
متن کاملUniversal Method for Timetable Construction based on Evolutionary Approach
Timetabling problems are often hard and timeconsuming to solve. Most of the methods of solving them concern only one problem instance or class. This paper describes a universal method for solving large, highly constrained timetabling problems from different domains. The solution is based on evolutionary algorithm’s framework and operates on two levels – first-level evolutionary algorithm tries ...
متن کاملA heuristic approach for multi-stage sequence-dependent group scheduling problems
We present several heuristic algorithms based on tabu search for solving the multi-stage sequence-dependent group scheduling (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) search-based solution algorithms are developed to efficiently solve industry-size problem instances. Also, two different initi...
متن کامل