A Constraint-Based Approach to High-School Timetabling Problems: A Case Study
Abstract
This paper describes a case study on a general-purpose Constraint Relaxation Problem solver, COASTOOL. Using COASTOOL, a problem can be solved merely by declaring what is the problem, without programming how to solve it. The problem is solved by a novel method that generates a high-quality initial assignment using arc-consistency, and refines it using hill-climbing. This approach has been evaluated successfully by experiments with practical high-school timetabling problems in Japan. Consequently, COASTOOL is shown to be efficient at applications in high-school timetabling problems.
Cite
Text
Yoshikawa et al. "A Constraint-Based Approach to High-School Timetabling Problems: A Case Study." AAAI Conference on Artificial Intelligence, 1994.Markdown
[Yoshikawa et al. "A Constraint-Based Approach to High-School Timetabling Problems: A Case Study." AAAI Conference on Artificial Intelligence, 1994.](https://mlanthology.org/aaai/1994/yoshikawa1994aaai-constraint/)BibTeX
@inproceedings{yoshikawa1994aaai-constraint,
title = {{A Constraint-Based Approach to High-School Timetabling Problems: A Case Study}},
author = {Yoshikawa, Masazumi and Kaneko, Kazuya and Nomura, Yuriko and Watanabe, Masanobu},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {1994},
pages = {1111-1116},
url = {https://mlanthology.org/aaai/1994/yoshikawa1994aaai-constraint/}
}