Abstract
The folklore of evolutionary algorithms still seems to contain some gross over-generalistions, such as that direct encodings are inferior to indirect ones, that penalty-function methods are often poor, and that observed performance on a few instances can be extrapolated to a whole class. In the interests of exploring the status of such folklore we have continued to investigate in depth the use of a simple representation for graph-colouring problems. In this paper we demonstrate that good performance on a variety of medium-sized problems can be obtained with a simple adaptive mutation scheme. The scheme was originally motivated by considering an artificial counter-example to an earlier approach that had seemed very successful, because it had been used to solve some large real-world exam timetabling problems for certain universities. Those solutions were used in practice, and it would have been tempting to assert that the method was a practical success. This paper represents part of a continuing effort to map out the strengths and weaknesses of using a simple direct encoding and penalty functions for graph colouring.
Preview
Unable to display preview. Download preview PDF.
References
D. Brelaz. New methods to color the vertices of a graph. Communications of the ACM, 22:251–256, 1979.
E. Burke and P.M. Ross. The Practice and Theory of Automated Timetabling. LNCS 1153. Springer-Verlag, Heidelberg, October 1996.
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.
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.
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.
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.
E. Falkenauer. A new representation and operators for genetic algorithms applied to grouping problems. Evolutionary Computation, 2(2):123–144, 1994.
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.
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.
Peter Ross and Dave Corne. Comparing genetic algorithms, simulated annealing, and stochastic hillclimbing on timetabling problems. In T. Fogarty, editor, Evolutionary Computing: AISB Workshop, Sheffield 1995, Selected Papers, LNCS 993. Springer-Verlag, 1995.
Peter Ross and Dave Corne. The phase transition niche for evolutionary algorithms in timetabling. [2], pages 309–324.
P.M. Ross, E. Hart, and D. Corne. Some observations on g-based exam timetabling. pages-.
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.
H. Terashima-Marin. personal communication.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ross, P., Hart, E. (1998). An adaptive mutation scheme for a penalty-based graph-colouring GA. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, HP. (eds) Parallel Problem Solving from Nature — PPSN V. PPSN 1998. Lecture Notes in Computer Science, vol 1498. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0056921
Download citation
DOI: https://doi.org/10.1007/BFb0056921
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65078-2
Online ISBN: 978-3-540-49672-4
eBook Packages: Springer Book Archive