Current issue: 58(5)

Scopus CiteScore 2023: 3.5
Scopus ranking of open access forestry journals: 17^th
PlanS compliant

Articles by Kevin Boston

Category : Research article

article id 1232, category Research article

Pete Bettinger, Mehmet Demirci, Kevin Boston. (2015). Search reversion within s-metaheuristics: impacts illustrated with a forest planning problem. Silva Fennica vol. 49 no. 2 article id 1232. https://doi.org/10.14214/sf.1232

Keywords: forest planning; heuristics; threshold accepting; tabu search; spatial harvest scheduling; adjacency constraints; mixed integer goal programming

Highlights: The interruption of the sequence of events used to explore a solution space and develop a forest plan, and the re-initiation of the search process from a high-quality, known starting point (reversion) seems necessary for some s-metaheuristics; When using a s-metaheuristic, higher quality forest plans may be developed when the reversion interval is around six iterations of the model.

Abstract | Full text in HTML | Full text in PDF | Author Info

The use of a reversion technique during the search process of s-metaheuristics has received little attention with respect to forest management and planning problems. Reversion involves the interruption of the sequence of events that are used to explore the solution space and the re-initiation of the search process from a high-quality, known starting point. We explored four reversion rates when applied to three different types of s-metaheuristics that have previously shown promise for the forest planning problem explored, threshold accepting, tabu search, and the raindrop method. For two of the s-metaheuristics, we also explored three types of decision choices, a change to the harvest timing of a single management unit (1-opt move), the swapping of two management unit’s harvest timing (2-opt moves), and the swapping of three management unit’s harvest timing (3-opt moves). One hundred independent forest plans were developed for each of the metaheuristic / reversion rate combinations, all beginning with randomly-generated feasible starting solutions. We found that (a) reversion does improve the quality of the solutions generated, and (b) the rate of reversion is an important factor that can affect solution quality.

Bettinger, School of Forestry and Natural Resources, 180 E. Green Street, University of Georgia, Athens, Georgia, USA 30602 E-mail: pbettinger@warnell.uga.edu
Demirci, General Directorate of Forestry, Ministry of Forest and Water Affairs, Republic of Turkey E-mail: mehmetdemirci@yahoo.com
Boston, Department of Forest Engineering, Resources and Management, College of Forestry, Oregon State University, USA E-mail: Kevin.Boston@oregonstate.edu

article id 937, category Research article

Rene Zamora-Cristales, Kevin Boston, John Sessions, Glen Murphy. (2013). Stochastic simulation and optimization of mobile chipping economics in processing and transport of forest biomass from residues. Silva Fennica vol. 47 no. 5 article id 937. https://doi.org/10.14214/sf.937

Keywords: forest planning; simulation; optimization; economics; decision analysis; forest biomass; renewable energy

Highlights: A stochastic simulation model is proposed to analyze forest biomass operations; The cost of chipper and truck waiting times was estimated in forest biomass recovery operations; The economic effect of truck-machine interactions under uncertainty was analyzed; Road characteristics and processing location have an economic impact in truck and chipper waiting times

Abstract | Full text in HTML | Full text in PDF | Author Info

We analyzed the economics of mobile chipping and transport of biomass from forest residues for energy purposes under uncertainty. A discrete-event simulation model was developed and utilized to quantify the impacts of controllable and environmental variables on productivity in order to determine the most cost effective transportation options under steep terrain conditions. Truck-chipper interactions were analyzed to show their effect on truck and chipper standing time. A costing model was developed to account for operating and standing time cost (for the chipper and trucks). The model used information from time studies of each activity in the productive cycle and spatial-temporal information obtained from geographic information system (GIS) devices, and tracking analysis of machine and truck movements. The model was validated in field operations, and proved to be accurate in providing the expected productivity. A cost distribution was elaborated to support operational decisions of forest managers, landowners and risk-averse contractors. Different scenarios were developed to illustrate the economic effects due to changes in road characteristics such as in-highway transport distance, in-forest internal road distance and pile to trailer chipper traveling distances.

Zamora-Cristales, Department of Forest Engineering, Resources, and Management, College of Forestry, Oregon State University, 280 Peavy Hall, Corvallis, OR 97331, USA E-mail: rene.zamora@oregonstate.edu
Boston, Department of Forest Engineering, Resources, and Management, College of Forestry, Oregon State University, 280 Peavy Hall, Corvallis, OR 97331, USA E-mail: kevin.boston@oregonstate.edu
Sessions, Department of Forest Engineering, Resources, and Management, College of Forestry, Oregon State University, 280 Peavy Hall, Corvallis, OR 97331, USA E-mail: john.sessions@oregonstate.edu
Murphy, Waiariki Institute of Technology, Rotorua, New Zealand E-mail: glen.murphy@waiariki.ac.nz

article id 356, category Research article

Hamish D. Marshall, Glen Murphy, Kevin Boston. (2006). Three mathematical models for bucking-to-order. Silva Fennica vol. 40 no. 1 article id 356. https://doi.org/10.14214/sf.356

Keywords: mechanical harvesting/processing; optimal bucking; mixed integer programming; dynamic programming; buck-to-value

Abstract | View details | Full text in PDF | Author Info

