Old Bachelor Acceptance: A New Class of Non-Monotone Threshold Accepting Methods
T. C. Hu, Andrew B. Kahng, Chung-Wen Albert Tsao
ORSA Journal on Computing · 1995 · Volume 7 · Issue 4
Abstract
Stochastic hill-climbing algorithms, particularly simulated annealing (SA) and threshold acceptance (TA), have become very popular for global optimization applications. Typical implementations of SA or TA use monotone temperature or threshold schedules, and are not formulated to accommodate practical time limits. We present a new threshold acceptance strategy called Old Bachelor Acceptance (OBA), which has three distinguishing features: (i) it is specifically motivated by the practical requirement of optimization within a prescribed time bound, (ii) the threshold schedule is self-tuning , and (iii) the threshold schedule is non-monotone , with threshold values even allowed to become negative. The standard implementation of the TA method of Dueck and Scheuer is a special case of OBA. Experiments using several classes of symmetric traveling salesman problem instances show that OBA can outperform previous hill-climbing methods for time-critical optimizations. A number of directions for future work are suggested. INFORMS Journal on Computing , ISSN 1091-9856, was published as ORSA Journal on Computing from 1989 to 1995 under ISSN 0899-1499.
Keywords
heuristic search, combinatorial optimization, other
Enable JavaScript for citation tools and additional paper interactions.