NEARLY OPTIMUM TIMETABLE CONSTRUCTION THROUGH CLP AND INTELLIGENT SEARCH
| Autor: | Panagiotis Stamatopoulos, Serafeim Karaboyas, Efstratios Viglas |
|---|---|
| Rok vydání: | 1998 |
| Předmět: |
Operations research
Computer science business.industry media_common.quotation_subject Space (commercial competition) Scheduling (computing) Academic department Artificial Intelligence Order (business) Constraint logic programming Quality (business) Pruning (decision trees) Artificial intelligence business Heuristics media_common |
| Zdroj: | International Journal on Artificial Intelligence Tools. :415-442 |
| ISSN: | 1793-6349 0218-2130 |
| DOI: | 10.1142/s0218213098000196 |
| Popis: | The course timetable construction is a procedure that every academic department has to carry out at least twice annually, more times if some of the requirements change. These requirements indicate that a collection of elements must be taken in mind in order for an acceptable solution to be found. They come either from the inherent constraints of the problem or from the involved parties, namely teachers and students. A requirement that is very difficult to statisfy is the one of optimality, which means that the constructed timetable should be the best among the legal ones, according to some quantified quality criteria. In this paper, a method for tackling the course timetable construction problem for academic departments is presented, which is based on Constraint Logic Programming (CLP) for the early pruning of the search space and on the usage of intelligent heuristics in order to guide the search to the generation of nearly optimum solutions. A specific system is presented, named ACTS (Automated Course Timetabling System), which has been implemented in the ECL i PS e language. This system is currently in use by the Department of Informatics of the University of Athens for the purpose of aiding the semester course timetable construction. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|