FORS 8450 Advanced Forest Planning Lecture 21 Binary Search.

Slides:



Advertisements
Similar presentations
An Example of Quant’s Task in Croatian Banking Industry
Advertisements

FORS 8450 Advanced Forest Planning Lecture 4 Extensions to Linear Programming.
Chapter McGraw-Hill/Irwin Copyright © 2006 by The McGraw-Hill Companies, Inc. All rights reserved. 9 Net Present Value and Other Investment Criteria.
McGraw-Hill/Irwin Copyright © 2008 by The McGraw-Hill Companies, Inc. All rights reserved. 9 Net Present Value and Other Investment Criteria.
Chapter McGraw-Hill Ryerson © 2013 McGraw-Hill Ryerson Limited 9 Prepared by Anne Inglis Net Present Value and Other Investment Criteria.
McGraw-Hill/Irwin ©2001 The McGraw-Hill Companies All Rights Reserved 8.0 Chapter 8 Net Present Value and Other Investment Criteria.
McGraw-Hill/Irwin Copyright © 2008 by The McGraw-Hill Companies, Inc. All rights reserved. 9 Net Present Value and Other Investment Criteria.
McGraw-Hill © 2004 The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin Net Present Value and Other Investment Criteria Chapter 8.
0 Net Present Value and Other Investment Criteria.
Timber Management Elements of Forestry Kenneth Williams
1.Area regulation 2.Volume regulation 3.Structural regulation Approaches to regulation in the selection method and maintaining a balanced stand with sustainable.
Optimal Rotation Optimal Rotation.
Chapter 8 Net Present Value and Other Investment Criteria 0.
© 2003 The McGraw-Hill Companies, Inc. All rights reserved. Net Present Value and Other Investment Criteria Chapter 9.
FORS 8450 Advanced Forest Planning Lecture 12 Tabu Search Change in the Value of a Medium-Sized Forest when Considering Spatial Harvest Scheduling Constraints.
Example 14.3 Football Production at the Pigskin Company
Planning under Uncertainty
Search and Recursion CS221 – 2/23/09. List Search Algorithms Linear Search: Simple search through unsorted data. Time complexity = O(n) Binary Search:
MAE 552 – Heuristic Optimization Lecture 6 February 6, 2002.
Consider the following one-year investment. An amount X is invested in a fund at the beginning of the year. In six months, the fund is worth X/2 at which.
Capital Budgeting Chapter 9 © 2003 South-Western/Thomson Learning.
This material in not in your text (except as exercises) Sequence Comparisons –Problems in molecular biology involve finding the minimum number of edit.
1 1 Slide Chapter 14: Goal Programming Goal programming is used to solve linear programs with multiple objectives, with each objective viewed as a "goal".
What Do You See? Message of the Day: The management objective determines whether a site is over, under, or fully stocked.
Universität Dortmund  P. Marwedel, Univ. Dortmund, Informatik 12, 2003 Hardware/software partitioning  Functionality to be implemented in software.
Uneven-aged Management II. Lecture 10 (5/4/2015).
FORS 4710 / 6710 Forest Planning FORS 8450 Advanced Forest Planning Lecture 2 Linear Programming.
Modeling Non-Timber Objectives in Harvest Scheduling with Linear Programming Lecture 4 (4/8/2014)
Good Decision Criteria
456/556 Introduction to Operations Research Optimization with the Excel 2007 Solver.
Overview of Financial Analysis
Chapter 13 Recursion. Topics Simple Recursion Recursion with a Return Value Recursion with Two Base Cases Binary Search Revisited Animation Using Recursion.
Forest Regulation Concepts
Estimating impact of potential regulatory constrains on future wood supply in Georgia based on diverse sources of data Michal Zasada 1,2, Chris J. Cieszewski.
Types of IP Models All-integer linear programs Mixed integer linear programs (MILP) Binary integer linear programs, mixed or all integer: some or all of.
Bill Payment Optimization Algorithms. Purpose To find and/or construct algorithms that will optimize the decision process of paying bills from an account.
+ Simulation Design. + Types event-advance and unit-time advance. Both these designs are event-based but utilize different ways of advancing the time.
Applied Quantitative Analysis and Practices
Retirement Income Need: How Much Is Enough? George K. Chamberlin, JD Vice President – Financial Strategies F I N A N C E W A R E ®
CSC 211 Data Structures Lecture 13
Goal Seek and Solver. Goal seeking helps you n Find a specific value for a target cell by adjusting the value of one other cell whose value is allowed.
1 DSCI 3870 Case 3: SOME HELP Dr. Nick Evangelopoulos SPRING 2010.
FORS 8450 Advanced Forest Planning Lecture 11 Tabu Search.
Growth and Yield Lecture 6 (04/17/2015). Overview   Review of stand characteristics that affect growth   Basic Stand Growth Terminology Yield curve;
1 Section 2.1 Algorithms. 2 Algorithm A finite set of precise instructions for performing a computation or for solving a problem.
FORS 8450 Advanced Forest Planning Lecture 5 Relatively Straightforward Stochastic Approach.
Forest Management with Linear Programming Lecture 3 (4/6/2015)
COSC 2007 Data Structures II Chapter 13 Advanced Implementation of Tables IV.
FORS 8450 Advanced Forest Planning Lecture 6 Threshold Accepting.
Chapter 9 Sorting. The efficiency of data handling can often be increased if the data are sorted according to some criteria of order. The first step is.
1. Searching The basic characteristics of any searching algorithm is that searching should be efficient, it should have less number of computations involved.
Production Scheduling Lorena Kawas lk2551 Raul Galindo rg2802.
Spatial Forest Planning with Integer Programming Lecture 10 (5/4/2015)
Section VI Capital Rationing. Section Highlights F Capital rationing F Linear programming F Shadow prices and the cost of capital F Integer programming.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 14 Sensitivity Analysis.
CS 116 Object Oriented Programming II Lecture 13 Acknowledgement: Contains materials provided by George Koutsogiannakis and Matt Bauer.
GROWTH AND YIELD How will my forest grow? Dr. Glenn Glover School of Forestry & Wildlife Sciences Auburn University.
Mitigating Projected Timber Supply Declines
A Multiperiod Production Problem
OBJECT ORIENTED PROGRAMMING II LECTURE 23 GEORGE KOUTSOGIANNAKIS
Uneven-aged Management II.
Approaches to regulation in the selection method and maintaining a balanced stand with sustainable yield Area regulation Volume regulation Structural regulation.
Spatial Forest Planning with Integer Programming
Modeling Non-Timber Objectives in Harvest Scheduling with Linear Programming Lecture 14 (5/18/2017)
Modeling Non-Timber Objectives in Harvest Scheduling with Linear Programming Lecture 5 (4/19/2017)
Modeling Non-Timber Objectives in Harvest Scheduling with Linear Programming Lecture 14 (5/23/2016)
Forest Management with Linear Programming
The Alpha-Beta Procedure
L3 Desired Forest —Conceptual Goal Approaches to Regulate
Presentation transcript:

