返回
Constraint programming approach for school timetabling
DOI:10.1016/S0305-0548(02)00083-7.png)
摘要
En 中文
In this paper, the timetabling problem for a typical high school environment was modeled and solved using a constraint programming (CP) approach. In addition,. operations research (OR) models and local search techniques were also used in order to assist the CP search process by effectively reducing the solution search space. Relaxed models that can be solved using minimum cost matching algorithms were used in order to calculate problem lower bounds at various instances of the solution process. These bounds were in turn used to prioritize the search options of the CP process. The use of minimum cost matching model in the search process is an economical and efficient mechanism for the creation of effective search strategies and it is a competitive manner of introducing problem domain information in the CP environment. By including in the solution process a sequence of local search steps, the solution quality was further improved. Several large problems were solved and actual computational results for specific problem instances are presented.
Keyword:
constraint programming
timetabling
combinatorial optimization
minimum cost matching
local search
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
2.3W
机构
暂无机构信息

