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 条

[31] Solving the Latin Square Completion Problem by Memetic Graph Coloring
Jin, Yan
Hao, Jin-Kao
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2019, 23 (06) : 1015 - 1028
[32] Solving Graph Vertex Coloring Problem with Microfluidic DNA Computer
Niu, Ying
Zhang, Xuncai
Cui, Guangzhao
PROCEEDINGS OF THE 10TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION (WCICA 2012), 2012, : 5061 - 5065
[33] Discrete selfish herd optimizer for solving graph coloring problem
Ruxin Zhao
Yongli Wang
Chang Liu
Peng Hu
Hamed Jelodar
Mahdi Rabbani
Hao Li
Applied Intelligence, 2020, 50 : 1633 - 1656
[34] Discrete selfish herd optimizer for solving graph coloring problem
Zhao, Ruxin
Wang, Yongli
Liu, Chang
Hu, Peng
Jelodar, Hamed
Rabbani, Mahdi
Li, Hao
APPLIED INTELLIGENCE, 2020, 50 (05) : 1633 - 1656
[35] An Approach for Solving the Graph Coloring Problem using Adjacency Matrix
Negi, Charu
Shukla, Ajay Narayan
PROCEEDINGS OF THE 2019 8TH INTERNATIONAL CONFERENCE ON SYSTEM MODELING & ADVANCEMENT IN RESEARCH TRENDS (SMART-2019), 2019, : 10 - 13
[36] Solving the graph coloring problem via hybrid genetic algorithms
Douiri, Sidi Mohamed
Elbernoussi, Souad
Journal of King Saud University - Engineering Sciences, 2015, 27 (01) : 114 - 118
[37] Solving Graph Coloring Problems with the Douglas-Rachford Algorithm
Aragon Artacho, Francisco J.
Campoy, Ruben
SET-VALUED AND VARIATIONAL ANALYSIS, 2018, 26 (02) : 277 - 304
[38] Solving Graph Coloring Problems with the Douglas-Rachford Algorithm
Francisco J. Aragón Artacho
Rubén Campoy
Set-Valued and Variational Analysis, 2018, 26 : 277 - 304
[39] Solving vertex coloring problem with Cellular Ant Algorithm
Wang, Yuanzhi
Journal of Information and Computational Science, 2013, 10 (11): : 3587 - 3594
[40] A Michigan memetic algorithm for solving the vertex coloring problem
Mirsaleh, Mehdi Rezapoor
Meybodi, Mohammad Reza
JOURNAL OF COMPUTATIONAL SCIENCE, 2018, 24 : 389 - 401

← 1 2 3 4 5 →