Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Xu, X., Kang, C., and Guo, T., Imageability and semantic association in the representation and processing of event verbs, Cognit. Process., 2016, vol. 17, no. 2, pp. 1–10.
Mielikainen, J., Price, E., Huang, B., et al., GPU Compute Unified Device Architecture (CUDA)-based parallelization of the RRTMG shortwave rapid radiative transfer model, IEEE J. Sel. Topics Appl. Earth Obs. Remote Sens., 2015, pp. 1–11.
Gonçalves, J.F., Resende, M.G.C., and Costa, M.D., A biased random-key genetic algorithm for the minimization of open stacks problem, Int. Trans. Oper. Res., 2016, vol. 23, nos. 1–2, pp. 25–46.
Wang, P., Zeng, S., Dai, R.H., Meng, H., and Zhang G.L., An automatic scheduling method for weaving enterprises based on genetic algorithm, J. Text. Inst., 2015, vol. 106, no. 12, pp. 1377–1387.
Bolaños, R.I., Eliana, M.T.O., and Mauricio, G.E., A population-based algorithm for the multi travelling salesman problem, Int. J. Ind. Eng. Comput., 2016, vol. 7, no. 2, pp. 245–256.
Calle, F.J., de L., Bulnes, F.G., Garcia, D.F., Usamentiaga, R., and Molleda, J., A parallel genetic algorithm for configuring defect detection methods, IEEE Lat. Am. Trans., 2015, vol. 13, no. 5, pp. 1462–1468.
Podolsak, B. and Ströder, J., Benchmarking the cost of thread divergence in CUDA, Z. Kinderheilkd., 2015, vol. 116, no. 3, pp. 153–175.
Vidal, P., Alba, E., and Luna, F., Solving optimization problems using a hybrid systolic search on GPU plus CPU, Soft Comput., 2016, pp. 1–19.
Chandrashekar, A., Rakshith, B.R., and Wasin, S., On the mixed adjacency matrix of a mixed graph, Linear Algebra Appl., 2016, vol. 495, pp. 223–241.
Drgas-Burchardt, E., Kowalska, K., Michael, J., et al., Some properties of vertex-oblique graphs, Discrete Math., 2016, vol. 339, no. 1, pp. 95–102.
Liang, Y.C. and Juarez, J.R.C., A novel metaheuristic for continuous optimization problems: Virus optimization algorithm, Eng. Optim., 2016, vol. 48, no. 1, pp. 1–21.
Dereventsov, A.V., On the approximate weak Chebyshev greedy algorithm in uniformly smooth Banach spaces, J. Math. Anal. Appl., 2016, vol. 436, no. 1, pp. 288–304.
Cariton, J.T. and Geller, J.B., Ecological roulette: The global transport of nonindigenous marine organisms, Science, 1993, vol. 261, no. 5117, pp. 78–82.
Keiser, C.N., Wright, C.M., Singh, N., et al., Cross-fostering by foreign conspecific queens and slave-making workers influences individual- and colony-level personality, Behav. Ecol. Sociobiol., 2015, vol. 69, no. 3, pp. 395–405.
Jarrah, A.S., Castiglione, F., Evans, N.P., et al., A mathematical model of skeletal muscle disease and immune response in the mdx mouse, Biomed Res. Int., 2014. doi doi 10.1155/2014/871810
Harenza, J.L., Parikh, H.M., Wei, J.S., et al., Abstract 1077: Use of the SV Classify algorithm to classify pediatric solid tumor translocation variant calls as likely true or false positives, Cancer Res., 2015, vol. 75, p. 1077.
Fang, W., Juan, L., Chen, H.H., and Wu, X.J., A decentralized quantum-inspired particle swarm optimization algorithm with cellular structured population, Inf. Sci., 2016, vol. 330, pp. 19–48.
Morteza, J., Morteza, S., Sayed, J.R., and Mohammad, R., A new model for residence time distribution of impinging streams reactors using descending-sized stirred tanks in series, Chem. Eng. Res. Design, 2016, vol. 109, pp. 86–96.
Zhou, Z., Li, C.M., Huang, C., et al., An exact algorithm with learning for the graph coloring problem, Comput. Oper. Res., 2014, vol. 51, no. 3, pp. 282–301.
Fuli, H.E., Min, K.U., and Kähler, U., Szegö kernel for hardy space of matrix functions, Acta Math. Sci., 2016, vol. 36, no. 1, pp. 203–214.
Author information
Authors and Affiliations
Corresponding author
Additional information
The article is published in the original.
About this article
Cite this article
Shen, F., Jian, X. & Xi, X. Implementation of graphic vertex-coloring parallel synthesis algorithm based on genetic algorithm and compute unified device architecture. Aut. Control Comp. Sci. 51, 32–41 (2017). https://doi.org/10.3103/S0146411617010060
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S0146411617010060