Time efficiency of selected types of adjacency constraints in solving unit restriction models

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F60460709%3A41320%2F16%3A72076" target="_blank" >RIV/60460709:41320/16:72076 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.3390/f7050102" target="_blank" >http://dx.doi.org/10.3390/f7050102</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.3390/f7050102" target="_blank" >10.3390/f7050102</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Time efficiency of selected types of adjacency constraints in solving unit restriction models

Popis výsledku v původním jazyce

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

Název v anglickém jazyce

Time efficiency of selected types of adjacency constraints in solving unit restriction models

Popis výsledku anglicky

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

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

GK - Lesnictví

OECD FORD obor

—

Projekt

<a href="/cs/project/QJ1320230" target="_blank" >QJ1320230: Systémy pro podporu rozhodování v lesním hospodářství s cílem posílení produkčních i mimorpodukčních funkcí lesa</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2016

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

FORESTS

ISSN

1999-4907

e-ISSN

—

Svazek periodika

7

Číslo periodika v rámci svazku

5

Stát vydavatele periodika

CZ - Česká republika

Počet stran výsledku

14

Strana od-do

1-14

Kód UT WoS článku

000377793800011

EID výsledku v databázi Scopus

—