Solving a harvest scheduling optimization problem with constraints on clearcut area and clearcut proximity

This study aims at solving a harvesting scheduling optimization problem with constraints on the clearcut area with additional constraints on clearcut proximity. The objective function is defined as the net present value generated by harvesting discounted by a penalty for each clearcut. This problem...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:International transactions in operational research Ročník 30; číslo 6; s. 3930 - 3948
Hlavní autori: Martins, Isabel, Alvelos, Filipe, Cerveira, Adelaide, Kašpar, Jan, Marušák, Robert
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Oxford Blackwell Publishing Ltd 01.11.2023
Predmet:
branch‐and‐price
bucket formulation
Connectivity
Constraint modelling
Dantzig-Wolfe decomposition
Environmental impact
Harvest
Integer programming
Mixed integer
Net present value
Operations research
Optimization
Scheduling
ISSN:0969-6016, 1475-3995
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:This study aims at solving a harvesting scheduling optimization problem with constraints on the clearcut area with additional constraints on clearcut proximity. The objective function is defined as the net present value generated by harvesting discounted by a penalty for each clearcut. This problem arises to reduce the negative environmental impact of excessive harvesting. We propose the connected‐bucket model, the so‐called bucket model with additional constraints on bucket connectivity and two definitions of stand adjacency, and a Dantzig–Wolfe decomposition. The decomposed model is solved by branch‐and‐price and the connected‐bucket model by a general‐purpose mixed integer programming solver (CPLEX). We compare the quality of the solutions obtained with both approaches for real instances. The branch‐and‐price approach found better solutions for the majority of the instances.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0969-6016
1475-3995
DOI:10.1111/itor.13183