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 条

[41] A parallel algorithm for solving the coloring problem on trapezoid graphs
Nakayama, S
Masuyama, S
INFORMATION PROCESSING LETTERS, 1997, 62 (06) : 323 - 327
[42] A Solution to Graph Coloring Problem Using Genetic Algorithm
Malhotra, Karan
Vasa, Karan D.
Chaudhary, Neha
Vishnoi, Ankit
Sapra, Varun
EAI ENDORSED TRANSACTIONS ON SCALABLE INFORMATION SYSTEMS, 2024, 11 (06):
[43] A new DNA algorithm to solve graph coloring problem
Jiang Xingpeng1
2. College of Applied Sciences
3. School of Science
ProgressinNaturalScience, 2007, (06) : 733 - 738
[44] Application of the graph coloring algorithm to the frequency assignment problem
Park, T
Lee, CY
JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 1996, 39 (02) : 258 - 265
[45] A Discrete Flower Pollination Algorithm for Graph Coloring Problem
Bensouyad, Meriem
Saidouni, DjamelEddine
2015 IEEE 2ND INTERNATIONAL CONFERENCE ON CYBERNETICS (CYBCONF), 2015, : 151 - 155
[46] A Parallel MCMC Algorithm for the Balanced Graph Coloring Problem
Conte, Donatello
Grossi, Giuliano
Lanzarotti, Raffaella
Lin, Jianyi
Petrini, Alessandro
GRAPH-BASED REPRESENTATIONS IN PATTERN RECOGNITION, GBRPR 2019, 2019, 11510 : 161 - 171
[47] A new DNA algorithm to solve graph coloring problem
Jiang, Xingpeng
Li, Yin
Meng, Ya
Meng, Dazhi
PROGRESS IN NATURAL SCIENCE-MATERIALS INTERNATIONAL, 2007, 17 (06) : 733 - 738
[48] Parallel Simulated Annealing algorithm for Graph Coloring Problem
Lukasik, Szymon
Kokosinski, Zbigniew
Swieton, Grzegorz
PARALLEL PROCESSING AND APPLIED MATHEMATICS, 2008, 4967 : 229 - +
[49] Coloring the square of a planar graph
van den Heuvel, J
McGuinness, S
JOURNAL OF GRAPH THEORY, 2003, 42 (02) : 110 - 124
[50] Solving the Fixed Graph Coloring Problem by Simulated Annealing and Greedy Search
Zhao, Kai
Geng, Xiutang
Xu, Jin
JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE, 2015, 12 (04) : 637 - 646

← 1 2 3 4 5 →