Random Search

Pete Bettinger
Additional contact information
Pete Bettinger: University of Georgia

Chapter Chapter 7 in Forest Harvest Scheduling, 2025, pp 147-160 from Springer

Abstract: 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.

Keywords: Heuristic; Simulation; Random selection of activities (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_7

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

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

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 ().