FORS 8450 Advanced Forest Planning Lecture 21 Binary Search

Binary Search Allows one to find the maximum even-flow of volume or value that can be sustained over a planning horizon, given certain constraints. Used in conjunction with the appropriate forest inventory and growth and yield estimates. A process that attempts to find a solution to a problem by making progressively better guesses at the optimal value of the objective function. A simulation technique. FORS 4710 / 6710 Forest Planning

Fun Example FORS 4710 / 6710 Forest Planning

Binary Search Pick a number between 1 and I can tell you what it is in less than 11 guesses if you tell me whether my guess is higher or lower than your number. FORS 4710 / 6710 Forest Planning

Binary Search Process: 1) Set a target value 2) Determine the range of potential solution values in an ordered list 3) Select the mid-point of the ordered list 4) Compare the solution at the mid-point to the target 5) Make a decision a) increase the target b) decrease the target c) stop and report a solution 6) Return to Step 1 if necessary FORS 4710 / 6710 Forest Planning

Finance Example FORS 4710 / 6710 Forest Planning

Binary Search You have $1,000 in the bank, earning 3% interest. You want to withdraw, at the end of each of three years, the same amount of money. What do you decide to do ? FORS 4710 / 6710 Forest Planning

Binary Search Start with 1/3 of what might be in the account at the end of the first year: What will be there at the end of the first year? $1, One third of that? $ If this estimate leaves a surplus, increase it by $20. If this estimate leaves a deficit, decrease it by $10 (1/2 of the increase). FORS 4710 / 6710 Forest Planning

