Comparisons of genetic algorithms for timetabling problems

Systems and Computers in Japan

Volumn 35, Issue 7, 2004, Pages 1-12

  Ueda, Hiroaki ^a   Ouchi, Daisuke ^b   Takahashi, Kenichi ^a   Miyahara, Tetsuhiro ^a  

^a HIROSHIMA CITY UNIVERSITY   (Japan)

^b Compaq Computer Inc ^*  (Japan)

Author keywords

Automatic timetabling problem generator; Genetic algorithm; Timetabling problem

Indexed keywords

COMPUTER PROGRAMMING; GENETIC ALGORITHMS; INFORMATION ANALYSIS; PROBLEM SOLVING; SIMULATED ANNEALING; STUDENTS;

AUTOMATIC TIMETABLING PROBLEM GENERATOR; CLASS SCHEDULING; GENOTYPES; TIMETABLING PROBLEM;

SCHEDULING;

EID: 2542487576     PISSN: 08821666     EISSN: None     Source Type: Journal    
DOI: 10.1002/scj.10682     Document Type: Article

References (12)

1. Mitchell M. An introduction to genetic algorithms. MIT Press; 1998.
2. Carter MW, Laporte G. Recent developments in practical course timetabling. In: Burke E, Carter M (editors). The practice and theory of automated timetabling: selected papers. Lecture Notes in Computer Science, Vol. 1408, p 3-19, Springer-Verlag, 1998.
3. Fukushima M, Tanaka S Adaptive genetic algorithms for solving school timetabling problems. Trans IEICE 1998;J82-D-I:883-885. (in Japanese)
4. Rich DC. A smart genetic algorithm for university timetabling. In: Burke E, Ross R (editors). The practice and theory of automated timetabling: selected papers. Lecture Notes in Computer Science, Vol. 1153, p 181- 197, Springer-Verlag, 1996.
5. Erben W, Keppler J. A genetic algorithm solving a weekly course-timetabling problem. In: Burke E, Ross P (editors). The practice and theory of automated timetabling: selected papers. Lecture Notes in Computer Science, Vol. 1153, p 198-211, Springer-Verlag, 1996.
6. Burke E, Newall J-P. Multi-stage evolutionary algorithm for timetable problem. IEEE Trans Evolutionary Computation, p 1085-1092, 1999.
7. Peachter B, Rankin RC, Cumming A. Improving a lecture timetabling system for university-wide use. In: Burke E, Carter M (editors). The practice and theory of automated timetabling: selected papers. Lecture Notes in Computer Science, Vol. 1408, p 156-165, Springer-Verlag, 1998.
8. Ouchi D, Ueda H, Miyahara T, Takahashi K. Genetic algorithms for the school timetabling problem. Tech Rep IEICE 1999;AI-99-53:5-12. (in Japanese)
9. Ueda H, Ouchi D, Takahashi K, Miyahara T. Coevolving timeslot/room assignment genetic algorithm technique for university timetabling. In: Burke E, Erben W (editors). The practice and theory of automated timetabling: selected papers. Lecture Notes in Computer Science, Vol. 2079, p 48-63, Springer-Verlag, 2001.
10. Ueda H, Ouchi D, Takahashi K, Miyahara T. Comparisons of genetic algorithms for university timetabling problems. Proc 11th FAN Symposium, p 473-476, 2001. (in Japanese)
11. Elmohamed MAS, Coddington P, Fox G. A comparison of annealing techniques for academic course scheduling. In: Burke E, Carter M (editors). The practice and theory of automated timetabling: selected papers. Lecture Notes in Computer Science, Vol. 1408, p 92-112, Springer-Verlag, 1998.
12. Dowsland KA. Off-the-peg or made-to-measure? Timetabling and scheduling with SA and TS. In: Burke E, Carter M (editors). The practice and theory of automated timetabling: selected papers. Lecture Notes in Computer Science, Vol. 1408, p 37-52, Springer-Verlag, 1998.