Genetic Algorithm Search

Pete Bettinger
Additional contact information
Pete Bettinger: University of Georgia

Chapter Chapter 11 in Forest Harvest Scheduling, 2025, pp 217-235 from Springer

Abstract: Abstract A genetic algorithm search process acts much differently than simulated annealing or tabu search in how it attempts to solve a problem, as it employs information from several forest plans to search for the best overall plan. In employing a genetic algorithm search process, a population of feasible solutions is created and maintained, new members are developed by combining traits of current members of the population, and the overall population quality should improve as it evolves. The search process is analogous to the birth and death of a group of biological organisms. Potential new members of the population, child solutions, are provided genetic material (assignments of activities to decision variables) from current members of the population, or parent solutions. As the population evolves, at least one member should approach the maximum potential biological quality (the global optimum solution to a problem).

Keywords: Heuristic; Population-based; Crossover; Mutation; p-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_11

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

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

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