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

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!