Simulated Annealing and its problems to color graphs

  • Andreas Nolte
  • Rainer Schrader
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1136)


Simulated Annealing is a very successful heuristic for various problems in combinatorial optimization. In this paper an application of Simulated Annealing to the 3-coloring 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 coloring, given an arbitrary cooling scheme, is of exponential size. Furthermore a new proof of the convergence of Simulated Annealing with a logarithmic cooling schedule by considering the conductance of the underlying transition graph is given. With this proof technique it is possible to show that Simulated Annealing converges to an optimal solution in exponential time.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Angluin, D.; Valiant, L.G.: Fast probabilistic algorithms for Hamiltonian circuits and matchings, J. Comput. System Sci. 18, 1979Google Scholar
  2. 2.
    Anily, S. and Federgruen, A.: Ergodicity in Parametric Nonstationary Markov Chains: An Application to Simulated Annealing Methods, Oper. Res. 35, 1987Google Scholar
  3. 3.
    Chung, K.L.: Markov chains with stationary transition probabilities, Springer Verlag, Heidelberg, 1960.Google Scholar
  4. 4.
    Garey, M.R.; Johnson, S. J.: Computers and Intractability, W.H. Freeman and Company, 1979Google Scholar
  5. 5.
    Gidas, B.: Nonstationary Markov Chains and Convergence of the Annealing Algorithm, J. Statis. Phys. 39, 1985Google Scholar
  6. 6.
    Hajek, B.: Hitting Time and Occupation-Time Bounds Implied By Drift Analysis With Applications, Advanced Applied Probability 14, 1982Google Scholar
  7. 7.
    Hajek, B.: Cooling Schedules for Optimal Annealing, Mathematics of Operations Research 13, 1988Google Scholar
  8. 8.
    Jerrum, M.: Large Cliques elude the Metropolis Process, Random Structures and Algorithms 3, 1992Google Scholar
  9. 9.
    Jerrum, J; Sinclair, A.: Approximating the permanent, Proceedings of the 20th ACM-Symposium on Theory of Computing, 1988.Google Scholar
  10. 10.
    Johnson, D.S. et al.: Optimization by Simulated Annealing: An Experimental Evaluation, Operations Research 39, 1991Google Scholar
  11. 11.
    Kirkpatrick, S.; Gelatt, C.D.; Vecchi, M.P.: Optimization by Simulated Annealing, Science 220, 1983.Google Scholar
  12. 12.
    Laarhoven, P.J.M.; Aarts, E.H.L.: Simulated Annealing: Theory and Applications, Kluwer Academic Publishers, 1989.Google Scholar
  13. 13.
    Metropolis, N. et al.: Equations of state calculations by fast computer machines, Journal of Chemical Physics 21, 1953Google Scholar
  14. 14.
    Mihail, M.: Conductance and Convergence of Markov chains-A combinatorial treatment of expanders, Proceedings of the 30th Annual Symposium on Foundations of Computer Science, 1989.Google Scholar
  15. 15.
    Mitra, D.; Romeo, F.; Sangiovanni-Vincentelli, A.L.: Convergence and Finite Time Behaviour of Simulated Annealing, Adv. Appl. Prob. 18, 1986Google Scholar
  16. 16.
    Nolte, A.; Schrader, R.: Simulated Annealing for Graph coloring, Technical report, University of Cologne, in preparationGoogle Scholar
  17. 17.
    Sasaki, G.H.; Hajek, B.: The Time Complexity of Maximum Matching by Simulated Annealing, Journal of the Association for Computing Machinery 35, 1988Google Scholar
  18. 18.
    Tsitsiklis, J.: Markov Chains with Rare Transitions and Simulated Annealing, Mathematics of Operations Research 14, 1989Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Andreas Nolte
    • 1
  • Rainer Schrader
    • 1
  1. 1.University of CologneCologneGermany

Personalised recommendations