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.

Full Text

Published Version

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.