Next Article in Journal
Regional Instability in the Abundance of Open Stands in the Boreal Forest of Eastern Canada
Previous Article in Journal
Pattern and Drivers of White-Tailed Deer (Odocoileus virginianus) Herbivory on Tree Saplings across a Plateau Landscape
Article Menu

Export Article

Open AccessArticle
Forests 2016, 7(5), 102; doi:10.3390/f7050102

Time Efficiency of Selected Types of Adjacency Constraints in Solving Unit Restriction Models

1
Department of Forest Management, Faculty of Forestry and Wood Sciences, CULS, Prague 165 21, Czech Republic
2
Warnell School of Forestry and Natural Resources, University of Georgia, Athens, GA 30602, USA
*
Author to whom correspondence should be addressed.
Academic Editors: Maarten Nieuwenhuis and Timothy A. Martin
Received: 5 April 2016 / Revised: 29 April 2016 / Accepted: 2 May 2016 / Published: 11 May 2016
View Full-Text   |   Download PDF [922 KB, uploaded 11 May 2016]   |  

Abstract

Spatial restrictions of harvesting have been extensively studied due to a number of environmental, social and legal regulations. Many spatial restrictions are defined by adjacency constraints, for which a number of algorithms have been developed. Research into the unit restriction model (URM) using a branch and bound algorithm focused on decreasing the number of adjacency constraints in harvest scheduling models, since the early solvers have been limited by the number of constraints and integer decision variables. However, this approach can lead to a loss of efficiency in solving mixed integer models. Recent improvements in commercial solvers and personal computers have made the reduction of constraints less relevant, since many solvers now accept an unlimited number of constraints and decision variables. The aim of this paper was to compare the time efficiency of solving unit restriction harvest scheduling models with different types of adjacency constraints using a commercial solver. The presented results indicate that the type of adjacency constraints can have a significant effect on the solving time and therefore could be a crucial factor of the time required for developing forest plans. We note that pairwise adjacency constraints may be sufficient today for addressing unit restriction forest harvest scheduling problems. View Full-Text
Keywords: harvest scheduling; forest planning; adjacency constraints; pairwise constraints; analytical algorithms harvest scheduling; forest planning; adjacency constraints; pairwise constraints; analytical algorithms
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Kašpar, J.; Marušák, R.; Bettinger, P. Time Efficiency of Selected Types of Adjacency Constraints in Solving Unit Restriction Models. Forests 2016, 7, 102.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Forests EISSN 1999-4907 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top