A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
In this paper we propose a memetic algorithm (MA) for the partition graph coloring problem. Given a clustered graph G = (V, E), the goal is to find a subset V * ⊂ V that contains exactly one node for each cluster and a coloring for V * so that in the graph induced by V * , two adjacent nodes have different colors and the total number of used colors is minimal. In our MA we use two distinct solution representations, one for the genetic operators and one for the local search procedure, which aredoi:10.1007/978-3-642-53856-8_28 fatcat:ysfccdljdzekbjjpkfjvjl7kqa