MTPSO algorithm for solving planar graph coloring problem

作者：Hsu, Ling-Yuan; Horng, Shi-Jinn^*; Fan, Pingzhi; Khan, Muhammad Khurram; Wang, Yuh-Rau; Run, Ray-Shine; Lai, Jui-Lin; Chen, Rong-Jian

来源：Expert Systems with Applications, 2011, 38(5): 5525-5531.

DOI：10.1016/j.eswa.2010.10.084

• Planar graph coloring
• Four-color problem
• Modified turbulent particle swarm
• optimization
• Walking one
• PSO

In this paper, we proposed a modified turbulent particle swarm optimization (named MTPSO) model for solving planar graph coloring problem based on particle swarm optimization. The proposed model is consisting of the walking one strategy, assessment strategy and turbulent strategy. The proposed MTPSO model can solve the planar graph coloring problem using four-colors more efficiently and accurately. Compared to the results shown in Cui et al. (2008), not only the experimental results of the proposed model can get smaller average iterations but can get higher correction coloring rate when the number of nodes is greater than 30.

• 出版日期2011-5
• 单位西南交通大学