Heuristic solution approaches to operational forest planning problems
From MaRDI portal
Publication:1909009
DOI10.1007/BF01719265zbMath0842.90077OpenAlexW1998736475MaRDI QIDQ1909009
Richard L. Church, Alan T. Murray
Publication date: 7 March 1996
Published in: OR Spektrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01719265
Related Items
Applying simulated annealing using different methods for the neighborhood search in forest planning problems ⋮ A column generation approach for solving a non-temporal forest harvest model with spatial structure constraints ⋮ Landscape-level optimization using tabu search and stand density-related forest management prescriptions ⋮ Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue ⋮ Optimizing heuristic search in forest planning ⋮ Metaheuristics: A bibliography ⋮ Identification of effective implementations of simulated annealing for optimizing thinning schedules for single forest stands ⋮ Fifty years of operational research in forestry ⋮ Demand-driven harvest planning and machinery scheduling for guayule ⋮ Stochastic forestry planning under market and growth uncertainty ⋮ Support system development for forest ecosystem management ⋮ A two-phased approach to the supply network reconfiguration problem ⋮ Review of combinatorial problems induced by spatial forest harvesting planning ⋮ Concurrent optimization of harvesting and road network layouts under steep terrain ⋮ Stochastic optimization models in forest planning: a progressive hedging solution approach ⋮ Spatial uncertainty in harvest scheduling
Uses Software
Cites Work
- Optimization by Simulated Annealing
- Tabu search techniques. A tutorial and an application to neural networks
- The tabu search metaheuristic: How we used it
- Design and Implementation of an Interactive Optimization System for Telephone Network Planning
- Locating Emergency Vehicle Bases When Service Time Depends on Call Location
- Tabu Search—Part I
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem