Abstract
We adapt the Cuckoo Search (CS) algorithm for solving the three color Graph Coloring Problem (3-GCP). The difficulty of this task is adapting CS from a continuous to a discrete domain. Previous researches used sigmoid functions to discretize the Lévi Flight (LF) operator characteristic of CS, but this approach does not take into account the concept of Solution Distance, one of the main characteristics of LF. In this paper, we propose a new discretization of CS that maintains LF’s solution distance concept. We also simplify CS’s parasitism operator, reducing the number of evaluations necessary. We compare different combinations of the proposed changes, using GA as a baseline, on a set of randomly generated 3-GCP problems. The results show the importance of a good discretization of the LF operator to increase the success rate and provide auto-adaptation to the CS algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Yang, X.-S., Deb, S.: Cuckoo search via lévy flights. Nature Biol. Inspired Comput. 37, 210–214 (2009)
Zhou, Y., Zheng, H., Luo, Q., Jinzhao, W.: An improved cuckoo search algorithm for solving planar graph coloring problem. Appl. Math. Inf. Sci. 7(2), 785–792 (2013)
Djelloul, H., Layeb, A., Chikhi, S.: A binary cuckoo search algorithm for graph coloring problem. Int. J. Appl. Evol. Comput. 5(3), 42–56 (2014)
Aoki, T., Aranha, C., Kanoh, H.: PSO algorithm with transition probability based on hamming distance for graph coloring problem. In: IEEE International Conference On Systems, Man, and Cybernetics, pp. 1956–1961 (2015)
Brown, C., Liebovitch, L.S., Glendon, R.: Lévy flights in Dobe Ju’hoansi foraging patterns. Hum. Ecol. 35, 129–138 (2007)
Pavlyukevich, I.: Lévy flights, non-local search and simulated annealing. J. Comput. Phys. 226, 1830–1844 (2007)
Reynolds, A.M., Frye, M.A.: Free-flight odor tracking in Drosophila is consistent with an optimal intermittent scale-free search. PLoS ONE 2, e354 (2007)
Viswanathan, G.M., Raposo, E.P., da Luz, M.G.E.: Lévy flights and super diffusion in the context of biological encounters and random searches. Phys. Life Rev. 5(3), 133–150 (2008)
Ali, A.F.: A hybrid gravitational search with lévy flight for global numerical optimization. Inf. Sci. Lett. 4(2), 71–83 (2015)
Yang, X.S., Deb, S.: Engineering optimization by cuckoo search. Int. J. Math. Model. Numer. Optim. 1, 330–343 (2010)
Yang, X.-S.: Nature-Inspired Metaheuristic Algorithms, 2nd edn. Luniver Press, Bristol (2010)
Mantegna, R.N.: Fast, accurate algorithm for numerical simulation of Lévy stable stochastic processes. Phys. Rev. E 49(5), 4677–4683 (1994)
Minton, S., Johnston, M.D., Philips, A.B., Laird, P.: Minimizing conflicts: a heuristic repair method for constraint-satisfaction and scheduling problems. Artif. Intell. 58, 161–205 (1992)
Hogg, T., Williams, C.: The hardest constraint problems: a double phase transition. Artif. Intell. 69, 359–377 (1994)
Acknowledgments
This work was supported by JSPS KAKENHI grand number 15K00296.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Aranha, C., Toda, K., Kanoh, H. (2017). Solving the Graph Coloring Problem Using Cuckoo Search. In: Tan, Y., Takagi, H., Shi, Y. (eds) Advances in Swarm Intelligence. ICSI 2017. Lecture Notes in Computer Science(), vol 10385. Springer, Cham. https://doi.org/10.1007/978-3-319-61824-1_60
Download citation
DOI: https://doi.org/10.1007/978-3-319-61824-1_60
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-61823-4
Online ISBN: 978-3-319-61824-1
eBook Packages: Computer ScienceComputer Science (R0)