MTPSO algorithm for solving planar graph coloring problem

被引：29

作者：

Hsu, Ling-Yuan ^{[1
]}

Horng, Shi-Jinn ^{[1
,2
]}

Fan, Pingzhi ^{[2
]}

Khan, Muhammad Khurram ^{[3
]}

Wang, Yuh-Rau ^{[4
]}

Run, Ray-Shine ^{[5
]}

Lai, Jui-Lin ^{[5
]}

Chen, Rong-Jian ^{[5
]}

机构：

[1] Natl Taiwan Univ Sci & Technol, Dept Comp Sci & Informat Engn, Taipei 106, Taiwan

[2] SW Jiaotong Univ, Inst Mobile Commun, Chengdu 610031, Sichuan, Peoples R China

[3] King Saud Univ, Ctr Excellence Informat Assurance, Riyadh 11451, Saudi Arabia

[4] St Johns Univ, Dept Comp Sci & Informat Engn, Taipei, Taiwan

[5] Natl United Univ, Dept Elect Engn, Miaoli 36003, Taiwan

来源：

EXPERT SYSTEMS WITH APPLICATIONS | 2011年 / 38卷 / 05期

关键词：

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

D O I：

10.1016/j.eswa.2010.10.084

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

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. (C) 2010 Elsevier Ltd. All rights reserved.

引用

页码：5525 / 5531

页数：7

共 50 条

[1] Modified PSO algorithm for solving planar graph coloring problem
Cui, Guangzhao
Qin, Limin
Liu, Sha
Wang, Yanfeng
Zhang, Xuncai
Cao, Xianghong
PROGRESS IN NATURAL SCIENCE-MATERIALS INTERNATIONAL, 2008, 18 (03) : 353 - 357
[2] Modifled PSO algorithm for solving planar graph coloring problem
Guangzhao Cui a
ProgressinNaturalScience, 2008, (03) : 353 - 357
[3] An improved Cuckoo Search Algorithm for Solving Planar Graph Coloring Problem
Zhou, Yongquan
Zheng, Hongqing
Luo, Qifang
Wu, Jinzhao
APPLIED MATHEMATICS & INFORMATION SCIENCES, 2013, 7 (02): : 785 - 792
[4] Local greedy flower pollination algorithm for solving planar graph coloring problem
Wang, Rui
Zhou, Yongquan
Zhou, Yuxiang
Bao, Zongfan
Journal of Computational and Theoretical Nanoscience, 2015, 12 (11) : 4087 - 4096
[5] On Solving the Queen Graph Coloring Problem
Vasquez, Michel
Vimont, Yannick
COMBINATORIAL ALGORITHMS, IWOCA 2017, 2018, 10765 : 244 - 251
[6] A Chaotic Binary Salp Swarm Algorithm for Solving the Graph Coloring Problem
Meraihi, Yassine
Ramdane-Cherif, Amar
Mahseur, Mohammed
Achelia, Dalila
MODELLING AND IMPLEMENTATION OF COMPLEX SYSTEMS, 2019, 64 : 106 - 118
[7] Solving the graph b-coloring problem with hybrid genetic algorithm
Labed, Said
Kout, Akram
Chikhi, Salim
2018 3RD INTERNATIONAL CONFERENCE ON PATTERN ANALYSIS AND INTELLIGENT SYSTEMS (PAIS), 2018, : 143 - 149
[8] Discrete Particle Swarm Optimization Algorithm for Solving Graph Coloring Problem
Zhang, Kai
Zhu, Wanying
Liu, Jun
He, Juanjuan
BIO-INSPIRED COMPUTING - THEORIES AND APPLICATIONS, BIC-TA 2015, 2015, 562 : 643 - 652
[9] Solving Graph Coloring Problem Using an Enhanced Binary Dragonfly Algorithm
Baiche, Karim
Meraihi, Yassine
Hina, Manolo Dulva
Ramdane-Cherif, Amar
Mahseur, Mohammed
INTERNATIONAL JOURNAL OF SWARM INTELLIGENCE RESEARCH, 2019, 10 (03) : 23 - 45
[10] A novel discrete particle swarm optimization algorithm for solving graph coloring problem
Zhang K.
Zhu W.
Liu J.
He J.
He, Juanjuan, 1600, American Scientific Publishers (13): : 3588 - 3594

← 1 2 3 4 5 →