An improved Cuckoo Search Algorithm for Solving Planar Graph Coloring Problem

Authors

Yongquan Zhou, Guangxi Key Laboratory of Hybrid Computation and Integrated Circuit Design Analysis, Nanning Guangxi 530006, P. R. China.Follow
Hongqing Zheng
Qifang Luo
Jinzhao Wu

Author Country (or Countries)

P. R. China.

Abstract

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.

Suggested Reviewers

N/A

Recommended Citation

Zhou, Yongquan; Zheng, Hongqing; Luo, Qifang; and Wu, Jinzhao (2013) "An improved Cuckoo Search Algorithm for Solving Planar Graph Coloring Problem," Applied Mathematics & Information Sciences: Vol. 07: Iss. 2, Article 48.
Available at: https://digitalcommons.aaru.edu.jo/amis/vol07/iss2/48