Current Proceedings on Technology

Current Proceedings on Technology

Solving university course Timetabling problem using genetic algorithm

Yazarlar: Mehdi Yadollahi, Touraj Mohammadpour, Mehrdad Nouri Koupaei, Ayoub Ramezani

Cilt 1 , Sayı - , 2012 , Sayfalar -

Konular:-

Anahtar Kelimeler:University course timetabling,Genetic algorithm,NP-hard

Özet: The timetabling is a problem with a great searching space that considerable methods were used for solving it. Timetabling problem is divided to two categories: exam timetabling and university course timetabling. University courses' timetabling is the most important issue in this area. This is a NP-hard problem that because of the large area of searching space, inventive methods are used for its solution. This paper presents a new method by using genetic algorithm that reaches more quickly to the answer by reducing the problem dimensions.  

ATIFLAR
Atıf Yapan Eserler
Henüz Atıf Yapılmamıştır
KAYNAK GÖSTER
BibTex
KOPYALA
@article{2012, title={Solving university course Timetabling problem using genetic algorithm}, volume={1}, number={0}, publisher={Current Proceedings on Technology }, author={Mehdi Yadollahi, Touraj Mohammadpour, Mehrdad Nouri Koupaei, Ayoub Ramezani}, year={2012} }
APA
KOPYALA
Mehdi Yadollahi, Touraj Mohammadpour, Mehrdad Nouri Koupaei, Ayoub Ramezani. (2012). Solving university course Timetabling problem using genetic algorithm (Vol. 1). Vol. 1. Current Proceedings on Technology .
MLA
KOPYALA
Mehdi Yadollahi, Touraj Mohammadpour, Mehrdad Nouri Koupaei, Ayoub Ramezani. Solving University Course Timetabling Problem Using Genetic Algorithm. no. 0, Current Proceedings on Technology , 2012.
Atıf Görüntüle
PDF Görüntüle
Kaynak Görüntüle
Paylaş
Dergi Bilgileri