수업 시간표 작성을 위한 제약 프로그래밍 접근법
The course timetabling problem is a problem assigning a set of subjects to the given classrooms and different timeslots, while satisfying various hard constraints and soft constraints. This problem is defined as a constraint satisfaction optimization problem and is known as an NP-complete problem. V...
Saved in:
| Published in | 한국컴퓨터정보학회논문지, 22(9) pp. 9 - 16 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | Korean |
| Published |
한국컴퓨터정보학회
01.09.2017
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 1598-849X 2383-9945 |
| DOI | 10.9708/jksci.2017.22.09.009 |
Cover
| Summary: | The course timetabling problem is a problem assigning a set of subjects to the given classrooms and different timeslots, while satisfying various hard constraints and soft constraints. This problem is defined as a constraint satisfaction optimization problem and is known as an NP-complete problem.
Various methods has been proposed such as integer programming, constraint programming and local search methods to solve a variety of course timetabling problems. In this paper, we propose an iterative improvement search method to solve the problem based on constraint programming. First, an initial solution satisfying all the hard constraints is obtained by constraint programming, and then the solution is repeatedly improved using constraint programming again by adding new constraints to improve the quality of the soft constraints. Through experimental results, we confirmed that the proposed method can find far better solutions in a shorter time than the manual method. KCI Citation Count: 2 |
|---|---|
| ISSN: | 1598-849X 2383-9945 |
| DOI: | 10.9708/jksci.2017.22.09.009 |