Optimizing heuristic search in forest planning

DOI10.1016/j.nonrwa.2005.11.011zbMath1112.90104OpenAlexW2072699534MaRDI QIDQ867984

Tero Heinonen, Timo Pukkala

Publication date: 19 February 2007

Published in: Nonlinear Analysis. Real World Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.nonrwa.2005.11.011

zbMATH Keywords

simulated annealingtabu searchThreshold acceptingHooke-Jeeves direct search

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (3)

Applying simulated annealing using different methods for the neighborhood search in forest planning problems ⋮ A landscape-based analysis of fixed temperature and simulated annealing ⋮ A multiobjective model for forest planning with adjacency constraints

Uses Software

• Tabu search

Cites Work

• A systematic procedure for setting parameters in simulated annealing algorithms
• Heuristic solution approaches to operational forest planning problems
• `` Direct Search Solution of Numerical and Statistical Problems
• Tabu Search—Part I
• Tabu Search—Part II
• Nonlinear Programming
• Using experimental design to find effective parameter settings for heuristics
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimizing heuristic search in forest planning