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

Random Search

In: Forest Harvest Scheduling

Author

Listed:
  • Pete Bettinger

    (University of Georgia)

Abstract

Random search, in this chapter of this book, refers to the ability of a search process to either (1) modify randomly one feasible solution with the hope of improving the quality of the solution, or (2) construct a single feasible solution using random selections of management activities. Random search is efficient, perhaps one of the most computationally fast methods for developing feasible solutions to complex problems. Random search, however, may not be very effective in producing high quality solutions to complex problems simply due to the random nature of the search. For research purposes, it seems that a random search-based starting point within a solution space is necessary in order to produce what some consider to be independent samples (final solutions) to complex problems using other heuristic methods.

Suggested Citation

  • Pete Bettinger, 2025. "Random Search," Springer Texts in Business and Economics, in: Forest Harvest Scheduling, chapter 0, pages 147-160, Springer.
    • Handle: RePEc:spr:sptchp:978-3-031-89432-9_7
    DOI: 10.1007/978-3-031-89432-9_7
    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_7. 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.