A Novel Particle Swarm Optimization-Based Algorithm for the Graph Coloring Problem

Tuan Hoang Anh; Thuy Thi Trinh Giang; Trong Le Vinh

doi:10.1109/iciecs.2009.5365201

ScienceGate Book Chapters

JOURNAL ARTICLE

A Novel Particle Swarm Optimization-Based Algorithm for the Graph Coloring Problem

Tuan Hoang Anh Thuy Thi Trinh Giang Trong Le Vinh

Year: 2009 Pages: 1-3

DOI: 10.1109/iciecs.2009.5365201

Get Full-Text PDF Get Analytical Report

Abstract

In this paper, we study the problem of graph coloring and propose a novel particle swarm optimization (PSO) algorithm for it. We use the PSO evolutionary progress to improve a simple deterministic greedy algorithm. The new algorithm can achieve a result that is better than known heuristic algorithms do, as verified by an extensive simulation study.

Keywords:

Particle swarm optimization Computer science Graph coloring Greedy algorithm Mathematical optimization Multi-swarm optimization Heuristic Metaheuristic Algorithm Simple (philosophy) Evolutionary algorithm Graph Theoretical computer science Mathematics

Metrics

Cited By

0.77

FWCI (Field Weighted Citation Impact)

Refs

0.79

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Scheduling and Timetabling Solutions

Social Sciences → Decision Sciences → Management Science and Operations Research

Vehicle Routing Optimization Methods

Physical Sciences → Engineering → Industrial and Manufacturing Engineering

Constraint Satisfaction and Optimization

Physical Sciences → Computer Science → Computer Networks and Communications

A Novel Particle Swarm Optimization-Based Algorithm for the Graph Coloring Problem

Abstract

Metrics

Citation History

Topics

Related Documents

A Novel Discrete Particle Swarm Optimization Algorithm for Solving Graph Coloring Problem

Discrete Particle Swarm Optimization Algorithm for Solving Graph Coloring Problem

Acceleration Based Particle Swarm Optimization for Graph Coloring Problem

Hybrid Discrete Particle Swarm Algorithm for Graph Coloring Problem

Solving Graph Coloring Problem Using Divide and Conquer-Based Turbulent Particle Swarm Optimization