Concurrent optimization of harvesting and road network layouts under steep terrain

DOI10.1007/s10479-012-1273-4zbMath1323.90009MaRDI QIDQ748552

Leo Gallus Bont, Hans Rudolf Heinimann, Richard L. Church

Publication date: 29 October 2015

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: http://doc.rero.ch/record/331271/files/10479_2012_Article_1273.pdf

zbMATH Keywords

mixed integer linear programming problem; cable-yarding; forest road network; steep terrain

Mathematics Subject Classification ID

90C11: Mixed integer programming

90B06: Transportation, logistics and supply chain management

91B76: Environmental economics (natural resource models, harvesting, pollution, etc.)

Uses Software

• BEAMR

Cites Work

• Strategic route extension in transit networks
• A tabu search approach for solving a difficult forest harvesting machine location problem
• The maximum covering/shortest path problem: A multiobjective network design and routing formulation
• Heuristic concentration: Two stage solution construction
• Heuristic solution approaches to operational forest planning problems
• BEAMR: an exact and approximate model for the \(p\)-median problem
• On a routing problem
• Integer Programming Formulation of Traveling Salesman Problems
• A Combinatorial Heuristic Approach for Solving Real-Size Machinery Location and Road Design Problems in Forestry Planning
• A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design