An adaptive mutation scheme for a penalty-based graph-colouring GA

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

Volumn 1498 LNCS, Issue , 1998, Pages 795-802

  Ross, Peter ^a   Hart, Emma ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Adaptive mutation; Graph colouring; Penalty functions

Indexed keywords

ENCODING (SYMBOLS);

ADAPTIVE MUTATION; COUNTER EXAMPLES; DIRECT ENCODING; EXAM TIMETABLING; GRAPH COLOURING; PENALTY FUNCTION; PENALTY FUNCTION METHODS; SIMPLE ADAPTIVE;

GRAPH THEORY;

EID: 84878546027     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0056921     Document Type: Conference Paper

References (14)

1. D. Brelaz. New methods to color the vertices of a graph Communications of the ACM, 22: 251-256, 1979.
2. E. Burke and P.M. Ross. The Practice and Theory of Automated Timetabling. LNCS 1153. Springer-Verlag, Heidelberg, October 1996.
3. E.K. Burke and M. Carter. The practice and Theory of Automated Timetabling: Proceedings of the 2nd International Conference. LNCS (to appear). Springer-Verlag, Hedielberg, 1998.
4. Dave Corne and Peter Ross. Some combinatorial landscapes on which a genetic algorithm outperforms other stochastic iterative methods. In T. Fogarty, editor, Evolutionary Computing: AISB Workshop, Sheffield 1995, Selected Papers, LNCS 993. Springer-Verlag, 1995.
5. Dave Corne, Peter Ross, and Hsiao-Lan Fang. Fast practical evolutionary timetabling. In Terry C. Fogarty, editor, Selected Papers: AISB Workshop on Evolutionary Computing, Lecture Notes in Computer Science No 865, pages 250-263. Springer Verlag, 1994.
6. A.E. Eiben, J.K. van der Hauw, and J.I. van Henert. Graph colouring with daptive evolutionary algorithms. Journal of Heuristics, 4(1), 1998.
7. E. Falkenauer. A new representation and operators for genetic algorithms applied to grouping problems. Evolutionary Computation, 2(2): 123-144, 1994.
8. Stephanie Forrest and Melanie Mitchell. Relative building block fitness and the building block hypothesis. In L. Darrell Whitely, editor, Foundations of Genetic Algorithms 2. San Mateo: Morgan Kaufmann, 1993.
9. Patrick Prosser. Binary constraint satisfaction problems: Some are harder than others. In A. Cohn, editor, Proceedings of the 11th European Conferenc e on Artificial Intelligence, pages 95-99. John Wiley & Sons, Ltd., 1994.
10. Peter Ross and Dave Corne. Comparing genetic algorithms, simulated annealing, and stochastic hillclimbing on timetabling problems. In. In T. Fogarty, editor, Evolutionary Computing: AISB Workshop, Sheffield 1995, Selected Papers, LNCS 993. Springer-Verlag, 1995.
11. Peter Ross and Dave Corne. The phase transition niche for evolutionary algorithms in timetabling. [2], pages 309-324.
12. P.M. Ross, E. Hart, and D. Corne. Some observations on g-based exam timetabling. pages -.
13. Barbara Smith. Phase transition and the mushy region in constraint satisfaction problems. In A. Cohn, editor, Proceedings of the 11th European Conference on Artificial Intelligence, pages 100-104. John Wiley & Sons, Ltd., 1994.
14. H. Terashima-Marin. personal communication.