Old Bachelor Acceptance: A New Class of Non-Monotone Threshold Accepting Methods

DOI10.1287/IJOC.7.4.417MaRDI QIDQ4869757zbMATH OpenOpenAlexFDO

Authors

Publication date 19 August 1996

Published in ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.7.4.417

zbMATH Keywords

simulated annealingglobal optimizationnon-monotonethreshold acceptanceself-tuningsymmetric travelling salesmanold bachelor acceptancestochastic hill-climbing

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
• A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems
• On the convergence of ``threshold accepting
• The late acceptance hill-climbing heuristic

Cited in

(9)

• An overview of graph covering and partitioning
• Local search algorithms for political districting
• Positive role of glassy dynamics in finite-time optimization by threshold algorithms
• Revisiting simulated annealing: a component-based analysis
• Predatory search algorithm with restriction of solution distance
• Political districting: From classical models to recent approaches
• The late acceptance hill-climbing heuristic
• Political districting: from classical models to recent approaches
• Comparing different metaheuristic approaches for the median path problem with bounded length

This page was built for publication: Old Bachelor Acceptance: A New Class of Non-Monotone Threshold Accepting Methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4869757)