1 Stochastic Dynamic Optimization of Forest Industry Company Management INFORMS International Meeting 2007 Puerto Rico Peter Lohmander Professor SLU Umea,

Slides:



Advertisements
Similar presentations
Chapter 8: The Solver and Mathematical Programming Spreadsheet-Based Decision Support Systems Prof. Name Position (123) University.
Advertisements

Optimization problems using excel solver
Chapter 19 – Linear Programming
LINEAR PROGRAMMING (LP)
Introduction to Mathematical Programming Matthew J. Liberatore John F. Connelly Chair in Management Professor, Decision and Information Technologies.
Linear programming: lp_solve, max flow, dual CSC 282 Fall 2013.
SCIP Optimization Suite
1 Optimal CCS, Carbon Capture and Storage, Under Risk International Seminars in Life Sciences Universidad Politécnica de Valencia Thursday Updated.
Session II – Introduction to Linear Programming
Operations Management Linear Programming Module B - Part 2
Linear Programming Using the Excel Solver
McGraw-Hill/Irwin © The McGraw-Hill Companies, Inc., Three Classic Applications of LP Product Mix at Ponderosa Industrial –Considered limited.
Tools for optimal coordination of CCS, power industry capacity expansion and bio energy raw material production and harvesting Peter Lohmander Prof. Dr.
1 Dynamic Economical Optimization of Sustainable Forest Harvesting in Russia with Consideration of Energy, other Forest Products and Recreation Peter Lohmander.
OPTIMAL PRESENT RESOURCE EXTRACTION UNDER THE INFLUENCE OF FUTURE RISK Professor Dr Peter Lohmander SLU, Sweden,
Optimization of production planning in fish farming Páll Jensson University of Iceland Presented at IFORS 2002 in Edinbourgh.
Supply Chain Design Problem Tuukka Puranen Postgraduate Seminar in Information Technology Wednesday, March 26, 2009.
Optimal stock and purchase policy with stochastic external deliveries in different markets 12th Symposium for Systems Analysis in Forest Resources, Burlington,
Computational Methods for Management and Economics Carla Gomes Module 4 Displaying and Solving LP Models on a Spreadsheet.
1 Capacity Planning under Uncertainty Capacity Planning under Uncertainty CHE: 5480 Economic Decision Making in the Process Industry Prof. Miguel Bagajewicz.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 1 Introduction to Operations Research.
Product Mix Problem Monet company makes four types of frames.
The importance of Gross margin Example 1: Sales price ok, sales volume ok compared to the size of the company: Sales income100 units x
Decision Making via Linear Programming: A simple introduction Fred Phillips
1 A Stochastic Differential (Difference) Game Model With an LP Subroutine for Mixed and Pure Strategy Optimization INFORMS International Meeting 2007,
Industry, employment, economics and trade theory with focus on the forest sector Peter Lohmander
Optimal continuous cover forest management: - Economic and environmental effects and legal considerations Professor Dr Peter Lohmander
1 DSCI 3023 Linear Programming Developed by Dantzig in the late 1940’s A mathematical method of allocating scarce resources to achieve a single objective.
1 CM Optimal Resource Control Model & General continuous time optimal control model of a forest resource, comparative dynamics and CO2 storage consideration.
Introduction to Linear Programming BSAD 141 Dave Novak.
1 Optimal Forest Management Under Risk International Seminars in Life Sciences Universidad Politécnica de Valencia Thursday Peter Lohmander.
1 Systems Analysis Methods Dr. Jerrell T. Stracener, SAE Fellow SMU EMIS 5300/7300 NTU SY-521-N NTU SY-521-N SMU EMIS 5300/7300 Statistical Analysis Other.
Linear Programming with Excel Solver.  Use Excel’s Solver as a tool to assist the decision maker in identifying the optimal solution for a business decision.
1 Some new equations presented at NCSU Peter Lohmander.
1 Optimal dynamic control of the forest resource with changing energy demand functions and valuation of CO2 storage Presentation at the Conference: The.
SUPPLY CHAIN OPTIMIZATION IN THE MULTIPURPOSE BATCHT CHEMICAL INDUSTRY concept and software Kiril Mintchev PhD
Chapter 24 – Multicriteria Capital Budgeting and Linear Programming u Linear programming is a mathematical procedure, usually carried out by computer software,
Contents Introduction Aggregate planning problem
作業研究(二) Operations Research II - 廖經芳 、 王敏. Topics - Revised Simplex Method - Duality Theory - Sensitivity Analysis and Parametric Linear Programming -
1 A Linear Programming model seeks to maximize or minimize a linear function, subject to a set of linear constraints. The linear model consists of the.
1 Optimal activities over time in a typical forest industry company in the presence of stochastic markets - A flexible approach and possible extensions!
Intelligent Supply Chain Management Strategic Supply Chain Management
Optimal continuous natural resource extraction with increasing risk in prices and stock dynamics Professor Dr Peter Lohmander
DEPARTMENT/SEMESTER ME VII Sem COURSE NAME Operation Research Manav Rachna College of Engg.
Introduction to Quantitative Business Methods (Do I REALLY Have to Know This Stuff?)
Linear Programming Wyndor Glass Co. 3 plants 2 new products –Product 1: glass door with aluminum framing –Product 2: 4x6 foot wood frame window.
Million tonnes Consumption Collection Imports Exports Consumption, collection, imports and exports of recovered paper in Sweden 0 0,5 1,0 1,5 2,
Optimal adaptive stochastic control of large scale energy production under the influence of market risk Version Peter Lohmander Professor Dr., Optimal.
Operations Research.  Operations Research (OR) aims to having the optimization solution for some administrative problems, such as transportation, decision-making,
Forests of the World: 4 Billion Hectares 2010 Africa 17% 674 Million Hectares Asia 15% 593 Million Hectares Oceania 5% 191 Million Hectares Europe 25%
Million Tonnes Paper Production and Deliveries. Million Tonnes Market Pulp Production and Deliveries.
Optimization of adaptive control functions in multidimensional forest management via stochastic simulation and grid search Version Peter Lohmander.
World Leading Exporters 2014 Pulp, Paper and Sawn Timber
OPTIMAL STOCHASTIC DYNAMIC CONTROL OF SPATIALLY DISTRIBUTED INTERDEPENDENT PRODUCTION UNITS Version Peter Lohmander Professor Dr., Optimal Solutions.
Paper Consumption in Sweden Source: Statistics Sweden, Swedish Forest Industries Federation Million Tonnes.
Supply Chain Management By Dr. Asif Mahmood Chapter 9: Aggregate Planning.
Excel’s Solver Use Excel’s Solver as a tool to assist the decision maker in identifying the optimal solution for a business decision. Business decisions.
Stochastic dynamic programming with Markov chains
Schlenker, H. , R. Kluge, and J. Koehl
Problem 1 Demand Total There are 20 full time employees, each can produce 10.
Linear Programming – A First Example
Linear Programming Wyndor Glass Co. 3 plants 2 new products
Chapter 8 Aggregate Planning in the Supply Chain
Max Z = x1 + x2 2 x1 + 3 x2  6 (1) x2  1.5 (2) x1 - x2  2 (3)
Lohmander, P., Adaptive Optimization of Forest
Linear Programming Example: Maximize x + y x and y are called
Optimal stochastic control in continuous time with Wiener processes: - General results and applications to optimal wildlife management KEYNOTE Version.
Optimal Electricity Supply Bidding by Markov Decision Process
Stock Market Stage Analysis.
Lectures, Visit and Mountain Excursion at Shandong Agricultural University Peter Lohmander Professor of Forest Management and Economic Optimization, SLU,
Presentation transcript:

