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-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.
Research supported by DFG (Schr 390/2-1)
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Angluin, D.; Valiant, L.G.: Fast probabilistic algorithms for Hamiltonian circuits and matchings, J. Comput. System Sci. 18, 1979
Anily, S. and Federgruen, A.: Ergodicity in Parametric Nonstationary Markov Chains: An Application to Simulated Annealing Methods, Oper. Res. 35, 1987
Chung, K.L.: Markov chains with stationary transition probabilities, Springer Verlag, Heidelberg, 1960.
Garey, M.R.; Johnson, S. J.: Computers and Intractability, W.H. Freeman and Company, 1979
Gidas, B.: Nonstationary Markov Chains and Convergence of the Annealing Algorithm, J. Statis. Phys. 39, 1985
Hajek, B.: Hitting Time and Occupation-Time Bounds Implied By Drift Analysis With Applications, Advanced Applied Probability 14, 1982
Hajek, B.: Cooling Schedules for Optimal Annealing, Mathematics of Operations Research 13, 1988
Jerrum, M.: Large Cliques elude the Metropolis Process, Random Structures and Algorithms 3, 1992
Jerrum, J; Sinclair, A.: Approximating the permanent, Proceedings of the 20th ACM-Symposium on Theory of Computing, 1988.
Johnson, D.S. et al.: Optimization by Simulated Annealing: An Experimental Evaluation, Operations Research 39, 1991
Kirkpatrick, S.; Gelatt, C.D.; Vecchi, M.P.: Optimization by Simulated Annealing, Science 220, 1983.
Laarhoven, P.J.M.; Aarts, E.H.L.: Simulated Annealing: Theory and Applications, Kluwer Academic Publishers, 1989.
Metropolis, N. et al.: Equations of state calculations by fast computer machines, Journal of Chemical Physics 21, 1953
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.
Mitra, D.; Romeo, F.; Sangiovanni-Vincentelli, A.L.: Convergence and Finite Time Behaviour of Simulated Annealing, Adv. Appl. Prob. 18, 1986
Nolte, A.; Schrader, R.: Simulated Annealing for Graph coloring, Technical report, University of Cologne, in preparation
Sasaki, G.H.; Hajek, B.: The Time Complexity of Maximum Matching by Simulated Annealing, Journal of the Association for Computing Machinery 35, 1988
Tsitsiklis, J.: Markov Chains with Rare Transitions and Simulated Annealing, Mathematics of Operations Research 14, 1989
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nolte, A., Schrader, R. (1996). Simulated Annealing and its problems to color graphs. In: Diaz, J., Serna, M. (eds) Algorithms — ESA '96. ESA 1996. Lecture Notes in Computer Science, vol 1136. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61680-2_52
Download citation
DOI: https://doi.org/10.1007/3-540-61680-2_52
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61680-1
Online ISBN: 978-3-540-70667-0
eBook Packages: Springer Book Archive