A problem of forest harvesting and road building solved through model strengthening and Lagrangean relaxation

Operations Research

Volumn 51, Issue 4, 2003, Pages 613-628

  Andalaft, Nicolas ^a   Andalaft, Pablo ^b   Guignard, Monique ^c   Magendzo, Adrian ^b   Wainer, Alexis ^a   Weintraub, Andres ^b  

^a Microsystems ^*  (Venezuela)

^b UNIVERSITY OF CHILE   (Chile)

^c UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

Programming, integer, relaxation: use of Lagrangean relaxation in forestry model; Programming, integer: integer programming model for forest harvesting; Transportation, models, network: design road network for forest harvesting

Indexed keywords

LAGRANGEAN RELAXATION; LOGICAL CONSTRAINTS; TREE-HARVESTING; WATER SEDIMENTATION;

HEURISTIC METHODS; INTEGER PROGRAMMING; MONTE CARLO METHODS; OPTIMIZATION; PROBLEM SOLVING; ROAD CONSTRUCTION; SIMULATED ANNEALING; TIMBER;

FORESTRY;

EID: 4344680315     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.51.4.613.16107     Document Type: Article

References (22)

1. Barahona, F., A. Weintraub, R. Epstein. 1992. Habitat dispersion in forest planning and the stable set problem. Oper. Res. 40(S1) S14-S21.
2. Bienstock, D., O. Günlük. 1996. Capacitated network design -Polyhedral structure and computations. INFORMS J. Comput. 8 243-259.
3. Chajakis, E., M. Guignard, C. Ryu. 1994. Lagrangean bounds and heuristics for integrated resource planning in forestry. Proc. International Symposium Systems Analysis Management Decisions Forestry. Valdivia, Chile, 350-363.
4. Guignard, M., C. Ryu, K. Spielberg. 1994. Model tightening for integrated timber harvest and transportation planning. Proc. International Symposium Systems Analysis Management Decisions Forestry. Valdivia, Chile, 364-369.
5. _, _, _, 1998. Model tightening for integrated timber harvest and transportation planning. Eur. J. Oper. Res. 111 448-460.
6. Held, M., R. M. Karp. 1970. The traveling salesman problem, and minimum spanning trees. Oper. Res. 18 1138-1162.
7. _, _. 1971. The traveling salesman problem, and minimum spanning trees, part II. Math. Programming 1 6-25.
8. _, P. Wolfe, H. Crowder. 1974. Validation of subgradient optimization. Math. Programming 6 62-88.
9. Jones, J. G., J. F. C. Hyde III, M. L. Meacham. 1986. Four analytical approaches for integrating land management and transportation planning on forest lands. Research paper INT - 361, U.S. Department of Agriculture, Forest Service, Intermountain Research Station, Ogden, UT.
10. Kirby, M. W., W. Hager, P. Wong. 1986. Simultaneous planning of wildland transportation alternatives. TIMS Studies in the Management Sciences 21 371-387.
11. _, P. Wong, W. A. Hager, M. E. Huddleston. 1980. Guide to the Integrated Resources Planning Model. USDA Management Sciences Staff, Berkeley, CA.
12. Magnanti, T. L., P. Mirchandani, R. Vachani. 1995. Modeling and solving the two-facility capacitated network loading problem. Math. Programming 44 142-157.
13. Murray, A. T., R. L. Church. 1995. Measuring the efficacy of adjacency constraint structure in forest planning models. Canadian J. Forest Res. 25 1416-1424.
14. Nelson, J., D. Brodie. 1990. Comparison of a random search algorithm and mixed integer programming for solving area-based forest planning. Canadian J. Forestry 20(7) 934-942.
15. Schrijwer, A. 1986. Theory of linear and integer programming. Wiley-Interscience Series in Discrete Mathematics and Optimization. John Wiley and Sons, New York.
16. Sessions, J., J. B. Sessions. 1991. Tactical harvest planning. Proc. 1991 Society American Foresters National Convention. SAF Publication 91-01, Bethesda, MD, 362-368.
17. Sullivan, E., B. Barnes. 1980. Timber transport model, version 2.0, Res. report UCB-ITS.RR-79-18, University of California, Berkeley, CA.
18. Sullivan, E. C. 1973. A transportation analysis technique for natural resource management. Proc. Intl. Conf. Trans. Res. Bruges, Belgium, 772-788.
19. Weintraub, A., D. Navon. 1976. A forest management planning model integrating sylvicultural and transportation activities. Management Sci. 22(12) 1299-1309.
20. _, G. J. Jones, A. Magendzo, M. L. Meacham, M. W. Kirby. 1994. A heuristic system to solve mixed integer forest planning models. Oper. Res. 42 1010-1024.
21. _, _, _, _, A. Magendzo, D. Malchuk. 1995. Heuristic procedures for solving mixed-integer harvest scheduling - Transportation planning models. Canadian J. Forest Res. 25 1618-1626.
22. Yoshimoto, A., J. D. Brodie, J. Sessions. 1994. A new heuristic to solve spatially constrained long term harvest scheduling problems. Forest Sci. 40(3) 365-396.