RCIN and OZwRCIN projects

Object

Title: Parallel simulated annealing algorithm for graph coloring problem

Subtitle:

Raport Badawczy = Research Report ; RB/7/2007

Publisher:

Instytut Badań Systemowych. Polska Akademia Nauk ; Systems Research Institute. Polish Academy of Sciences

Place of publishing:

Warszawa

Description:

10, [6] pages ; 21 cm ; Bibliography p. 9-10

Abstract:

The paper describes an application of Parallel Simulated An­nealing (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 set­tings 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.

Relation:

Raport Badawczy = Research Report

Detailed Resource Type:

Report

Resource Identifier:

oai:rcin.org.pl:139750

Source:

RB-2007-07

Language:

eng

Language of abstract:

eng

Rights:

Creative Commons Attribution BY 4.0 license

Terms of use:

Copyright-protected material. [CC BY 4.0] May be used within the scope specified in Creative Commons Attribution BY 4.0 license, full text available at: ; -

Digitizing institution:

Systems Research Institute of the Polish Academy of Sciences

Original in:

Library of Systems Research Institute PAS

Projects co-financed by:

Operational Program Digital Poland, 2014-2020, Measure 2.3: Digital accessibility and usefulness of public sector information; funds from the European Regional Development Fund and national co-financing from the state budget.

Access:

Open

Objects

Similar
×

Citation

Citation style:

This page uses 'cookies'. More information