A TABU SEARCH ALGORITHM FOR COMPUTING AN OPERATIONAL TIMETABLE

被引：83

作者：

COSTA, D

机构：

[1] Ecole Polytechnique Fédérale de Lausanne, Département de Mathématiques, Chaire de Recherche Opérationnelle

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1994年 / 76卷 / 01期

关键词：

TIMETABLING; COMBINATORIAL OPTIMIZATION; HEURISTIC PROCEDURE; TABU SEARCH;

D O I：

10.1016/0377-2217(94)90009-4

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

The many constraints of different types that must be taken into account and the volume of data make the timetabling problem very hard to solve. Various specific requirements are considered in this paper. After having described precisely the problem to be solved, we present a general technique based on tabu search for finding an acceptable timetable. The resulting computerized algorithm is used for constructing different real course schedules. The results we obtain are very satisfactory.

引用

页码：98 / 110

页数：13

共 19 条

[1] CONSTRUCTING SCHOOL TIMETABLES USING SIMULATED ANNEALING - SEQUENTIAL AND PARALLEL ALGORITHMS [J].