Simulated Annealing and Combinatorial Optimization
Surendra Nahar, Sartaj K. Sahni, Eugene B. Shragowitz · Design Automation Conference · 1986
We formulate a class of adaptive heuristics for combinatorial optimization. Recently proposed methods such as simulated annealing, probabilistic hill climbing, and sequence heuristics, as well as classical perturbation methods are all members of this class of adaptive heuristics. We expose the issues involved in using an adaptive heuristic in general, and simulated annealing, probabilistic hill climbing, and sequence heuristics in particular. These issues are investigated experimentally.