Parallel simulated annealing algorithm for graph coloring problem

Authors:
Szymon Łukasik;Zbigniew Kokosiński;Grzegorz Świętoń
Affiliations:
Systems Research Institute, Polish Academy of Sciences, Warsaw, Poland;Department of Automatic Control, Cracow University of Technology, Cracow, Poland;Department of Automatic Control, Cracow University of Technology, Cracow, Poland
Venue:
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Year:
2007

Citing 8
Cited 1

Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning

Operations Research
Synchronous and Asynchronous Parallel Simulated Annealing with Multiple Markov Chains

IEEE Transactions on Parallel and Distributed Systems
Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11-13, 1993

Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11-13, 1993
Iterative Computer Algorithms with Applications in Engineering: Solving Combinatorial Optimization Problems

Iterative Computer Algorithms with Applications in Engineering: Solving Combinatorial Optimization Problems
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Computing the Initial Temperature of Simulated Annealing

Computational Optimization and Applications
Parallel Metaheuristics: A New Class of Algorithms

Parallel Metaheuristics: A New Class of Algorithms
A survey of local search methods for graph coloring

Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search

Combinatorial optimization in system configuration design

Automation and Remote Control

Quantified Score

Hi-index	0.00

Visualization

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.