Selection and Penalty Strategies for Genetic Algorithms Designed to Solve Spatial Forest Planning Problems
Genetic algorithms (GAs) have demonstrated success in solving spatial forest planning problems. We present an adaptive GA that incorporates population-level statistics to dynamically update penalty functions, a process analogous to strategic oscillation from the tabu search literature. We also explo...
Saved in:
Main Authors: | Matthew P. Thompson, Jeff D. Hamann, John Sessions |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2009-01-01
|
Series: | International Journal of Forestry Research |
Online Access: | http://dx.doi.org/10.1155/2009/527392 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A Rough Penalty Genetic Algorithm for Multicast Routing in Mobile Ad Hoc Networks
by: Chih-Hao Lin, et al.
Published: (2013-01-01) -
Solving “Antenna Array Thinning Problem” Using Genetic Algorithm
by: Rajashree Jain, et al.
Published: (2012-01-01) -
Improved Genetic Algorithm to Solve the Scheduling Problem of College English Courses
by: Jing Xu
Published: (2021-01-01) -
METHAPHYSICS OF DEATH PENALTY
by: V. E. Gromov
Published: (2017-06-01) -
Retracted: Improved Genetic Algorithm to Solve the Scheduling Problem of College English Courses
by: null Complexity
Published: (2023-01-01)