Binary Search You have $1,000 in the bank, earning 3% interest. You want to withdraw, at the end of each of three years, the same amount of money. First attempt: Beginning of year 1 balance End of year 1 balance End of year 1 withdrawal Beginning of year 2 balance End of year 2 balance End of year 2 withdrawal Beginning of year 3 balance End of year 3 balance End of year 3 withdrawal Surplus or deficit $1, , (1/3 of 1,030.00) FORS 4710 / 6710 Forest Planning

Binary Search You have $1,000 in the bank, earning 3% interest. You want to withdraw, at the end of each of three years, the same amount of money. Second attempt: Beginning of year 1 balance End of year 1 balance End of year 1 withdrawal Beginning of year 2 balance End of year 2 balance End of year 2 withdrawal Beginning of year 3 balance End of year 3 balance End of year 3 withdrawal Surplus or deficit $1, , (1/3 of 1, $20) FORS 4710 / 6710 Forest Planning

Binary Search You have $1,000 in the bank, earning 3% interest. You want to withdraw, at the end of each of three years, the same amount of money. Third attempt: Beginning of year 1 balance End of year 1 balance End of year 1 withdrawal Beginning of year 2 balance End of year 2 balance End of year 2 withdrawal Beginning of year 3 balance End of year 3 balance End of year 3 withdrawal Surplus or deficit $1, , (1/3 of 1, $10) FORS 4710 / 6710 Forest Planning

Binary Search Why is this "even-flow" situation such a problem? FORS 4710 / 6710 Forest Planning

Binary Search in Forest Planning In forest planning, a binary search process that uses a simple harvest volume target and either stand-level volumes or strata-based volumes is relatively easy to perform. This type of planning model can be implemented within a spreadsheet environment if the attributes of the stands or strata that contribute to the objective function are available. Sorting the list and selecting the stands or strata for harvest is relatively straight-forward. This assumes that stands or strata can be assigned fractional values related to the harvesting decision, thus some are scheduled for harvest during more than one time period. When stands need to be modeled using integer decision variables, and when the adjacency of harvests must be recognized and accommodated, the use of binary search becomes more complex... FORS 4710 / 6710 Forest Planning

Binary Search in Forest Planning Binary search has traditionally been used to determine the highest timber volume that can be produced over the assumed time horizon. Caveats: 1. Since an individual stand will likely not produce as much volume as is necessary to achieve the highest even volume from a forest, stand-level harvest decisions are aggregated. It may take harvesting several stands in each year to produce the harvest level necessary. 2. The scheduling of individual stands begins with the first time period. Harvests are scheduled until the last one exceeds the harvest target for the year. Subsequently, harvests for the next time period are scheduled. This process continues until harvests have been scheduled for each time period, or we run out of harvesting options because no other stands are old enough, for example, to harvest. 3. The selection of harvest units is from a sorted list of harvesting options. What are the sorting rules? FORS 4710 / 6710 Forest Planning

Binary Search in Forest Planning Process: 1) Select a target harvest volume 2) Select an increment for the harvest volume 3) Schedule stands until the target has been reached in a time period 4) Move to the next time period and continue scheduling all time periods 5) Assess the solution. Was the target reached in all time periods? 6) Make a decision a) increase the target b) decrease the target c) stop and report a solution 7) Return to Step 1 if necessary FORS 4710 / 6710 Forest Planning

Binary Search in Forest Planning Definitions: Target harvest level: The level of harvest volume you expect to obtain each time period within the planning horizon. Step size: How much the target harvest volume will change with each iteration of a binary search model. Iteration: One complete schedule of activities for the entire planning horizon. Stopping rule: Stop the scheduling process when the step size is at least this "small." FORS 4710 / 6710 Forest Planning

Forestry Example FORS 4710 / 6710 Forest Planning

