Volume 1, Issue 1 (Spring-Summer-91 2013)                   SCJ 2013, 1(1): 24-31 | Back to browse issues page

XML Persian Abstract Print

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Hasanzadeh M, Bashizade R. Optimizing University Course Timetable Using Local Search Methods. SCJ. 2013; 1 (1) :24-31
URL: http://scj.kashanu.ac.ir/article-1-31-en.html
1- Assistant Prof. Shahed University , hasanzadeh@shahed.ac.ir
Abstract:   (3807 Views)
University course timetabling problem is a complicated problem and finding a computer-aided solution for it was a subject to work for many years. To solve this problem, we must assign courses to timeslots with respect to hard and soft constraints. Hard constraints are those which must be necessarily met (some of them could be neglected with high costs). Our aim is to meet as many soft constraints as possible. In this paper we present local search algorithms to improve a table which meets hard constraints, and is provided by a searching algorithm for CSPs. Our results show that the proposed method is very suitable for real data with a large size and complex constraints.
Full-Text [PDF 282 kb]   (2049 Downloads)    
Type of Study: Research | Subject: Special
Received: 2012/12/4 | Accepted: 2013/08/12 | Published: 2015/09/3

Add your comments about this article : Your username or Email:
Write the security code in the box

Send email to the article author

© 2018 All Rights Reserved | Soft Computing Journal

Designed & Developed by : Yektaweb