Parallel genetic algorithm for graph coloring problem / Zbigniew Kokosiński, Marcin Kołodziej, Krzysztof Kwarciany // W: Computational Science – ICCS 2004 : 4th International Conference, Kraków, Poland, ... więcej

Parallel genetic algorithm for graph coloring problem / Zbigniew Kokosiński, Marcin Kołodziej, Krzysztof Kwarciany // W: Computational Science – ICCS 2004 : 4th International Conference, Kraków, Poland, June 6-9, 2004 : proceedings. Pt. 1 [Dokument elektroniczny] / eds. Marian Bubak, [et al.]. – Berlin ; Heidelberg : Springer, 2004. – (Lecture Notes in Computer Science, ISSN 1611-3349 ; 3036). – S. 215-222 : tab. – Tryb dostępu: https://link.springer.com/chapter/10.1007/978-3-540-24685-5_27. – Bibliogr. 13 poz., Abstr. – doi: 10.1007/978-3-540-24685-5_27. – e-ISBN 978-3-540-24685-5. – ISBN 978-3-540-22114-2 (print)

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 ... więcej

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 recently proposed 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.