Genetic Algorithm for lecturing schedule optimization
Scheduling is a classic problem in lecturing. Rooms, lecturers, times and scheduling constraints must be managed well to get an optimal schedule. University of Boyolali (UBY) also encounter the same scheduling problems. The problem was tried to be solved by building a library based on Genetic Algori...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | EJournal Article |
| Published: |
IndoCEISS in colaboration with Universitas Gadjah Mada, Indonesia.,
2019-01-31.
|
| Subjects: | |
| Online Access: | Get Fulltext Get Fulltext |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| LEADER | 02510 am a22003013u 4500 | ||
|---|---|---|---|
| 001 | IJCSS_43038 | ||
| 042 | |a dc | ||
| 100 | 1 | 0 | |a Kristiadi, David |e author |
| 100 | 1 | 0 | |e contributor |
| 700 | 1 | 0 | |a Hartanto, Rudy |e author |
| 245 | 0 | 0 | |a Genetic Algorithm for lecturing schedule optimization |
| 260 | |b IndoCEISS in colaboration with Universitas Gadjah Mada, Indonesia., |c 2019-01-31. | ||
| 500 | |a https://jurnal.ugm.ac.id/ijccs/article/view/43038 | ||
| 520 | |a Scheduling is a classic problem in lecturing. Rooms, lecturers, times and scheduling constraints must be managed well to get an optimal schedule. University of Boyolali (UBY) also encounter the same scheduling problems. The problem was tried to be solved by building a library based on Genetic Algorithm (GA). GA is a computation method which inspired by natural selection. The computation consists of some operators i.e. Tournament Selection, Uniform Crossover, Weak Parent Replacement and two mutation operators (Interchanging Mutation and Violated Directed Mutation (VDM)). The two mutation method are compared to find which better mutation operator. The library was planned to have a capability to define custom constraints (scheduling requirements that were not accommodated by the library) without core program modifications. The test results show that VDM is more promising for optimal solutions than Interchanging Mutation. In UBY cases, optimal solution (fitness value=1) is reached in 12 minutes 41 second with adding 6 new room and inactivated 2 constraint i.e. lecturing begins at 14.00 except for 3rd semester of science law study program with morning class and lecturing participants must not over classroom capacity. | ||
| 540 | |a Copyright (c) 2019 IJCCS (Indonesian Journal of Computing and Cybernetics Systems) | ||
| 540 | |a http://creativecommons.org/licenses/by-sa/4.0 | ||
| 546 | |a eng | ||
| 690 | |a computer Science | ||
| 690 | |a Genetic algorithm;Violated Directed Mutation;VDM vs Interchanging Mutation | ||
| 655 | 7 | |a info:eu-repo/semantics/article |2 local | |
| 655 | 7 | |a info:eu-repo/semantics/publishedVersion |2 local | |
| 655 | 7 | |2 local | |
| 786 | 0 | |n IJCCS (Indonesian Journal of Computing and Cybernetics Systems); Vol 13, No 1 (2019): January; 83-94 | |
| 786 | 0 | |n 2460-7258 | |
| 786 | 0 | |n 1978-1520 | |
| 787 | 0 | |n https://jurnal.ugm.ac.id/ijccs/article/view/43038/23722 | |
| 856 | 4 | 1 | |u https://jurnal.ugm.ac.id/ijccs/article/view/43038 |z Get Fulltext |
| 856 | 4 | 1 | |u https://jurnal.ugm.ac.id/ijccs/article/view/43038/23722 |z Get Fulltext |