Application of (Genetic _ Tabu Search) Algorithms for Subsequent Lease Schedule

International Conference on Informatics, Engineering, Science and Technology

计算机科学;工业技术

Kinasya, V.^1

Magister Sistem Informasi, Universitas Komputer Indonesia, Indonesia^1

关键词: Class scheduling;    Cross breedings;    Cross over;    Fitness values;    Hard and soft constraints;    Indonesia;    Scheduling problem;    Tabu search algorithms;   

Others  :  https://iopscience.iop.org/article/10.1088/1757-899X/407/1/012124/pdf
DOI  :  10.1088/1757-899X/407/1/012124

来源: IOP

【 摘 要 】

Submission of information relating to college scheduling in college is very important and is usually done on a semester by the academic section. One of these universities is Universitas Kompueter Indonesia (Unikom) which became object of case study. In deterMining the scheduling of many aspects that must be considered include the components of the course, lecturer, class, space, and time. All of these components are considered so that the schedule of lectures that will be formed does not happen clashing with each other. In addition, scheduling problems will be more complex if there are many additional terms or constraints. In this study aims to be able to make lecture class scheduling replacement with a combination of genetic algorithms and tabuo search. The first step is done by separating the hard and soft constraints that exist in the lecture problem, and then the best individual search is done by cross-over or cross-breeding process to produce new individual and perform the process of mutation or exchange of individual position in order to produce the best fitness value of the previous individual. The advantage of using a tabu search algorithm allows for the absence of duplicate individual processes. Therefore, the combination of these two algorithms is capable of producing good scheduling and the clashing rate of a schedule can be handled.