A tabu search approach for solving a difficult forest harvesting machine location problem

DOI10.1016/j.ejor.2005.03.071zbMath1163.90529OpenAlexW2111498904MaRDI QIDQ863994

Jorge R. Vera, Andres Diaz Legües, Jacques A. Ferland, Celso Carneiro Ribeiro, Andrés P. Weintraub

Publication date: 12 February 2007

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

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

zbMATH Keywords

simulated annealingtabu searchnetwork designSteiner treepath relinkinggraspforest harvestingmachinery location

Mathematics Subject Classification ID

Search theory (90B40) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)

Related Items

Applying simulated annealing using different methods for the neighborhood search in forest planning problems, Forestry management under uncertainty, Integer programming in forestry, Research on medicine distribution route optimization for community health service institutions, Concurrent optimization of harvesting and road network layouts under steep terrain

Uses Software

• Tabu search

Cites Work

• Tabu search techniques. A tutorial and an application to neural networks
• Simulated annealing for resource-constrained scheduling
• Greedy randomized adaptive search procedures
• Future paths for integer programming and links to artificial intelligence
• A Combinatorial Heuristic Approach for Solving Real-Size Machinery Location and Road Design Problems in Forestry Planning
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item