Sciweavers

Share
PPAM
2007
Springer

Parallel Simulated Annealing Algorithm for Graph Coloring Problem

10 years 10 months ago
Parallel Simulated Annealing Algorithm for Graph Coloring Problem
Abstract. The paper describes an application of Parallel Simulated Annealing (PSA) for solving one of the most studied NP-hard optimization problems: Graph Coloring Problem (GCP). Synchronous master-slave model with periodic solution update is being used. The paper contains description of the method, recommendations for optimal parameters settings and summary of results obtained during algorithm’s evaluation. A comparison of our novel approach to a PGA metaheuristic proposed in the literature is given. Finally, directions for further work in the subject are suggested. Key words: graph coloring, parallel simulated annealing, parallel metaheuristic
Szymon Lukasik, Zbigniew Kokosinski, Grzegorz Swie
Added 09 Jun 2010
Updated 09 Jun 2010
Type Conference
Year 2007
Where PPAM
Authors Szymon Lukasik, Zbigniew Kokosinski, Grzegorz Swieton
Comments (0)
books