1 Stochastic Dynamic Optimization of Forest Industry Company Management INFORMS International Meeting 2007 Puerto Rico Peter Lohmander Professor SLU Umea, SE , Sweden, Version

2 Abstract Forest industry production, capacity and harvest levels are optimized. Adaptive full system optimization is necessary for consistent results. The stochastic dynamic programming problem of a complete forest industry company is solved. The raw material stock level and the main product prices are state variables. In each state and at each stage, a linear programming profit maximization problem of the forest company is solved. Parameters from the Swedish forest industry are used as illustration.

3 Question How should these activities in a typical forest industry company be optimized and coordinated in the presence of stochastic markets? *Pulp, paper and liner production and sales, *Sawn wood production and sales, *Raw material procurement and sales, *Harvest operations *Transport

4 Approach in three stages A typical forest industry company is defined using real mills and forest conditions in the North of Sweden. For each year (or other period) and possible price and stock state, the variable company profit is maximized using linear programming. (Quadratic programming etc. are other options.) The expected present value of the company over an infinite horizon is maximized via stochastic dynamic programming in Markov chains. In this stage, a standard LP solver is used.

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42 Optimization of the variable profit during a year: Linear programming code Background:

43 ! SMB2; ! Peter Lohmander ; Max = TProf; TProf = - InkK - IntKostn + ForsI; InkK = PKTi*KTimmer + PKMav*KMav + PKFlis*KFlis + PReturpL*KReturpl + PReturpI*KReturpI; IntKostn = AvvK*Avv + TPKostTI*ETimmer + TPKostMA*EMav + CSV*ProdSV + CLiner*ProdLin; ForsI = PSV*ProdSV + PLiner*ProdLin + PSTi*STimmer + PSMav*SMav + PSFlis*SFlis; !Market prices of raw material and raw material constraints; PKTi = 380; PSTi = 330; PKMav = 200; PSMav = 120; PKFlis = 250; PSFlis = 150; PReturpL = 50; PReturpI = 730; [LRetP] KReturpL <= 100;

