Skoči na glavni sadržaj

Izvorni znanstveni članak

https://doi.org/10.17559/TV-20130918133247

Algorithms for university course scheduling problems

Mehdi Yazdani orcid id orcid.org/0000-0002-4357-5387 ; Department of Industrial Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran
Bahman Naderi ; Department of Industrial Engineering, Kharazmi University, Tehran, Iran
Esmaeil Zeinali orcid id orcid.org/0000-0002-4357-5387 ; Department of Computer and Information Technology Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran


Puni tekst: hrvatski pdf 477 Kb

str. 241-247

preuzimanja: 5.333

citiraj

Puni tekst: engleski pdf 477 Kb

str. 241-247

preuzimanja: 331

citiraj


Sažetak

This paper deals with the problem of course scheduling where we have a set of courses, lecturers and classrooms. Courses are assigned and scheduled in such a way that the total preference is maximized. We develop the mathematical model of the problem in form of a linear integer program. The small sized problem can be solved to optimality using commercial software. We then develop three different metaheuristics based on artificial immune, genetic and simulated annealing algorithms. These three solution methods are equipped with novel procedures such as move and crossing operators. The parameters of the proposed metaheuristics are first tuned, and then they are evaluated with optimal solutions found by the model. They are, furthermore, evaluated by comparing their performance. The experiments demonstrate that the artificial immune algorithm performs better than the other algorithms.

Ključne riječi

artificial immune algorithm, genetic algorithm, mathematical model, simulated annealing, university course scheduling

Hrčak ID:

186061

URI

https://hrcak.srce.hr/186061

Podaci na drugim jezicima: hrvatski

Posjeta: 6.338 *