Clique-based crossover for solving the timetabling problem with GAs

Proceedings of the 1999 Congress on Evolutionary Computation, CEC 1999

Volumn 2, Issue , 1999, Pages 1200-1206

  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; GENETIC ALGORITHMS; GRAPH THEORY; SCHEDULING;

CONNECTED SUBGRAPH; CROSSOVER OPERATOR; GRAPH COLOURING; NP COMPLETE; SUBGRAPHS; TEST FILES; TIMETABLING PROBLEM;

PROBLEM SOLVING;

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

References (8)

1. L. J. Eshelman. The CHC adaptive search algorithm: How to have safe search when angaging in nontraditional genetic algorithm. In G. Rawlins, editor, Foundations of Genetic Algorithms, pages 265-283, 1991.
2. E. Falkenauer. A new representation and operators for genetic algorithms applied to grouping problems. Evolutionary Computation, 2(2):123-144, 1994.
3. David E. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Addison Wesley, 1989.
4. David E. Goldberg. Real-coded genetic algorithms, virtual alphabets and blocking. In Parallel Problem Solving from Nature, pages 122-129, 1991.
5. John Holland. Adaptation in Natural and Artificial Systems. The University of Michigan Press, Ann Arbor, 1975.
6. P. Ross, D. Corne, and E. Hart. Some observations about GA-based exam timetabling. In Proceedings of the Second Conference on the Practice and Theory of Automated Timetabling, Toronto, Canada, 1997.
7. P. Ross. PGA version 2.9. Testbed for GAs, August 1996.
8. W. M. Spears. Crossover or mutation? In Darrel Whitley, editor, Foundations of Genetic Algorithms, pages 221-238, 1993.