Timber yields AgeYield (ft 3 / acre) 201, , , , , , ,560 Binary Search Example Loblolly pine forest 30-year rotation is desired Site index acres Current age class structure: 20 acres of 55-year old loblolly pine 10 acres of 15-year old loblolly pine Planning assumptions: Plan in 10-year increments (10-year time periods) Develop a plan for 6 time periods Assume harvesting occurs in the middle of each time period Binary Search Assumptions: Target harvest level 40,000 ft 3 per time period Step size 5,000 ft 3 Harvest oldest aged timber first. FORS 4710 / 6710 Forest Planning

Binary Search Example - Iteration #1, Time Period 1 Middle of time period 1 (5 years from now) Age class structure before harvest 20 acres of 60-year old loblolly pine 10 acres of 20-year old loblolly pine AgeAcres Volume per acre (ft 3 ) Total volume (ft 3 ) ,070 1, ,400 17,500 Harvest acres Harvest volume (ft 3 ) ,000 0 Before harvest FORS 4710 / 6710 Forest Planning

Binary Search Example - Iteration #1, Time Period 2 Middle of time period 2 (15 years from now) Age class structure before harvest acres of 70-year old loblolly pine 10 acres of 30-year old loblolly pine 7.89 acres of 10-year old loblolly pine AgeAcres Volume per acre (ft 3 ) Total volume (ft 3 ) ,330 3, ,546 34,400 0 Harvest acres Harvest volume (ft 3 ) ,000 0 Before harvest FORS 4710 / 6710 Forest Planning

Binary Search Example - Iteration #1, Time Period 3 Middle of time period 3 (25 years from now) Age class structure before harvest 4.61 acres of 80-year old loblolly pine 10 acres of 40-year old loblolly pine 7.89 acres of 20-year old loblolly pine 7.50 acres of 10-year old loblolly pine AgeAcres Volume per acre (ft 3 ) Total volume (ft 3 ) ,560 4,290 1, ,632 42,900 13,808 0 Harvest acres Harvest volume (ft 3 ) ,632 14,638 0 Before harvest FORS 4710 / 6710 Forest Planning

Binary Search Example - Iteration #1, Time Period 4 Middle of time period 4 (35 years from now) Age class structure before harvest 6.65 acres of 50-year old loblolly pine 7.89 acres of 30-year old loblolly pine 7.50 acres of 20-year old loblolly pine 7.96 acres of 10-year old loblolly pine AgeAcres Volume per acre (ft 3 ) Total volume (ft 3 ) ,740 3,440 1, ,521 27,142 13,125 0 Harvest acres Harvest volume (ft 3 ) ,521 8,479 0 Before harvest FORS 4710 / 6710 Forest Planning

Binary Search Example - Iteration #1, Time Period 5 Middle of time period 5 (45 years from now) Age class structure before harvest 5.43 acres of 40-year old loblolly pine 7.50 acres of 30-year old loblolly pine 7.96 acres of 20-year old loblolly pine 9.11 acres of 10-year old loblolly pine AgeAcres Volume per acre (ft 3 ) Total volume (ft 3 ) ,290 3,440 1, ,295 25,800 13,930 0 Harvest acres Harvest volume (ft 3 ) ,295 16,705 0 Before harvest FORS 4710 / 6710 Forest Planning

Binary Search Example - Iteration #1, Time Period 6 Middle of time period 6 (55 years from now) Age class structure before harvest 2.64 acres of 40-year old loblolly pine 7.96 acres of 30-year old loblolly pine 9.11 acres of 20-year old loblolly pine acres of 10-year old loblolly pine AgeAcres Volume per acre (ft 3 ) Total volume (ft 3 ) ,290 3,440 1, ,326 27,382 15,943 0 Harvest acres Harvest volume (ft 3 ) ,326 27,382 1,292 0 Before harvest FORS 4710 / 6710 Forest Planning

Binary Search Example - Iteration #1, Summary Time period Acres cut ,000 Volume target was achieved each time period. Since we did not specify any ending inventory condition, we increase the volume target and try again. Volume target for iteration 2 is 45,000 ft 3 per time period. Decision and Actions: Volume target met Increase Target Volume Try again Planned harvest volume (ft 3 ) FORS 4710 / 6710 Forest Planning

Binary Search Example - Iteration #2, Time Period 1 Middle of time period 1 (5 years from now) Age class structure before harvest 20 acres of 60-year old loblolly pine 10 acres of 20-year old loblolly pine AgeAcres Volume per acre (ft 3 ) Total volume (ft 3 ) ,070 1, ,400 17,500 Harvest acres Harvest volume (ft 3 ) ,000 0 Before harvest FORS 4710 / 6710 Forest Planning

