IDEAS home Printed from https://ideas.repec.org/h/spr/sptchp/978-3-031-89432-9_9.html
   My bibliography  Save this book chapter

Simulated Annealing Search

In: Forest Harvest Scheduling

Author

Listed:
  • Pete Bettinger

    (University of Georgia)

Abstract

Simulated annealing is a heuristic search process that is very similar to threshold accepting, with one key difference that is associated with the acceptance rule employed when an inferior solution is proposed. As with threshold accepting, simulated annealing might be considered a refinement of Monte Carlo simulation. During the search process, a single solution is maintained, and a random perturbation is proposed as a change to it (Form 4 in Chap. 7 ). Should the proposed change result in a higher quality, feasible solution, it is automatically accepted. However, should the change result in an inferior solution, it may be acceptable based on a decision that varies by (a) how distant the objective function value of the proposed solution is from the objective function value of the previous (or best) solutions, and (b) how long the heuristic search has been functioning. Some enhancements to the basic structure of a simulated annealing search process allow it to produce high quality results for forest harvest scheduling problems.

Suggested Citation

  • Pete Bettinger, 2025. "Simulated Annealing Search," Springer Texts in Business and Economics, in: Forest Harvest Scheduling, chapter 0, pages 179-195, Springer.
  • Handle: RePEc:spr:sptchp:978-3-031-89432-9_9
    DOI: 10.1007/978-3-031-89432-9_9
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sptchp:978-3-031-89432-9_9. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.