Application of the hardness theory when solving the timetabling problem with genetic algorithms

Proceedings of the 1999 Congress on Evolutionary Computation, CEC 1999

Volumn 1, Issue , 1999, Pages 604-611

  Terashima Marin, Hugo ^a   Ross, Peter ^b   Valenzuela Rendon, Manuel ^a  

^a SCHOOL OF ENGINEERING AND SCIENCES   (Mexico)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; GENETIC ALGORITHMS; HARDNESS; SCHEDULING;

CONSTRAINT TYPES; EDGE CONSTRAINTS; FITNESS FUNCTIONS; PENALTY FUNCTION; TIME SLOTS; TIMETABLING PROBLEM;

PROBLEM SOLVING;

EID: 60449110095     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.1999.781988     Document Type: Conference Paper

References (10)

1. S. H. Clearwater and T. Hogg. Exploiting problem structure in genetic algorithms. In Proceedings of the AAAI Conference, pages 1310-1315, 1994.
2. S. H. Clearwater and T. Hogg. Problem structure heuristics and scaling behavior for genetic algorithms. Artificial Intelligence, 81:327-347, 1996.
3. A. E. Eiben and J. K. van der Hauw. Adaptive penalities for evolutionary graph-coloring. In J.-K. Huo, E. Lutton, E. Ronald, M. Schoenauer, and D. Snyers, editors, Proceedings of Artificial Evolution, LNCS 1363, pages 95-106, 1997.
4. P. Ross, D. Corne, and H. Terashima-Marin. The phase transition niche for evolutionary algorithms in timetabling. In E. Burke and P. Ross, editors, Practice and Theory of Automated Timetabling, LNCS 1153. Springer Verlag, 1996.
5. P. Ross. PGA version 2.9. Testbed for GAs, August 1996.
6. IJ Richardson, MR Palmer, G Liepins, and M Hilliard. Some guidelines for genetic algorithms with penalty functions. In Proceedings of the 3rd International Conference in GAs, pages 191-197. Morgan Kauffman, 1989.
7. A. E. Smith and D. M. Tate. Genetic optimization using a penalty function. International Conference on Genetic Algorithms, pages 499-505, 1983.
8. C. P. Williams and T. Hogg. Using deep structure to locate hard problems. In Proceedings of the 10th AAAI Conference, pages 472-477, 1992.
9. C. P. Williams and T. Hogg. Extending deep structure. In Proceedings of the 11th AAAI Conference, pages 152-157, 1993.
10. C. P. Williams and T. Hogg. Exploiting the deep structure of constraint problems. Artificial Intelligence, 70:73-117, 1994.