Abstract
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.
Keywords
Cite this article
@article{cai-1456-2005-2,
author = {Zbigniew Kokosiński and Krzysztof Kwarciany and Marcin Kołodziej},
title = {Efficient Graph Coloring with Parallel Genetic Algorithms},
journal = {Computing and Informatics},
volume = {24},
number = {2},
pages = {123--147},
year = {2005},
issn = {1335-9150},
url = {https://cai.type.sk/content/2005/2/efficient-graph-coloring-with-parallel-genetic-algorithms/}
}
TY - JOUR AU - Zbigniew Kokosiński AU - Krzysztof Kwarciany AU - Marcin Kołodziej TI - Efficient Graph Coloring with Parallel Genetic Algorithms JO - Computing and Informatics VL - 24 IS - 2 SP - 123 EP - 147 PY - 2005 SN - 1335-9150 UR - https://cai.type.sk/content/2005/2/efficient-graph-coloring-with-parallel-genetic-algorithms/ KW - Graph coloring KW - parallel genetic algorithm KW - migration model KW - CEX crossover KW - SPPX crossover ER -
Kokosiński, Z., Kwarciany, K., & Kołodziej, M. (2005). Efficient Graph Coloring with Parallel Genetic Algorithms. Computing and Informatics, 24(2), 123–147. https://cai.type.sk/content/2005/2/efficient-graph-coloring-with-parallel-genetic-algorithms/