2018
DOI: 10.22531/muglajsci.423185
|View full text |Cite
|
Sign up to set email alerts
|

Solving the Exam Scheduling Problems in Central Exams With Genetic Algorithms

Abstract: It is the efficient use of resources expected from an exam scheduling application. There are various criteria for efficient use of resources and for all tests to be carried out at minimum cost in the shortest possible time. It is aimed that educational institutions with such criteria successfully carry out central examination organizations. In the study, a two-stage genetic algorithm was developed. In the first stage, the assignment of courses to sessions was carried out. In the second stage, the students who … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
19
0
5

Year Published

2018
2018
2023
2023

Publication Types

Select...
6
2

Relationship

1
7

Authors

Journals

citations
Cited by 19 publications
(24 citation statements)
references
References 15 publications
0
19
0
5
Order By: Relevance
“…Their result shows that the required number of conflicts, exam days and available venues had been reduced successfully. In 2019, Dener [14] introduced a two-stage GA, where the first stage carries out the assignment of courses to sessions and the second stage assigns the students who participated in the test session to the examination room. The system was designed to allocate students and supervisors in a more efficient way to reduce the number of rooms and time consumption.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Their result shows that the required number of conflicts, exam days and available venues had been reduced successfully. In 2019, Dener [14] introduced a two-stage GA, where the first stage carries out the assignment of courses to sessions and the second stage assigns the students who participated in the test session to the examination room. The system was designed to allocate students and supervisors in a more efficient way to reduce the number of rooms and time consumption.…”
Section: Related Workmentioning
confidence: 99%
“…For example, there is a problem with 5 sessions, [1,2,3,4], [5,6,7], [8,9,10,11], [12,13,14] and [15,16], and there are two parent chromosomes, Assuming that session [8][9][10][11] and [15,16] are selected. The session [8][9][10][11] from parent chromosome 1 and session [15,16] from parent chromosome 2 will be swapped.…”
Section: Crossovermentioning
confidence: 99%
“…Solutions are obtained from population and utilized to form a new population. This process continues until the best solution is produced or until the number of population is determined [31][32][33][34][35][36][37][38].…”
Section: Genetic Algorithmmentioning
confidence: 99%
“…Bu özellikleri sebebi ile özellikle son yirmi yıldır optimizasyon çalışmalarında yoğun olarak tercih edilmektedirler. Özellikle tavlama benzetimi [5], Genetik Algoritma (GA) [6][7][8], Parçacık Sürü Optimizasyonu (PSO) [9], Karınca Kolonisi Optimizasyonu (ACO) [10] ve Arı Kolonisi Optimizasyonu (ABC) [11] kendisini kanıtlamış popüler evrimsel algoritmalar arasında sayılabilir [12]. Meta sezgisel yaklaşımlar sadece bilgisayar bilimleri alanında değil diğer alanlarda da oldukça bilinen ve kullanılan optimizasyon yaklaşımlarıdır.…”
Section: Gi̇ri̇ş (Introduction)unclassified