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...

Full description

Bibliographic Details

Published in:	International transactions in operational research Vol. 30; no. 6; pp. 3930 - 3948
Main Authors:	Martins, Isabel, Alvelos, Filipe, Cerveira, Adelaide, Kašpar, Jan, Marušák, Robert
Format:	Journal Article
Language:	English
Published:	Oxford Blackwell Publishing Ltd 01.11.2023
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!