The aim of this paper is to investigate different mathematical approaches to buck-to-order log merchandizing. A new bucking-to-order planning model using mixed integer programming was developed to determine the optimal production from a stand given different market constraints and forest inventory data. Three different approaches: market prices, target cutting patterns and adjusted price list were tested for generating cutting instructions to fulfill the plan created by the new planning model. The three approaches were evaluated in four test stands. The market prices approach simply applied the market prices to each stand. The target cutting patterns approach applied the sample cutting patterns generated from the planning model to the stand. The adjusted price list used a dynamic programming algorithm embedded in a search heuristic to adjust both the prices and small end diameters of log products to achieve the production goals of the planning models. The results showed that developing a buck-to-order plan is important in obtaining good order fulfillment. The target cutting patterns and adjusted price list approaches certainly out performed the market prices approach. This paper shows that these two approaches are capable of achieving excellent order fulfillment. Further development and testing is needed to determine which method is the best at generating cutting instructions for buck-to-order merchandizing.

Marshall, Ensis Forests, Private Bag 3020, Rotorua, New Zealand E-mail: hamish.marshall@ensisjv.com
Murphy, Forest Engineering Department, Oregon State University, Corvallis, Oregon 97331, USA E-mail: gm@nn.us
Boston, Forest Engineering Department, Oregon State University, Corvallis, Oregon 97331, USA E-mail: kb@nn.us

article id 545, category Research article

Pete Bettinger, David Graetz, Kevin Boston, John Sessions, Woodam Chung. (2002). Eight heuristic planning techniques applied to three increasingly difficult wildlife planning problems. Silva Fennica vol. 36 no. 2 article id 545. https://doi.org/10.14214/sf.545

Keywords: forest planning; spatial harvest scheduling; adjacency constraints

Abstract | View details | Full text in PDF | Author Info

As both spatial and temporal characteristics of desired future conditions are becoming important measures of forest plan success, forest plans and forest planning goals are becoming complex. Heuristic techniques are becoming popular for developing alternative forest plans that include spatial constraints. Eight types of heuristic planning techniques were applied to three increasingly difficult forest planning problems where the objective function sought to maximize the amount of land in certain types of wildlife habitat. The goal of this research was to understand the relative challenges and opportunities each technique presents when more complex difficult goals are desired. The eight heuristic techniques were random search, simulated annealing, great deluge, threshold accepting, tabu search with 1-opt moves, tabu search with 1-opt and 2-opt moves, genetic algorithm, and a hybrid tabu search / genetic algorithm search process. While our results should not be viewed as universal truths, we determined that for the problems we examined, there were three classes of techniques: very good (simulated annealing, threshold accepting, great deluge, tabu search with 1-opt and 2-opt moves, and tabu search / genetic algorithm), adequate (tabu search with 1-opt moves, genetic algorithm), and less than adequate (random search). The relative advantages in terms of solution time and complexity of programming code are discussed and should provide planners and researchers a guide to help match the appropriate technique to their planning problem. The hypothetical landscape model used to evaluate the techniques can also be used by others to further compare their techniques to the ones described here.

Bettinger, Department of Forest Resources, Oregon State University, Corvallis, OR 97331 E-mail: pete.bettinger@orst.edu
Graetz, Department of Forest Resources, Oregon State University, Corvallis, OR 97331 E-mail: dgw@nn.us
Boston, Carter Holt Harvey Forest Fibre Solutions, Tokoroa, New Zealand E-mail: kb@nn.nz
Sessions, Department of Forest Engineering, Oregon State University, Corvallis, OR 97331 E-mail: js@nn.us
Chung, Department of Forest Engineering, Oregon State University, Corvallis, OR 97331 E-mail: wc@nn.us

article id 578, category Research article

Kevin Boston, Pete Bettinger. (2001). Development of spatially feasible forest plans: a comparison of two modeling approaches. Silva Fennica vol. 35 no. 4 article id 578. https://doi.org/10.14214/sf.578

Keywords: forest planning; heuristics; linear programming; wildlife goals

Abstract | View details | Full text in PDF | Author Info

Spatial goals are becoming more frequent aspects of forest management plans as regulatory and organizational policies change in response to fisheries and wildlife concerns. The combination of green-up constraints (harvesting restrictions that prevent the cutting of adjacent units for a specified period of time) and habitat requirements for red-cockaded woodpeckers (RCW) in the southeastern U.S. suggests that spatially feasible forest plans be developed to guide management activities. We examined two modeling approaches aimed at developing management plans that had both harvest volume goals, RCW habitat, and green-up constraints. The first was a two-stage method that in one stage used linear programming to assign volume goals, and in a second stage used a tabu search – genetic algorithm heuristic technique to minimize the deviations from the volume goals while maximizing the present net revenue and addressing the RCW and green-up constraints. The second approach was a one-stage procedure where the entire management plan was developed with the tabu search – genetic algorithm heuristic technique, thus it did not use the guidance for timber volume levels provided by the LP solution. The goal was to test two modeling approaches to solving a realistic spatial harvest scheduling problem. One is where to volume goals are calculated prior to developing the spatially feasible forest plan, while the other approach simultaneously addresses the volume goals while developing the spatially feasible forest plan. The resulting forest plan from the two-stage approach was superior to that produced from the one-stage approach in terms of net present value. The main point from this analysis is that heuristic techniques may benefit from guidance provided by relaxed LP solutions in their effort to develop efficient forest management plans, particularly when both commodity production and complex spatial wildlife habitat goals are considered. Differences in the production of forest products were apparent between the two modeling approaches, which could have a significant effect on the selection of wood processing equipment and facilities.

Boston, Forest Fibre Solutions, Carter Holt Harvey, Tokoroa, New Zealand E-mail: kevin.boston@chh.co.nz
Bettinger, Department of Forest Resources, Oregon State University, Corvallis, OR 97331 E-mail: pb@nn.us

Click this link to register to Silva Fennica.

If you are a registered user, log in to save your selected articles for later access.

Contents alert

Your selected articles

Follow @SilvaFennica