+ Site Statistics
References:
54,258,434
Abstracts:
29,560,870
PMIDs:
28,072,757
+ Search Articles
+ PDF Full Text Service
How our service works
Request PDF Full Text
+ Follow Us
Follow on Facebook
Follow on Twitter
Follow on LinkedIn
+ Subscribe to Site Feeds
Most Shared
PDF Full Text
+ Translate
+ Recently Requested

Intensifying a heuristic forest harvest scheduling search procedure with 2-opt decision choices



Intensifying a heuristic forest harvest scheduling search procedure with 2-opt decision choices



Canadian journal of forest research 29(11): 1784-1792



Forest management problems with even-flow and adjacency considerations are difficult to solve optimally. A heuristic search intensification process, which uses two types of decision procedures, changes to single-decision choices (1-opt moves) and changes to two-decision choices simultaneously (2-opt moves), was used in an attempt to locate feasible and efficient solutions to these problems. One-opt moves involve changing the timing of timber harvests for a single land unit and are commonly used in heuristic techniques. Two-opt moves involve swapping the harvest timing between two land units, which intensify the search process. We apply the procedures to two management problems, one with 40 land units and the other with 700 land units. The goal is to achieve the highest, and most even, flow of timber volume over five time periods, with adjacent units being unavailable for harvest in the same period. One-opt moves, used alone, allowed the search process to produce good feasible solutions to these management problems and to generate a relatively even spread (number) of harvests over the planning horizon. The use of 2-opt moves resulted in better solutions, although the number of harvests per time period remained static. These procedures, used alone, may not be appropriate for all problems, because of their nature and limitations.

Please choose payment method:






(PDF emailed within 0-6 h: $19.90)

Accession: 003480728

Download citation: RISBibTeXText

DOI: 10.1139/x99-160


Related references

A heuristic weight determination procedure for goal programs used for harvest scheduling models. Canadian Journal of Forest Research 12(2): 292-298, 1982

Combining tabu search and genetic algorithm heuristic techniques to solve spatial harvest scheduling problems. Forest science 48(1): 35-46, 2002

Combining random and systematic search heuristic procedures for solving spatially constrained forest management scheduling models. Forest science 48(3): 608-621, 2002

Area-based harvest scheduling and allocation of forest land using methods for multiple-criteria decision making. Canadian Journal of Forest Research 23(2): 151-158, 1993

Adjacency constraints in harvest scheduling an aggregation heuristic. Canadian Journal of Forest Research 20(7): 978-986, 1990

A three-stage heuristic for harvest scheduling with access road network development. Forest science 46(2): 204-218, 2000

A new heuristic to solve spatially constrained long-term harvest scheduling problems. Forest science 40(3): 365-396, 1994

Heuristic procedures for solving mixed-integer harvest scheduling-transportation planning models. Canadian journal of forest research 25(10): 1618-1626, 1995

Modelling economic stand level optimization of forest harvest scheduling in Denmark by application of decision tree optimization and linear programming. Samfundsvidenskabelig Memo Serie Institut for Okonomi, Skov og Landskab ( 1): v + 17 pp., 1994

Analysis and evaluation of the R-ratio heuristic for forest scheduling. General Technical Report Pacific Northwest Research Station, USDA Forest Service (PNW-GTR-656): 275-283, 2005

Clustering forest harvest stands on spatial networks for optimised harvest scheduling. Annals of Forest Science 69(5): 651-657, 2012

Evaluation of the effects of intensifying the harvest of the forest biomass on the fertility of forest soils. Evaluation des effets de l' intensification de la recolte de la biomasse forestiere sur la fertilite des sols forestiers: 27 pp., 1994

A microcomputer program for solving forest scheduling problems with heuristic approaches. EFI Proceedings ( 5): 153-163, 1996

Pattern recognition through heuristic search in a decision state space. Biotelemetry 2(1/2): (1976), 1975