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
-
Heuristic for Stochastic Online Flowshop Problem with Preemption Penalties
by: Mohammad Bayat, et al.
Published: (2013-01-01) -
Improved ant colony algorithm based on natural selection strategy for solving TSP problem
by: Hua-feng WU, et al.
Published: (2013-04-01) -
METHAPHYSICS OF DEATH PENALTY
by: V. E. Gromov
Published: (2017-06-01) -
Multinomial Regression with Elastic Net Penalty and Its Grouping Effect in Gene Selection
by: Liuyuan Chen, et al.
Published: (2014-01-01) -
A Court’s Right to Moderate Administrative Penalty in Selected Central European Countries
by: Nikolaj Zakrenicnyj
Published: (2024-05-01)