A multi-objective Monte Carlo tree search for forest harvest scheduling

DOI10.1016/J.EJOR.2019.09.034MaRDI QIDQ2286904zbMATH OpenOpenAlexFDO

Authors Teresa Neto, Isabel Martins, João Pedro Pedroso, Miguel Constantino

Publication date 23 January 2020

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2019.09.034

zbMATH Keywords

connectivitycore areaforest planningmultiple-objective programmingtree search

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Management decision making, including multiple objectives (90B50) Multi-objective and goal programming (90C29) Applications of mathematical programming (90C90)

Recommendations

• A branch-and-bound procedure for forest harvest scheduling problems addressing aspects of habitat availability
• Branch-and-cut for the forest harvest scheduling subject to clearcut and core area constraints
• Improving computational capabilities for addressing volume constraints in forest harvest scheduling problems
• Forest harvest scheduling with clearcut and core area constraints
• A multiobjective model for forest planning with adjacency constraints
• Solving a harvest scheduling optimization problem with constraints on clearcut area and clearcut proximity
• Interactive, multiobjective programming for forest resources management
• SCHEDULING THE HARVESTING OPERATIONS OF A FOREST BLOCK: A CASE STUDY
• Spatially explicit forest harvest scheduling with difference equations
• Optimizing heuristic search in forest planning

Cites work

• A branch-and-bound procedure for forest harvest scheduling problems addressing aspects of habitat availability
• A column generation approach for solving a non-temporal forest harvest model with spatial structure constraints
• A cutting plane method for solving harvest scheduling models with area restrictions
• Algorithms for nonlinear integer bicriterion problems
• An algorithm for the bi-criterion integer programming problem
• Can mature patch constraints mitigate the fragmenting effects of harvest opening size restrictions?
• Finite-time analysis of the multiarmed bandit problem
• Forest harvest scheduling with clearcut and core area constraints
• Harvest Scheduling Subject to Maximum Area Restrictions: Exploring Exact Approaches
• scientific article; zbMATH DE number 4085440 (Why is no real title available?)
• Modeling forest core area with integer programming
• Modeling target volume flows in forest harvest scheduling subject to maximum area restrictions
• Multiobjective grid packing model: An application in forest management
• On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
• Proper efficiency and the theory of vector maximization
• Understanding Shape: Angles and Sides

Cited in

(6)

• Branch-and-cut for the forest harvest scheduling subject to clearcut and core area constraints
• Optimizing tactical harvest planning for multiple fruit orchards using a metaheuristic modeling approach
• A numerical method for interval multi-objective mixed-integer optimal control problems based on quantum heuristic algorithm
• Large scale ecosystem management as a complex systems problem: Multi-objective optimisation with spatial constraints
• Simulation research on the decision-making mechanism of regional forest carbon sequestration operation based on multi-agent system
• The crop plant scheduling problem

Describes a project that uses

Uses Software

• FRAGSTATS

This page was built for publication: A multi-objective Monte Carlo tree search for forest harvest scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2286904)