44 !SMBs forest and harvesting; AvvK = 70; AvvKap = 570; TimAndel =.5; [KapAvv] Avv <= AvvKap; !Roundwood transport costs; TPKostTI = 60; TPKostMa = 70; !SMBs saw mill; PSV = 1500; CSV = 300; SVKap = 80; TTimmer = ETimmer + KTimmer; ProdSV =.5*TTimmer; ProdFl =.8*ProdSV; ProdSp =.2*ProdSV; [KapSV] ProdSV <= SVKap;

45 !SMBs raw material balance; EMav = (1-TimAndel)* Avv - SMav; ETimmer = Timandel*Avv - STimmer; EFlis = ProdFl - SFlis; !SMBs liner mill; PLiner = 4900; CLiner = 1200; LinerKap = 400; TRetP = KReturpL + KReturpI; TFiber = EMav + EFlis + KMav + KFlis; ProdLin =.25*TFiber +.95*TRetP; [FFiberK] TFiber/TRetP >= 4; [KapLiner] ProdLin <= LinerKap; end

46 Optimization of the variable profit during a year: Optimal results

47 Local optimal solution found at step: 10 Objective value: Variable Value Reduced Cost TPROF INKK INTKOSTN FORSI PKTI KTIMMER PKMAV KMAV PKFLIS KFLIS PRETURPL KRETURPL PRETURPI KRETURPI AVVK AVV

48 TPKOSTTI ETIMMER TPKOSTMA EMAV CSV PRODSV CLINER PRODLIN PSV PLINER PSTI STIMMER PSMAV SMAV PSFLIS SFLIS AVVKAP TIMANDEL SVKAP

49 TTIMMER PRODFL PRODSP EFLIS LINERKAP TRETP TFIBER

50 Row Slack or Surplus Dual Price LRETP KAPAVV KAPSV FFIBERK E KAPLINER

51 ”Single period results” In the ”single period optimization model”, you should always harvest all available stands and produce at full capacity utilization in the saw mill and the liner mill.

52 ”Stochastic multi period questions”: Maybe you should, under some market conditions, save some harvest areas for future periods? Maybe also the other decisions in the company are different when we consider many periods and stochastic markets?

53 Optimal variable profit (KSEK/Year) as a function of * stock level * harvest level * price of external pulpwood (PWP) * price of imported waste paper (IWPP):

54 s=1s= m PWP (SEK/ton) hm IWPP (SEK/ton)

55 s= m PWP (SEK/ ton) hm IWPP (SEK/ ton)

56 s= m PWP (SEK/ ton) hm IWPP (SEK/ ton)

