Efficient Graph Coloring with Parallel Genetic Algorithms
Zbigniew Kokosiński ; Krzysztof Kwarciany ; Marcin Kołodziej
Computing and Informatics, Tome 28 (2012) no. 1, / Harvested from Computing and Informatics
Text on Computing and Informatics
In this paper a new parallel genetic algorithm for coloring graph vertices is presented. In the algorithm we apply a migration model of parallelism and define two new recombination operators SPPX and CEX. For comparison two problem-oriented crossover operators UISX and GPX are selected. The performance of the algorithm is verified by computer experiments on a set of standard graph coloring instances.
Publié le : 2012-01-26
Classification:  Graph coloring; parallel genetic algorithm; migration model; CEX crossover; SPPX crossover 
@article{cai371,
     author = {Zbigniew Kokosi\'nski and Krzysztof Kwarciany and Marcin Ko\l odziej},
     title = {Efficient Graph Coloring with Parallel Genetic Algorithms},
     journal = {Computing and Informatics},
     volume = {28},
     number = {1},
     year = {2012},
     language = {en},
     url = {http://dml.mathdoc.fr/item/cai371}
}

Zbigniew Kokosiński; Krzysztof Kwarciany; Marcin Kołodziej. Efficient Graph Coloring with Parallel Genetic Algorithms. Computing and Informatics, Tome 28 (2012) no. 1, . http://gdmltest.u-ga.fr/item/cai371/