سامانه پشتیبانی خدمات اطلاعات

  اخبار و اعلانات

 آمار

تعداد نشریات163
تعداد شماره‌ها6,767
تعداد مقالات72,886
تعداد مشاهده مقاله132,080,255
تعداد دریافت فایل اصل مقاله103,628,403
Salimifard, Khodakaram, Jamali, Gholamreza, Babaeezadeh, Salman. (1392). University Course Timetabling Using Graph-based Hyper Heuristics. , 5(2), 49-70. doi: 10.22059/imj.2013.50268
Khodakaram Salimifard; Gholamreza Jamali; Salman Babaeezadeh. "University Course Timetabling Using Graph-based Hyper Heuristics". , 5, 2, 1392, 49-70. doi: 10.22059/imj.2013.50268
Salimifard, Khodakaram, Jamali, Gholamreza, Babaeezadeh, Salman. (1392). 'University Course Timetabling Using Graph-based Hyper Heuristics', , 5(2), pp. 49-70. doi: 10.22059/imj.2013.50268
Salimifard, Khodakaram, Jamali, Gholamreza, Babaeezadeh, Salman. University Course Timetabling Using Graph-based Hyper Heuristics. , 1392; 5(2): 49-70. doi: 10.22059/imj.2013.50268

University Course Timetabling Using Graph-based Hyper Heuristics

Industrial Management Journal
مقاله 3، دوره 5، شماره 2، دی 2014، صفحه 49-70    اصل مقاله (366.76 K)
نوع مقاله: Research Paper
شناسه دیجیتال (DOI): 10.22059/imj.2013.50268
نویسندگان
Khodakaram Salimifard* 1؛ Gholamreza Jamali1؛ Salman Babaeezadeh2
1Assistant Prof. of Management Science, Dep. of Industrial Management, Persian Gulf University of Boushehr, Iran
2M.Sc. in Industrial Management, Dep. of Industrial Management, Persian Gulf University of Boushehr, Iran
چکیده
University course timetabling is a complex optimization
problem. There are many components like departments, faculties, rooms,
and students making the problem huge and difficult to solve. Each
component enforces a set of normally conflicting constraints on the
solution space. The problem will be solved if courses are scheduled in
different rooms and within some specific time slots such that a set of
constraints are satisfied. In this paper, a graph-based hyper-heuristic is
proposed to find a solution to the problem. This is a two tiers modeling
approach combining hyper heuristic with graph coloring technique. The
upper tier heuristic is used to select a suitable heuristic to find a feasible
solution on the lower tier. To find the suitability of the proposed
approach, it has been applied to a real world case. The proposed approach
was able to satisfy all the hard and soft constraints. Based on the research
findings, it can be concluded that a graph-based hyper heuristic approach
is a suitable and computationally efficient method to find a solution to
university course timetabling problem.
کلیدواژه‌ها
Graph Coloring؛ Hyper heuristics؛ Local Search؛ University course timetabling
آمار
تعداد مشاهده مقاله: 3,144
تعداد دریافت فایل اصل مقاله: 1,687





سامانه مدیریت نشریات علمی. قدرت گرفته از سیناوب