Implementation of graphic vertex-coloring parallel synthesis algorithm based on genetic algorithm and compute unified device architecture

Resumo

Graphic vertex-coloring has long been a classical problem for combinatorial optimization in the field of science and technology. No algorithm can give an optimal solution for graphic vertex-coloring in polynomial time so far, though it plays an important role in the field of mathematical science and technology. Hence the problem has always been a non-deterministic polynomial (NP) complete problem. The current computer parallel technology based on compute unified device architecture (CUDA) is a hot spot in the relevant field. This study put forward a method integrating parallel genetic algorithm and CUDA to solve the problem of graphic vertex-coloring. First, color sequences were coded and parallel genetic operators were designed, which was beneficial to the improvement of algorithm efficacy. Then parallelization reformation was performed on the above integrated algorithm using CUDA. Experimental results demonstrated that, the newly developed algorithm improved the calculation efficiency and reduced the computation time compared to traditional algorithms based on central processing unit (CPU). Thus plenty of cases can be effectively solved if the minimum coloring number of a known graphics is found.