A tabu search algorithm for finding good forest harvest schedules satisfying green-up constraints

DOI10.1016/S0377-2217(97)00282-8zbMath0991.90543OpenAlexW1968676855MaRDI QIDQ1609903

Shelby Brumelle, Daniel Granot, Merja Halme, Ilan Vertinsky

Publication date: 18 August 2002

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

Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00282-8

zbMATH Keywords

AlgorithmsWatershedsLinear programmingSchedulingConstraint theoryEnvironmental impactGreen up constraintsLogging (forestry)ProblemsolvingTabu search algorithms

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Search theory (90B40) Case-oriented studies in operations research (90B90)

Related Items (7)

Applying simulated annealing using different methods for the neighborhood search in forest planning problems ⋮ Multicriteria scheduling using fuzzy theory and tabu search ⋮ Landscape-level optimization using tabu search and stand density-related forest management prescriptions ⋮ Modeling target volume flows in forest harvest scheduling subject to maximum area restrictions ⋮ Using metaheuristics in multiobjective resource constrained project scheduling ⋮ Modeling forest core area with integer programming ⋮ A note on the regularity of a new metric for measuring even-flow in forest planning

Uses Software

• Tabu search

Cites Work

• STABULUS: A technique for finding stable sets in large graphs with tabu search
• Design and Implementation of an Interactive Optimization System for Telephone Network Planning
• Tabu Search—Part I
• Interval estimation of a global optimum for large combinatorial problems
• Bandwidth Packing: A Tabu Search Approach
• Computer Solutions of the Traveling Salesman Problem

This page was built for publication: A tabu search algorithm for finding good forest harvest schedules satisfying green-up constraints