MTPSO algorithm for solving planar graph coloring problem

Authors:
Ling-Yuan Hsu;Shi-Jinn Horng;Pingzhi Fan;Muhammad Khurram Khan;Yuh-Rau Wang;Ray-Shine Run;Jui-Lin Lai;Rong-Jian Chen
Affiliations:
Department of Computer Science & Information Engineering, National Taiwan University of Science and Technology, 106 Taipei, Taiwan;Department of Computer Science & Information Engineering, National Taiwan University of Science and Technology, 106 Taipei, Taiwan and Institute of Mobile Communications, Southwest Jiaotong Univer ...;Institute of Mobile Communications, Southwest Jiaotong University, Chengdu, Sichuan 610031, PR China;Center of Excellence in Information Assurance, King Saud University, Saudi Arabia;Department of Computer Science and Information Engineering, St. John's University, Taipei, Taiwan;Department of Electronic Engineering, National United University, 36003 Miao-Li, Taiwan;Department of Electronic Engineering, National United University, 36003 Miao-Li, Taiwan;Department of Electronic Engineering, National United University, 36003 Miao-Li, Taiwan
Venue:
Expert Systems with Applications: An International Journal
Year:
2011

Citing 12
Cited 4

The priority-based coloring approach to register allocation

ACM Transactions on Programming Languages and Systems (TOPLAS)
Fuzzy Adaptive Turbulent Particle Swarm Optimization

HIS '05 Proceedings of the Fifth International Conference on Hybrid Intelligent Systems
A tabu search procedure based on a random Roulette diversification for the weighted maximal planar graph problem

Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
A survey of local search methods for graph coloring

Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
A graph coloring heuristic using partial solutions and a reactive tabu scheme

Computers and Operations Research
An ant-based algorithm for coloring graphs

Discrete Applied Mathematics
An improved ant colony optimisation heuristic for graph colouring

Discrete Applied Mathematics
An efficient flow-shop scheduling algorithm based on a hybrid particle swarm optimization model

Expert Systems with Applications: An International Journal
An improved method for forecasting enrollments based on fuzzy time series and particle swarm optimization

Expert Systems with Applications: An International Journal
Comparison among five evolutionary-based optimization algorithms

Advanced Engineering Informatics
TAIFEX and KOSPI 200 forecasting based on two-factors high-order fuzzy time series and particle swarm optimization

Expert Systems with Applications: An International Journal
Register allocation via coloring

Computer Languages

Mutual funds trading strategy based on particle swarm optimization

Expert Systems with Applications: An International Journal
A hybrid forecasting model for enrollments based on aggregated fuzzy time series and particle swarm optimization

Expert Systems with Applications: An International Journal
An empirical comparison of some approximate methods for graph coloring

HAIS'12 Proceedings of the 7th international conference on Hybrid Artificial Intelligent Systems - Volume Part I
An empirical evaluation of Gravitational Swarm Intelligence for graph coloring algorithm

Neurocomputing

Quantified Score

Hi-index	12.05

Visualization

Abstract

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.