This paper presents a solution to the general transportation problem of optimally locating two facilities in the plane with the objective of minimizing expected straight-line travel cost from the facilities to demand points that are continuously distributed in probability across a complex
polygonal region. Using this procedure, two landings can be optimally located on a harvest unit with respect to yarding costs; however, the cost of building roads to and hauling logs from the two landings must be optimized separately. In this respect, the present model does not optimize the
trade-off between yarding and trucking of logs. Two examples are presented and analyzed. Future research opportunities are identified.
Published since 1971, this monthly journal features articles, reviews, notes and commentaries on all aspects of forest science, including biometrics and mensuration, conservation, disturbance, ecology, economics, entomology, fire, genetics, management, operations, pathology, physiology, policy, remote sensing, social science, soil, silviculture, wildlife and wood science, contributed by internationally respected scientists. It also publishes special issues dedicated to a topic of current interest.