Binary Search Example - Iteration #2, Time Period 2 Middle of time period 2 (15 years from now) Age class structure before harvest acres of 70-year old loblolly pine 10 acres of 30-year old loblolly pine 8.88 acres of 10-year old loblolly pine AgeAcres Volume per acre (ft 3 ) Total volume (ft 3 ) ,330 3, ,270 42,900 0 Harvest acres Harvest volume (ft 3 ) ,000 0 Before harvest FORS 4710 / 6710 Forest Planning

Binary Search Example - Iteration #2, Time Period 3 Middle of time period 3 (25 years from now) Age class structure before harvest 2.68 acres of 80-year old loblolly pine 10 acres of 40-year old loblolly pine 8.88 acres of 20-year old loblolly pine 8.44 acres of 10-year old loblolly pine AgeAcres Volume per acre (ft 3 ) Total volume (ft 3 ) ,560 4,290 1, ,901 42,900 15,540 0 Harvest acres Harvest volume (ft 3 ) ,901 30,099 0 Before harvest FORS 4710 / 6710 Forest Planning

Binary Search Example - Iteration #2, Time Period 4 Middle of time period 4 (35 years from now) Age class structure before harvest 2.98 acres of 50-year old loblolly pine 8.88 acres of 30-year old loblolly pine 8.44 acres of 20-year old loblolly pine 9.70 acres of 10-year old loblolly pine AgeAcres Volume per acre (ft 3 ) Total volume (ft 3 ) ,740 3,440 1, ,125 30,547 14,770 0 Harvest acres Harvest volume (ft 3 ) ,125 30, Before harvest FORS 4710 / 6710 Forest Planning

Binary Search Example - Iteration #2, Time Period 5 Middle of time period 5 (45 years from now) Age class structure before harvest 8.25 acres of 30-year old loblolly pine 9.70 acres of 20-year old loblolly pine acres of 10-year old loblolly pine AgeAcres Volume per acre (ft 3 ) Total volume (ft 3 ) ,440 1, ,380 16,975 0 Harvest acres Harvest volume (ft 3 ) ,380 16,620 0 Before harvest FORS 4710 / 6710 Forest Planning

Binary Search Example - Iteration #2, Time Period 6 Middle of time period 6 (55 years from now) Age class structure before harvest 0.20 acres of 30-year old loblolly pine acres of 20-year old loblolly pine acres of 10-year old loblolly pine AgeAcres Volume per acre (ft 3 ) Total volume (ft 3 ) ,440 1, ,088 0 Harvest acres Harvest volume (ft 3 ) ,088 0 Before harvest FORS 4710 / 6710 Forest Planning

Binary Search Example - Iteration #2, Summary Time period Acres cut Planned harvest volume (ft 3 ) ,000 21,776 Volume target was NOT achieved in time period 6. We reduce the Step Size by (0.5 x Step Size), to 2,500 ft 3 then decrease the volume target by the Step Size, and try again. Volume target for iteration 3 is 42,500 ft 3 per time period. Decision and Actions: Volume target not met Reduce Step Size Reduce Target Volume Try again FORS 4710 / 6710 Forest Planning

Binary Search Example Iteration Target volume (ft 3 ) Step Size (ft 3 ) Planned harvest volume (ft 3 ) ,0005,00040,00040,00040,00040,00040,00040, ,0005,00045,00045,00045,00045,00045,00021, ,5002,50042,50042,50042,50042,50042,50038, ,2501,25041,25041,25041,25041,25041,25041, , ,87541,87541,87541,87541,87541, , ,18842,18842,18842,18842,18842, , ,34442,34442,34442,34442,34442,344 FORS 4710 / 6710 Forest Planning

Summary of binary search  Can provide a quick estimate of the planned harvest level for an unmanaged forest  Can allow you to assess whether the planned harvest level can be maintained through time  No control over how much area is planned to be harvested  Difficult to determine whether one is moving a forest toward a regulated state  There is generally no objective other than to achieve some level of volume harvested over time FORS 4710 / 6710 Forest Planning