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
Optimization models for forest road upgrade planning
Linköping University, Department of Mathematics, Optimization . Linköping University, The Institute of Technology.
Linköping University, Department of Mathematics, Optimization . Linköping University, The Institute of Technology.
Department of Finance and Management Science, Norwegian School of Economics and Business Administration, Bergen, Norway.
2007 (English)In: Journal of Mathematical Modelling and Algorithms, ISSN 1570-1166, E-ISSN 1572-9214, Vol. 6, no 1, 3-23 p.Article in journal (Refereed) Published
Abstract [en]

Road blocking due to thawing or heavy rains annually contribute to a considerable loss in Swedish forestry. Companies are forced to build up large stocks of raw material (saw and pulp logs) in order to secure a continuous supply when access to the road network is uncertain. Storage outdoors leads to quality deterioration and monetary losses. Other related costs due to road blocking are road damage and longer haulage distances. One approach to reduce the losses due to road blocks is to upgrade the road network to a standard that guarantees accessibility. We consider the road upgrade problem from the perspective of Swedish forest companies with a planning horizon of about one decade. The objective is to minimize the combined upgrade and transportation costs. We present two mixed integer programming models, which are uncapacitated fixed charge network flow problems including multiple assortments, several time periods and a set of road classes. One model is based on arc flows and one on route flows. For a typical planning instance, the models become large and we propose how to improve solution performance through model strengthening. The models are tested in a case study for a major Swedish forest company.

Place, publisher, year, edition, pages
2007. Vol. 6, no 1, 3-23 p.
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:liu:diva-86187DOI: 10.1007/s10852-006-9047-0OAI: oai:DiVA.org:liu-86187DiVA: diva2:575485
Available from: 2012-12-10 Created: 2012-12-10 Last updated: 2017-12-07
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

Henningsson, MathiasKarlsson, Jenny

Search in DiVA

By author/editor
Henningsson, MathiasKarlsson, Jenny
By organisation
Optimization The Institute of Technology
In the same journal
Journal of Mathematical Modelling and Algorithms
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 145 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