Adaptive penalties for evolutionary graph coloring [chapter]

A. E. Eiben, J. K. van der Hauw
1998 Lecture Notes in Computer Science  
In this paper we consider a problem independent constraint handling mechanism, Stepwise Adaptation of Weights (SAW) and show its working on graph coloring problems. SAW-ing technically belongs to the penalty function based approaches and amounts to modifying the penalty function during the search. We show that it has a twofold bene t. First, it proves to be rather insensitive to its technical parameters, thereby providing a general, problem independent way to handle constrained problems.
more » ... it leads to superior EA performance. In an extensive series of comparative experiments we show that the SAW-ing EA outperforms a powerful graph coloring heuristic algorithm, DSatur, on the hardest graph instances and has a linear scale-up behaviour.
doi:10.1007/bfb0026593 fatcat:wvhrtro4xbdzlkb7mlc5uhk2uq