liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
An optimization model for annual harvest planning
Linköping University, Department of Mathematics. Linköping University, The Institute of Technology.
Linköping University, Department of Mathematics. Linköping University, The Institute of Technology.
Forest Research Institute of Sweden, Uppsala Science Park, Uppsala, Sweden.
2004 (English)In: Canadian Journal of Forest Research, ISSN 0045-5067, E-ISSN 1208-6037, Vol. 34, no 8, 1747-1754 p.Article in journal (Refereed) Published
Abstract [en]

The problem we consider is annual harvesting planning from the perspective of Swedish forest companies. The main decisions deal with which areas to harvest during an annual period so that the wood-processing facilities receive the required amount of assortments. Each area has a specific size and composition of assortments, and the choice of harvesting areas affects the production level of different assortments. We need to decide which harvest team to use for each area, considering that each team has different skills, home base, and production capacities. Also, the weather and road conditions vary during the year. Some roads cannot be used during certain time periods and others should be avoided. The road maintenance cost varies during the year. Also, some areas cannot be harvested during certain periods. Overall decisions about transportation and storage are also included. In this paper, we develop a mixed integer programming model for the problem. There are binary variables associated with harvesting, allocation of teams, and road-opening decisions. The other decisions are represented by continuous variables. We solve this problem directly with CPLEX 8.1 within a practical solution time limit. Computational results from a major Swedish forest company are presented.

Place, publisher, year, edition, pages
2004. Vol. 34, no 8, 1747-1754 p.
National Category
Mathematics
Identifiers
URN: urn:nbn:se:liu:diva-22745DOI: 10.1139/X04-043Local ID: 2059OAI: oai:DiVA.org:liu-22745DiVA: diva2:243058
Available from: 2009-10-07 Created: 2009-10-07 Last updated: 2017-12-13
In thesis
1. Optimization models and methods for harvest planning and forest road upgrading
Open this publication in new window or tab >>Optimization models and methods for harvest planning and forest road upgrading
2005 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

The purpose of this thesis is to contribute to the development and the use of optimization models and methods to support efficient decision making in Swedish forestry. The main problem areas concerned are forest road upgrade planning and operational harvest planning. Today much of the planning is done manually by experienced managers. Forest management has a natural hierarchical structure based on the wide range of planning periods and organisational structure. The hierarchical harvest planning and the subdivision into strategic, tactical and operational levels are described from an Operations Research perspective. The description of the hierarchical structure differs between countries and there is a focus on the Swedish situation.

Road upgrading is becoming an increasingly important planning problem to secure a continuous supply of wood. In Sweden, during the periods of thawing and periods of heavy rain there is an uncertain accessibility to parts of the road network due to unfirm ground. The thesis addresses the optimization problem to minimize the combined road upgrade and transportation costs while meeting requirements on road standard such that accessibility to harvest areas is secured during all weather conditions. In this work mixed integer linear programming (MILP) models including multiple assortments, several time periods and a set of road classes are developed. For a typical forest district, the road upgrade problem becomes large and techniques to improve solution performance through model reformulations are discussed. The models are tested in a case study for a major Swedish company. For practical usage of the models we present the development of a new decision support system called RoadOpt. The development has involved the Forestry Research Institute of Sweden, two software companies and several participating forest companies. The system uses a GIS-based map user-interface to present and analyse data and results. The recently developed Swedish road database is an important part. The system is tested on a case study from Stora Enso.

The harvest planning problems addressed cover planning periods ranging from one year down to one month. Annual plans are required for budgeting, contracting harvest teams, contracting transportation firms and assuring road access. The main decisions deal with which areas to harvest, and by which team, during an annual period so that the industries receive the required volume of assortments. Overall decisions about transportation and storage are included. The monthly planning problem includes detailed scheduling of harvest crews, that is, the sequencing of areas for each team. The thesis addresses these planning problems and provides MILP models for each problem. Methods based on both a commercial solver and developed LP based heuristics are used. Models and methods are tested on case studies from Holmen Skog.

Place, publisher, year, edition, pages
Linköping: Linköping University Electronic Press, 2005. 6 p.
Series
Linköping Studies in Science and Technology. Dissertations, ISSN 0345-7524 ; 956
National Category
Mathematics
Identifiers
urn:nbn:se:liu:diva-28705 (URN)13869 (Local ID)91-85299-72-3 (ISBN)13869 (Archive number)13869 (OAI)
Public defence
2005-06-10, Glashuset, Hus B, Campus Valla, Linköpings Universitet, Linköping, 10:15 (English)
Opponent
Available from: 2009-10-09 Created: 2009-10-09 Last updated: 2012-12-10Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Authority records BETA

Karlsson, JennyRönnqvist, Mikael

Search in DiVA

By author/editor
Karlsson, JennyRönnqvist, Mikael
By organisation
Department of MathematicsThe Institute of Technology
In the same journal
Canadian Journal of Forest Research
Mathematics

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 737 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf