Threshold Accepting Search

Pete Bettinger
Additional contact information
Pete Bettinger: University of Georgia

Chapter Chapter 8 in Forest Harvest Scheduling, 2025, pp 161-178 from Springer

Abstract: Abstract Threshold accepting, or threshold search, might be characterized as a refinement of Monte Carlo simulation, whereby random changes to the character of a solution to a problem are proposed and found acceptable (a) if the changes improve the quality of the solution, or (b) if the changes result in a different solution whose quality is not much different than the previous (or best) solution. The acceptance criteria, or the threshold, are described in the same units as the units employed in the objective function of a problem. The manner in which the process decides whether to continue forward with an inferior solution suggests that threshold accepting may be more logical to use and more practical to understand than other heuristic search processes. With tactical enhancements that are now common among other heuristic methods, threshold accepting has been shown to produce high quality results for forest planning problems.

Keywords: Heuristic; Local search; Point-based search; Stochastic search; s-metaheuristic (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sptchp:978-3-031-89432-9_8

Ordering information: This item can be ordered from
http://www.springer.com/9783031894329

DOI: 10.1007/978-3-031-89432-9_8

Access Statistics for this chapter

More chapters in Springer Texts in Business and Economics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().