Abstract
In this paper, we have proposed a new particle swarm optimization algorithm named Enhanced PSO. The proposed strategy consists of the concept of the smallest position value rule. In this case, the solution having the smallest position value will be served first. The newly proposed PSO algorithm provides yet another solution for the planar graph coloring problem (GCP) using four colors to get smaller average iterations and higher correction coloring rate.
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
Similar content being viewed by others
References
Hsu, L.-Y., Horng, S.-J., Khan, M.K., Run, R.-S., Lai, J.-L., Chen, R.-J.: MTPSO algorithm for solving planar graph coloring problem. Elsevier J. 38(5), 5525–5531 (2011)
Cui, G., Qin, L., Liu, S., Wang, Y., Zhang, X., Cao, X.: Modified PSO algorithm for solving planar graph coloring problem. Elsevier J. 18, 353–357 (2007)
Qin, J.: Hybrid discrete particle swarm algorithm for graph coloring problem. J. Comp. 6(6), 1175–1182 (2011)
Liao, C.J., Tseng, C.T., Luarn, P.: Discrete version of particle swarm optimization for flowshop scheduling problems. Elsevier J. 34, 3099–3111 (2005)
Moraglio, A., Togelius, J.: Geometric particle swarm optimization for the sudoku puzzle. In: ACM-USA (2007)
Sedighizadeh, D., Masehian, E.: Particle swarm optimization methods, taxonomy and applications. Int. J. Comp. Theory Eng. 1(5) (2009)
Kaur, K., Tiwari, S.P.: Grid Scheduling using particle swarm optimization with SPV. Int. J. Adv. Res. Comp. Sci. Electron. Eng. 1(5) (2012)
Shi, Y., Eberhart, R.C.: Empirical study on particle swarm optimization. In: IEEE, Washington DC (1999)
Zhou, Y., Zheng, H.: An improved cuckoo search algorithm for solving planar graph coloring problem. Appl. Math. Inf. Sci. 7(2), 785–792 (2012)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer India
About this paper
Cite this paper
Bhardwaj, V., Tiwari, S.P. (2014). Solving Planar Graph Coloring Problem Using PSO with SPV Rule. In: Mohapatra, D.P., Patnaik, S. (eds) Intelligent Computing, Networking, and Informatics. Advances in Intelligent Systems and Computing, vol 243. Springer, New Delhi. https://doi.org/10.1007/978-81-322-1665-0_97
Download citation
DOI: https://doi.org/10.1007/978-81-322-1665-0_97
Publisher Name: Springer, New Delhi
Print ISBN: 978-81-322-1664-3
Online ISBN: 978-81-322-1665-0
eBook Packages: EngineeringEngineering (R0)