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
Short-term harvest planning including scheduling of harvest crews
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.
The Forest Research Institute of Sweden, Uppsala, Sweden.
2003 (English)In: International Transactions in Operational Research, ISSN 0969-6016, E-ISSN 1475-3995, Vol. 10, no 5, 413-431 p.Article in journal (Refereed) Published
Abstract [en]

The problem we consider is short-term harvesting planning for a total planning period of 4–6 weeks where we want to decide the harvest sequences or schedules for harvest crews. A schedule is an order or sequence of harvest areas assigned to each crew. The harvesting of areas is planned in order to meet industrial demand. The total cost includes harvesting, transportation, and storage. One considerable cost is due to the quality reduction of logs stored at harvest areas. There are a number of restrictions to be considered. Areas are of varying size and the composition of assortments in each area is different. Each harvest team has different skills, a different home base, and different production capacity. Another aspect is the road network. There is a cost related to road opening (restoring, snow removal). In this paper, we develop a mixed integer programming (MIP) model for the problem. The schedules are represented by 0/1 variables. With a limited number of schedules, the problem can be solved by a commercial MIP solver. We have also developed a heuristic solution approach that provides high-quality integer solutions within a distinct time limit to be used when more schedules are used. Computational results from a major Swedish forest company are presented.

Place, publisher, year, edition, pages
2003. Vol. 10, no 5, 413-431 p.
National Category
Mathematics
Identifiers
URN: urn:nbn:se:liu:diva-22331DOI: 10.1111/1475-3995.00419Local ID: 1532OAI: oai:DiVA.org:liu-22331DiVA: diva2:242644
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
International Transactions in Operational Research
Mathematics

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

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