Efficient Graph Coloring with Parallel Genetic Algorithms

In: Computing and Informatics, vol. 24, no. 2

Zbigniew Kokosinski - Krysztof Kwarciany - Marcin Kolodziej

Detaily:

Rok, strany: 2005, 123 - 147

Kľúčové slová:

Graph coloring, parallel genetic algorithm, migration model, CEX crossover, SPPX crossover

O článku:

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.

Ako citovať:

ISO 690:

Kokosinski, Z., Kwarciany, K., Kolodziej, M. 2005. Efficient Graph Coloring with Parallel Genetic Algorithms. In Computing and Informatics, vol. 24, no.2, pp. 123-147. 1335-9150.

APA:

Kokosinski, Z., Kwarciany, K., Kolodziej, M. (2005). Efficient Graph Coloring with Parallel Genetic Algorithms. Computing and Informatics, 24(2), 123-147. 1335-9150.