Hostname: page-component-77c89778f8-9q27g Total loading time: 0 Render date: 2024-07-20T06:26:46.836Z Has data issue: false hasContentIssue false

Simulated Annealing and Graph Colouring

Published online by Cambridge University Press:  12 April 2001

ANDREAS NOLTE
Affiliation:
Universität zu Köln, Weyertal 80, 50931 Köln, Germany (e-mail: a.nolte@allianz.de, rs@zpr.uni-koeln.de)
RAINER SCHRADER
Affiliation:
Universität zu Köln, Weyertal 80, 50931 Köln, Germany (e-mail: a.nolte@allianz.de, rs@zpr.uni-koeln.de)

Abstract

Simulated annealing is a very successful heuristic for various problems in combinatorial optimization. In this paper an application of simulated annealing to the 3-colouring problem is considered. In contrast to many good empirical results we will show for a certain class of graphs that the expected first hitting time of a proper colouring, given an arbitrary cooling scheme, is of exponential size.

These results are complementary to those in [13], where we prove the convergence of simulated annealing to an optimal solution in exponential time.

Type
Research Article
Copyright
2001 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

Extended version of [14].