سال انتشار: ۱۳۹۱

محل انتشار: چهارمین کنفرانس مهندسی برق و الکترونیک ایران

تعداد صفحات: ۸

نویسنده(ها):

Hamed Babaei – Department of Computer EngineeringIslamic Azad University, Shabestar Branch, Shabestar, iran
Shahin Akbarpour – Department of Computer EngineeringIslamic Azad University, Shabestar Branch, Shabestar, iran
Ali Farzan – Department of Computer EngineeringIslamic Azad University, Shabestar Branch, Shabestar, iran

چکیده:

The University Course Timetabling Problem is to assign all events to time slots and rooms, by considering the list of hard constraints and soft constraints offered in a semester, so that no conflict is made in these assignments. In this problem, the hard constraints must not be disaffirmed under any condition, but soft constraints must not be disaffirmed as much as possible. The goal of this article is to categorize the approaches of University Course Timetabling Problem in three classes: approaches based on operational research methods, approaches based on Meta-heuristics and approaches based on modern intelligent methods.