A Rectification Strategy In Genetic Algorithms for Academic Timetabling Problem
نویسندگان
چکیده
منابع مشابه
Timetabling with Genetic Algorithms
Genetic algorithms are generally used to solve NP-complete problems, which include scheduling problem in academic institutions. Scheduling consists of assigning offered courses to available time periods so that the students’ satisfaction factor is maximised while preserving the unbreakable academic rules such as two distinct courses cannot be scheduled during the same period of time because the...
متن کاملGenetic Algorithms in Timetabling. A New Approach
The timetabling problem comes up every year in educational institutions, which has been solved by leveraging human resource for a long time. The problem is a special version of the optimization problems, it is computationally NP-hard. Although, there are some attempts to apply computer based methods, their use is limited by the problem’s complexity, therefore Genetic Algorithms were applied, be...
متن کاملAnt Algorithms for the Exam Timetabling Problem
Scheduling exams at universities can be formulated as a combinatorial optimization problem. Given a planning horizon with a fixed number of periods the objective is to avoid situations, or at least to minimize them, when a student is enrolled in two exams that are scheduled for the same period. Ant colony approaches have been proven to be a powerful solution approach for various combinatorial o...
متن کاملgenetic algorithms for assembly line balancing problem
there are some machineries and equipments as well as relatively fix amount of human resources involved in any production process. in many cases, by observing operational method of a process, one may see that some of these machineries are not working, but on the other hand, other equipments are continuously working, and many parts are set in front of them, waiting to be set up over machines to c...
متن کاملGenetic Algorithms for University Course Timetabling Problems
The university course timetabling problem is a difficult optimisation problem due to its highly-constrained nature. Finding an optimal, or even a high quality, timetable is a challenging task, especially when resources (e.g., rooms and time slots) are limited. In the literature, many approaches have been studied to solve this problem. In this thesis, we investigate genetic algorithms to solve t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Jurnal Teknologi
سال: 2015
ISSN: 2180-3722,0127-9696
DOI: 10.11113/jt.v74.3041