A Grouping Genetic Algorithm for graph colouring and exam timetabling

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

Volumn 2079 LNCS, Issue , 2001, Pages 132-156

  Erben, Wilhelm ^a  

^a UNIVERSITY OF APPLIED SCIENCES   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

GENETIC ALGORITHMS; GRAPH THEORY; SCHEDULING;

CONVENTIONAL METHODS; EXAM TIMETABLING; FITNESS FUNCTIONS; GRAPH COLOURING; GROUPING GENETIC ALGORITHMS; REAL-WORLD; TIMETABLING PROBLEM; TRANSITION REGIONS;

SCHEDULING; ALGORITHMS;

EID: 84889575650     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44629-x_9     Document Type: Conference Paper

References (22)

1. Brelaz, D.: New Methods to Color the Vertices of a Graph. Commun. of the ACM 22 (1979) 251-256
2. Burke, E., Newall, J., Weare, R.: A Memetic Algorithm for University Exam Timetabling. In: Burke, E., Ross, P. (eds.): Practice and Theory of Automated Timetabling, 1st International Conference (Edinburgh, August/September 1995), Selected Papers. Lecture Notes in Computer Science, Vol. 1153. Springer-Verlag, Berlin Heidelberg New York (1996) 241-250
3. Burke, E., Newall, J.: A Multi-stage Evolutionary Algorithm for the Timetable Problem. IEEE Trans. Evol. Comput. 3 (1999) 63-74
4. Carter, M., Laporte, G., Lee, S.Y.: Examination Timetabling: Algorithmic Strategies and Applications. J. Oper. Res. Soc. 47 (1996) 373-383
5. Carter, M.: ftp://ie.utoronto.ca/pub/carter/testprob
6. Cheeseman, P., Kanefsky, B., Taylor, W.: Where the Really Hard Problems Are. In: Mylopoulos, J., Reiter, R. (eds.): Proc. 12th IJCAI-91, Vol. 1. Kaufmann, San Francisco, CA (1991) 331-337
7. Clearwater, S., Hogg, T.: Problem Structure Heuristics and Scaling Behavior for Genetic Algorithms. Artif. Intell. 81 (1996) 327-347
8. Culberson, J., Luo, F.: Exploring the κ-colorable Landscape with Iterated Greedy. In: Trick, M., Johnson, D. (eds.): Cliques, Colors, and Satisfiability: 2nd DIMACS Implementation Challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 26. American Mathematical Society (1996) 245-284
9. Culberson, J.: Graph Coloring: http://www.cs.ualberta.ca/~joe/Coloring/ index.html (1995)
10. Dorne, R., Hao, J.: A New Genetic Local Search Algorithm for Graph Coloring. In: Eiben, A., Bäck, T., Schoenauer, M., Schwefel, H-P. (eds.): Parallel Problem Solving from Nature - PPSN V, Proc. 5th Int. Conf. (Amsterdam, September 1998). Lecture Notes in Computer Science, Vol. 1498. Springer-Verlag, Berlin Heidelberg New York (1998) 745-754
11. Eiben, A., Van der Hauw, J., Van Hemert, J.: Graph Coloring with Adaptive Evolutionary Algorithms. J. Heuristics 4 (1998) 25-46
12. Falkenauer, E.: Genetic Algorithms and Grouping Problems. Wiley, Chichester (1998)
13. Fleurent, Ch.; Ferland, J.: Genetic and Hybrid Algorithms for Graph Coloring. Ann. Oper. Res. 63 (1995) 437-463
14. Hertz, A., De Werra, D.: Using Tabu Search Techniques for Graph Coloring. Computing 39 (1987) 345-351
15. Johnson, D., Aragon, C., McGeoch, L., Schevon, C.: Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning. Oper. Res. 39 (1991) 378-406
16. Paechter, B., Cumming, A., Norman, M., Luchian, H.: Extensions to a Memetic Timetabling System. In: Burke, E., Ross, P. (eds.): Practice and Theory of Automated Timetabling, 1st International Conference (Edinburgh, August/September 1995), Selected Papers. Lecture Notes in Computer Science, Vol. 1153. Springer-Verlag, Berlin Heidelberg New York (1996) 251-265
17. Ross, P., Corne, D., Terashima-Marín, H.: The Phase-Transition Niche for Evolutionary Algorithms in Timetabling. In: Burke, E., Ross, P. (eds.): Practice and Theory of Automated Timetabling, 1st International Conference (Edinburgh, August/September 1995), Selected Papers. Lecture Notes in Computer Science, Vol. 1153. Springer-Verlag, Berlin Heidelberg New York (1996) 309-324
18. Ross, P., Hart, E., Corne, D.: Some Observations about GA-Based Exam Timetabling. In: Burke, E., Carter, M. (eds.): Practice and Theory of Automated Timetabling II, 2nd International Conference (PATAT'97, Toronto, August 1997), Selected Papers. Lecture Notes in Computer Science, Vol. 1408. Springer-Verlag, Berlin Heidelberg New York (1998) 115-129
19. Ross, P., Hart, E.: An Adaptive Mutation Scheme for a Penalty-Based Graph-Colouring GA. In: Eiben, A., Bäck, T., Schoenauer, M., Schwefel, H-P. (eds.): Parallel Problem Solving from Nature - PPSN V, Proc. 5th International Conference (Amsterdam, September 1998). Lecture Notes in Computer Science, Vol. 1498. Springer-Verlag, Berlin Heidelberg New York (1998) 795-802
20. Terashima-Marín, H.: A Comparison of GA-Based Methods and Graph-Colouring Methods for Solving the Timetabling Problem. Master's Thesis, Department of AI, University of Edinburgh (1994)
21. Terashima-Marín, H., Ross, P., Valenzuela-Rendón, M.: Evolution of Constraint Satisfaction Strategies in Examination Timetabling. Proc. Genetic and Evolutionary Conference 1999, Orlando, FL., July 13-17 (1999) 635-642
22. Turner, J.: Almost All κ-colorable Graphs are Easy to Color. J. Algorithms 9 (1988) 63-82