A constructive evolutionary approach to school timetabling

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2037, Issue , 2001, Pages 130-139

  Filho, Geraldo Ribeiro ^a   Nogueira Lorena, Luiz Antonio ^b  

^a UNIVERSIDADE DE MOGI DAS CRUZES   (Brazil)

^b INSTITUTO NACIONAL DE PESQUISAS ESPACIAIS   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT SATISFACTION PROBLEMS; EDUCATION; SCHEDULING;

BI OBJECTIVES; COMPUTATIONAL RESULTS; CONFLICT FREE; CONSTRUCTIVE APPROACH; EVOLUTIONARY APPROACH; SCHOOL TIMETABLING; SCHOOL TIMETABLING PROBLEMS; TIMETABLING PROBLEM;

TEACHING;

EID: 84958038558     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45365-2_14     Document Type: Conference Paper

References (14)

1. de Werra D.: An introduction to timetabling. European Journal of Operations Research. 19 (1985) 151-162.
2. Carter M. W.; Laporte G.: Recent developments in practical course timetabling. In Carter M. W.; Burke E. K. (eds.) Lecture Notes in Computer Science 1408. Springer-Verlag, Berlin (1998) 3-19.
3. Schaerf, A.: A survey of automated timetabling. Artificial Intelligence Review. n.13 (1999) 87-127.
4. Tripathy, A.: School timetabling: A case in large binary integer linear programming. Management Science, 30 (12) (1984) 1473-1489.
5. Neufeld, G. A.; Tartar, J.: Graph coloring conditions for existence of the solution to the timetabling problem. Communications of the ACM. n. 17 v.8 (1974).
6. Coloni A.; Dorigo, M.; Maniezzo, V.: Metaheuristics for high school timetabling. Computational Optimization and Applications. no. 9 (1998) 275-298.
7. Dowsland K. A.: Simulated annealing solutions for multi-objective scheduling and timetabling. In Modern Heuristic Search Methods. Wiley, Chichester, England (1996) 155-166.
8. Hertz A.: Tabu search for large scale timetabling problems. European Journal of Operations Research, 54 (1991) 39-47.
9. Burke E. K.; Elliman D. G.; Weare R. F.: A hybrid genetic algorithm for highly constrained timetabling problems. In Larry J. Eshelman (ed.) Genetic Algorithms: Proceedings of the 6th In-ternation Conference, San Francisco. Morgan Kaufmann. (1995) 605-610.
10. Burke E. K.; Newall J. P.; Weare R. F.: Initialization strategies and diversity in evolutionary timetabling. Evolutionary Computation 6(1) (1998) 81-103.
11. Corne D.; Ross P.; Fang H.: Fast practical evolutionary time-tabling. In Fogarty T.C. (ed.) Lecture Notes in Computer Science 865. Springer-Verlag, Berlin (1994) 250-263.
12. Holland, J.H.: Adaptation in natural and artificial systems. MIT Press (1975) 11-147.
13. Michalewicz Z.: Genetic Algorithms + Data Structures = Evolution Programs. 3rd edn. Springer Verlag, Berlin Heidelberg New York (1996).
14. Lorena, L. A N. and Furtado, J. C.: Constructive Genetic Algorithms for Clustering Problems. Evolutionary Computation - to appear (2000). Available from http://www.lac.inpe.br/~lorena/cga/cga_clus.PDF.