An order based evolutionary approach to dual objective examination timetabling

Proceedings of the 2007 IEEE Symposium on Computational Intelligence in Scheduling, CI-Sched 2007

Volumn , Issue , 2007, Pages 179-186

  Mumford, Christine L ^a  

^a CARDIFF UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; HEURISTIC METHODS; OPTIMIZATION; PROBLEM SOLVING; TIME MEASUREMENT;

FEASIBLE TIMETABLE; HEURISTIC OPERATOR; MULTI OBJECTIVE EVOLUTIONARY ALGORITHM (MOEA);

EVOLUTIONARY ALGORITHMS;

EID: 34548766500     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SCIS.2007.367687     Document Type: Conference Paper

References (19)

1. H. Asmuni, E. Burke, and J. Garibaldi. Fuzzy multiple ordering criteria for examination timetabling. In E. Burke and M. Trick, editors, PATAT 2004, volume 3616 of Lecture Notes in Computer Science, page 334354. Springer-Verlag Berlin Heidelberg, 2005.
2. E. Burke, Y. Bykov, and S. Petrovic. A multicriteria approach to examination timetabling. In Practice and Theory of Automated Timetabling 111: Third International Conference, PATAT 2000, volume 2079 of Lecture Notes in Computer Science, pages 118-131. Springer, 2001.
3. E. Burke and J. Newell. A multi-stage evolutionary algorithm for the timetabling problem. IEEE Transactions on Evolutionary Computation, 3(1):63-74, 1999.
4. E. Burke and S. Petrovic. Recent research directions in automated timetabling. European Journal of Operational Research, 140(2):266-280, 2002.
5. M. Caramia, P. Dell'Olmo, and G. Italiano. New algorithms for examination timetabling. In Algorithm Engineering 4th International Workshop, volume 1982 of Lecture Notes in Computer Science, pages 230-240. Springer, 2000.
6. M. W. Carter, G. Laporte, and S. Y. Lee. Examination timetabling: algorithms, strategies and applications. European Journal of Operational Research, 47:373-383, 1996.
7. P. Côté, A. Wong, and R. Sabourin. A hybrid multi-objective evolutionary algorithm for the uncapacitated exam proximity problem. In E. Burke and M. Trick, editors, PATAT 2004, volume 3616 of Lecture Notes in Computer Science, pages 294-312. Springer-Verlag Berlin Heidelberg, 2005.
8. J. Culberson and F. Luo. Exploring the k-colorable landscape with it-erated greedy. In D. S. Johnson and M. A. Trick, editors, Cliques, Coloring and Satisfiability: Second DIMACS Implementation Challenge, volume 26 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 499-520. American Mathematical Society, 1996.
9. L. Davis. Order-based genetic algorithms and the graph coloring problem. In Handbook of genetic algorithms, chapter 6, pages 72-90. Van Nostrand Reinhold, New York, 1991.
10. D.Brélaz. New methods to color the vertices of graphs. Communications of the ACM, 24(4):251-256, 1979.
11. W Erben. A grouping genetic algorithm for graph colouring and exam timetabling. In PATAT 2000, volume 2079 of Lecture Notes in Computer Science, pages 132-156. Springer, 2001.
12. E. Falkerauer. A hybrid grouping genetic algorithm for bin packing. Journal of Heuristics, 2:5-30, 1996.
13. P. Galinier and J. K. Hao. Hybrid evolutionary algorithms for graph coloring. Journal of Combinatorial Optimization, 3(4):379-397, 1999.
14. D. Matula, G. Marble, and J. Isaacson. Graph coloring algorithms. In Graph theory and computing, pages 104-122. Academic Press, 1972.
15. C. L. Mumford. Simple population replacement strategies for a steady-state multi-objective evolutionary algorithm. In Proceedings of the 2004 Genetic an Evolutionary Computation Conference (GECCO), pages 1389-1400, Seattle, Washington, USA, 2004.
16. C. L. Mumford. New order-based crossovers for the graph coloring problem. In Proc. of the 9th Int. Conference on Parallel Problem Solving from Nature, PPSN IX, volume 4193 of Lecture Notes in Computer Science, pages 880-889, Reykjavik, 2006. Springer.
17. A. Schaerf. A survey of automated timetabling. Artificial Intelligence Review, 13:87-127, 1999.
18. C. L. Valenzuela. A simple evolutionary algorithm for multi-objective optimization (seamo). In Proceedings of the 2002 IEEE Congress on Evolutionary Computation (CEC2002), pages 717-722, Honolulu, Hawaii, 2002. (C.L. Valenzuela is now known as C.L. Mumford).
19. D. Welsh and M. Powell. An upper bound for the chromatic number of a graph and its application to timetabling problems. The Computer Journal, 10:85-86, 1967.