Discrete Particle Swarm Optimization Algorithm for Solving Graph Coloring Problem

Kai Zhang; Wanying Zhu; Jun Liu; Juanjuan He

doi:10.1007/978-3-662-49014-3_57

ScienceGate Book Chapters

BOOK-CHAPTER

Discrete Particle Swarm Optimization Algorithm for Solving Graph Coloring Problem

Kai Zhang Wanying Zhu Jun Liu Juanjuan He

Year: 2015 Communications in computer and information science Pages: 643-652 Publisher: Springer Science+Business Media

DOI: 10.1007/978-3-662-49014-3_57

Get Full-Text PDF Get Analytical Report

Keywords:

Particle swarm optimization Graph coloring Discrete space Computer science Benchmark (surveying) Multi-swarm optimization Metaheuristic Mathematical optimization Algorithm Graph Optimization problem Discrete optimization Swarm behaviour Mathematics Theoretical computer science

Metrics

Cited By

2.68

FWCI (Field Weighted Citation Impact)

Refs

0.90

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

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

Discrete Particle Swarm Optimization Algorithm for Solving Graph Coloring Problem

Metrics

Citation History

Topics

Related Documents

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

Solving Graph Coloring Problem Using Parallel Discrete Particle Swarm Optimization on CUDA

Hybrid Discrete Particle Swarm Algorithm for Graph Coloring Problem

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

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