57 Optimization of the expected present value of the company during over an infinite horizon: Linear programming in a Markov chain

58 The optimization problem at a general level We want to maximize the expected present value of the profit, all revenues minus costs, over an infinite horizon. This is solved via stochastic dynamic programming. Compare Howard (1960), Wagner (1975), Ross (1983) and Winston (2004).

59

60

61 Min Z = s.t.

62

63

64 Min Z = s.t.

65 Optimal dynamic analysis r = 5% ! Puerto_ _2010 HRS; ! Peter Lohmander; Model: sets: stock/1..3/:; market/1..9/:p1,p2; sm(stock,market):f; mark2(market,market):TR; harv/1..5/:; shm(stock,harv,market):g; endsets

66 b = 1/1.05; Z sm(i,j):f(i,j)); min @for(harv(h)| (s+3-h) #GE#1 #AND# (s+3-h) #LE# 3 : [Dec] f(s,m) >= g(s,h,m) + )));

n #NE# 5 : TR(m,n) n #EQ# 5 : TR(m,n) =.6);

68 data: g =

; p1 = ; p2 = ; enddata end

71 Global optimal solution found at step: 94 Objective value: E+09

72 Variable Value Reduced Cost B Z E

73 F( 1, 1) E F( 1, 2) E F( 1, 3) E F( 1, 4) E F( 1, 5) E F( 1, 6) E F( 1, 7) E F( 1, 8) E F( 1, 9) E F( 2, 1) E F( 2, 2) E F( 2, 3) E F( 2, 4) E F( 2, 5) E F( 2, 6) E F( 2, 7) E F( 2, 8) E F( 2, 9) E F( 3, 1) E F( 3, 2) E F( 3, 3) E F( 3, 4) E F( 3, 5) E F( 3, 6) E F( 3, 7) E F( 3, 8) E F( 3, 9) E

74 F( 1, 5) E

75 F( 1, 5) E F( 2, 5) E F( 3, 5) E

76 DEC( 1, 1, 1) DEC( 1, 1, 2) DEC( 1, 1, 3) DEC( 1, 2, 1) DEC( 1, 2, 2) DEC( 1, 2, 3) DEC( 1, 3, 1) DEC( 1, 3, 2) DEC( 1, 3, 3) DEC( 1, 4, 1) DEC( 1, 4, 2) DEC( 1, 4, 3) DEC( 1, 5, 1) DEC( 1, 5, 2) DEC( 1, 5, 3) DEC( 1, 6, 1) DEC( 1, 6, 2) DEC( 1, 6, 3) DEC( 1, 7, 1) DEC( 1, 7, 2) DEC( 1, 7, 3) DEC( 1, 8, 1) DEC( 1, 8, 2) DEC( 1, 8, 3) DEC( 1, 9, 1) DEC( 1, 9, 2) DEC( 1, 9, 3)

77 DEC( 1, 5, 1) DEC( 1, 5, 2) DEC( 1, 5, 3)

78 DEC( 2, 1, 2) DEC( 2, 1, 3) DEC( 2, 1, 4) DEC( 2, 2, 2) DEC( 2, 2, 3) DEC( 2, 2, 4) DEC( 2, 3, 2) DEC( 2, 3, 3) DEC( 2, 3, 4) DEC( 2, 4, 2) DEC( 2, 4, 3) DEC( 2, 4, 4) DEC( 2, 5, 2) DEC( 2, 5, 3) DEC( 2, 5, 4) DEC( 2, 6, 2) DEC( 2, 6, 3) DEC( 2, 6, 4) DEC( 2, 7, 2) DEC( 2, 7, 3) DEC( 2, 7, 4) DEC( 2, 8, 2) DEC( 2, 8, 3) DEC( 2, 8, 4) DEC( 2, 9, 2) DEC( 2, 9, 3) DEC( 2, 9, 4)

79 DEC( 3, 1, 3) DEC( 3, 1, 4) DEC( 3, 1, 5) DEC( 3, 2, 3) DEC( 3, 2, 4) DEC( 3, 2, 5) DEC( 3, 3, 3) DEC( 3, 3, 4) DEC( 3, 3, 5) DEC( 3, 4, 3) DEC( 3, 4, 4) DEC( 3, 4, 5) DEC( 3, 5, 3) DEC( 3, 5, 4) DEC( 3, 5, 5) DEC( 3, 6, 3) DEC( 3, 6, 4) DEC( 3, 6, 5) DEC( 3, 7, 3) DEC( 3, 7, 4) DEC( 3, 7, 5) DEC( 3, 8, 3) DEC( 3, 8, 4) DEC( 3, 8, 5) DEC( 3, 9, 3) DEC( 3, 9, 4) DEC( 3, 9, 5)

80 Optimal harvest levels in the forest district when r = 2%, 5% or 10%

81 S = Entering stock level S=1 ( m3 or less may be harvested this year) PWP = 160PWP = 200PWP = 240 IWPP = m m3 IWPP = m m3 IWPP = m m3 Optimal harvest levels in the forest district when r = 2%, 5% or 10%

82 Optimal harvest levels in the forest district when r = 2%, 5% or 10% S=2 ( m3 or less may be harvested this year) PWP = 160PWP = 200PWP = 240 IWPP = m m3 IWPP = m m3 IWPP = m m3

83 Optimal harvest levels in the forest district when r = 2%, 5% or 10% S=3 ( m3 or less may be harvested this year) PWP = 160PWP = 200PWP = 240 IWPP = m m3 IWPP = m m3 IWPP = m m3

84 Optimal harvest levels in the forest district when r = 2%, 5% or 10%: Harvest approx cubic metres less than the maximum possible in case the pulp wood price is not at the highest level. Harvest as much as possible if the pulp wood price is at the highest level.

85 Let’s study the optimal decisions with changing pulp wood prices if the rate of interest is 10%!

86

87 Optimal harvest levels in the forest district when r = 15% (or higher)

88 S = Entering stock level S=1 ( m3 or less may be harvested this year) Optimal harvest levels in the forest district when r = 15% PWP = 160PWP = 200PWP = 240 IWPP = m3 IWPP = m3 IWPP = m3

89 Optimal harvest levels in the forest district when r = 15% S=2 ( m3 or less may be harvested this year) PWP = 160PWP = 200PWP = 240 IWPP = m3 IWPP = m3 IWPP = m3

90 Optimal harvest levels in the forest district when r = 15% S=3 ( m3 or less may be harvested this year) PWP = 160PWP = 200PWP = 240 IWPP = m3 IWPP = m3 IWPP = m3

91 Optimal harvest levels in the forest district when r = 15% (or higher): Harvest as much as possible for all possible pulp wood prices!

92 General results With this approach, all relevant decisions in the company can be consistently optimized. For instance, we find how the optimal harvest level is affected by the present price in the pulpwood market, the transition probability matrix of prices, the rate of interest, the volume of harvestable stands and all other company relevant conditions such as capacities in the sawmill, the liner mill, transport costs for different assortements on different roads etc..

93 Observation #1 All the sub problems (the optimization problems within each time period) may be solved with continuous or discrete variables via linear programming, quadratic programming or some other optimization method, taking all relevant constraints into consideration.

94 Observation #2 In the ”master problem” (the Markov chain problem over an infinite horizon), the state space is discrete. With standard software, this still makes it possible to use high resolution in the interesting dimensions. For instance, with ten possible stock levels, we may use four exogenous market prices (with ten possible levels in each dimension) and still have no more than variables. Such a problem can easily be solved.

95 Observation #3 This forest sector model can easily be modified and we can instantly calculate how the expected economic value of the company and the optimal decisions change. For instance, we may introduce ”possible” bioenergy power plants and new types of pulp and paper mills and instantly derive the optimal results.

96 Abstract Forest industry production, capacity and harvest levels are optimized. Adaptive full system optimization is necessary for consistent results. The stochastic dynamic programming problem of a complete forest industry company is solved. The raw material stock level and the main product prices are state variables. In each state and at each stage, a linear programming profit maximization problem of the forest company is solved. Parameters from the Swedish forest industry are used as illustration.

97

98 Contact: Peter Lohmander Professor SLU, Dept. of Forest Economics SE Umea, Sweden Personal home page: