In this paper, we proposed an improved cuckoo search optimization (ICS) algorithm for solving planar graph coloring problem. The improved cuckoo search optimization algorithm is consisting of the walking one strategy, swap and inversion strategy and greedy strategy. The proposed improved cuckoo search optimization algorithm can solve the planar graph coloring problem using four-colors more efficiently and accurately. The experimental results show that we proposed improved cuckoo search optimization algorithm can get smaller average iterations and higher correction coloring rate.
Zhou, Yongquan; Zheng, Hongqing; Luo, Qifang; and Wu, Jinzhao
"An improved Cuckoo Search Algorithm for Solving Planar Graph Coloring Problem,"
Applied Mathematics & Information Sciences: Vol. 07:
2, Article 48.
Available at: https://digitalcommons.aaru.edu.jo/amis/vol07/iss2/48