Applying simulated annealing using different methods for the neighborhood search in forest planning problems

DOI10.1016/J.EJOR.2013.08.039zbMath1339.90334OpenAlexW1976314938MaRDI QIDQ297021

Even Bergseng, Tron Eid, Paulo Vinicius Koerich Borges

Publication date: 24 June 2016

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

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

zbMATH Keywords

metaheuristicsOR in natural resourcesadjacency unit restriction modelbiased probabilitiessequential flow

Mathematics Subject Classification ID

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

Related Items (4)

A novel sequential approximate optimization approach using data mining for engineering design optimization ⋮ Identification of effective implementations of simulated annealing for optimizing thinning schedules for single forest stands ⋮ Serial-batching group scheduling with release times and the combined effects of deterioration and truncated job-dependent learning ⋮ Single-machine scheduling with learning effect and resource-dependent processing times in the serial-batching production

Cites Work

• Optimization by Simulated Annealing
• A tabu search approach for solving a difficult forest harvesting machine location problem
• Optimizing heuristic search in forest planning
• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
• New optimization heuristics. The great deluge algorithm and the record- to-record travel
• Even-aged restrictions with sub-graph adjacency
• A tabu search algorithm for finding good forest harvest schedules satisfying green-up constraints
• Heuristic solution approaches to operational forest planning problems
• Tabu Search—Part I
• Tabu Search—Part II

This page was built for publication: Applying simulated annealing using different methods for the neighborhood search in forest planning problems