Using Artificial Fish Swarm Algorithm to Solve University Exam Timetabling Problem

Message:
Article Type:
Research/Original Article (بدون رتبه معتبر)
Abstract:
The timetabling problem consists in scheduling a sequence of courses in times period between teachers and students, satisfying a set of constraints of various types. The problem of University Exam Timetabling problem is one of the complex combined problems that universities worldwide struggle with for several times over the course of the year. The objective in this problem is to assign the student exams to times period and rooms in order to meet a series of constraints. The university exam timetabling problem is of difficult problems due to the very large search space, and innovative algorithms are more used to solve it. Several methods have been suggested to solve this problem so far. For the first time, the aim is to present a new method in the present study for university exams timetabling using an artificial fish-swarm algorithm (AFSA), then compare this method with other algorithms in order to evaluate the efficiency of the proposed method. The simulation results indicated that the proposed method is of high efficiency.
Language:
English
Published:
Journal of Advances in Computer Research, Volume:10 Issue: 2, Spring 2019
Pages:
109 to 117
magiran.com/p2100373  
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 1,390,000ريال می‌توانید 70 عنوان مطلب دانلود کنید!
اشتراک سازمانی
به کتابخانه دانشگاه یا محل کار خود پیشنهاد کنید تا اشتراک سازمانی این پایگاه را برای دسترسی نامحدود همه کاربران به متن مطالب تهیه نمایند!
توجه!
  • حق عضویت دریافتی صرف حمایت از نشریات عضو و نگهداری، تکمیل و توسعه مگیران می‌شود.
  • پرداخت حق اشتراک و دانلود مقالات اجازه بازنشر آن در سایر رسانه‌های چاپی و دیجیتال را به کاربر نمی‌دهد.
In order to view content subscription is required

Personal subscription
Subscribe magiran.com for 70 € euros via PayPal and download 70 articles during a year.
Organization subscription
Please contact us to subscribe your university or library for unlimited access!