Recent research directions in automated timetabling

被引:239
作者
Burke, EK [1 ]
Petrovic, S [1 ]
机构
[1] Univ Nottingham, Automated Scheduling Optimisat & Planning Res Grp, Sch Comp Sci & Informat Technol, Nottingham NG8 1BB, England
关键词
combinatorial optimisation; timetabling/scheduling; meta-heuristic approaches; multiple criteria analysis; case-based reasoning; hyper-heuristics;
D O I
10.1016/S0377-2217(02)00069-3
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
The aim of this paper is to give a brief introduction to some recent approaches to timetabling problems that have been developed or are under development in the Automated Scheduling, Optimisation and Planning Research Group (ASAP) at the University of Nottingham. We have concentrated upon university timetabling but we believe that some of the methodologies that are described can be used for different timetabling problems such as employee timetabling, timetabling of sports fixtures. etc. The paper suggests a number of approaches and comprises three parts. Firstly. recent heuristic and evolutionary timetabling algorithms are discussed. In particular. two evolutionary algorithm developments are described: a method for decomposing large real-world timetabling problems and a method for heuristic initialisation of the population. Secondly, an approach that considers timetabling problems as multicriteria decision problems is presented. Thirdly, we discuss a case-based reasoning approach that employs previous experience to solve new timetabling problems. Finally. we outline some new research ideas and directions in the field of timetabling. The overall aim of these research directions is to explore approaches that can operate at a higher level of generality than is currently possible. (C) 2002 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:266 / 280
页数:15
相关论文
empty
未找到相关数据