Name
Title | ||
|---|---|---|
Pso Algorithm With Transition Probability Based On Hamming Distance For Graph Coloring Problem |
Abstract | ||
|---|---|---|
In this paper, we propose a PSO algorithm with transition probability based on Hamming distance for solving planar graph coloring problems. PSO was originally intended to handle only continuous optimization problems. To apply PSO to discrete problems, the standard arithmetic operators of PSO need to be redefined over discrete space. In this work, we propose a new algorithm that uses transition probability based on Hamming distance into PSO. The experimental results show that the new algorithm can get higher success rate and smaller average iterations than a Genetic Algorithm and the conventional PSO. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/SMC.2015.341 | 2015 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS (SMC 2015): BIG DATA ANALYTICS FOR HUMAN-CENTRIC SYSTEMS |
Keywords | Field | DocType |
Particle Swarm Optimization, Graph Coloring Probrem, Hamming distance, discrete PSO | Continuous optimization,Particle swarm optimization,Mathematical optimization,Algorithm design,Computer science,Hamming distance,Artificial intelligence,Genetic algorithm,Planar graph,Machine learning,Discrete space,Graph coloring | Conference |
ISSN | Citations | PageRank |
1062-922X | 3 | 0.52 |
References | Authors | |
8 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Takuya Aoki | 1 | 3 | 0.52 |
| Claus Aranha | 2 | 35 | 8.68 |
| Hitoshi Kanoh | 3 | 77 | 12.12 |