IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v51y2003i4p613-628.html
   My bibliography  Save this article

A Problem of Forest Harvesting and Road Building Solved Through Model Strengthening and Lagrangean Relaxation

Author

Listed:
  • Nicolas Andalaft

    (Microsystems, Argentina)

  • Pablo Andalaft

    (Department of Industrial Engineering, University of Chile, Santiago, Chile)

  • Monique Guignard

    (Department of Operations and Information Management, The Wharton School, University of Pennsylvania, Philadelphia, Pennsylvania 19104)

  • Adrian Magendzo

    (Department of Industrial Engineering, University of Chile, Santiago, Chile)

  • Alexis Wainer

    (Forestal Terranova, Venezuela)

  • Andres Weintraub

    (Department of Industrial Engineering, University of Chile, Santiago, Chile)

Abstract

We consider a problem of forest planning on pine plantations over a two to five year horizon. Basic decisions concern the areas to harvest in each period, the amount of timber to produce to satisfy aggregate demands for log exports, sawmills and pulp plants, and the roads to build for access and storage of timber. A linear programming model with 0--1 variables describes the decision process. Solution strategies involve strengthening of the model, lifting some of the constraints, and applying Lagrangean relaxation. Results on real planning problems show that even as these problems become more complex, the proposed solution strategies lead to very good solutions, reducing the residual gap for the most difficult data set from 162% to 1.6%, and for all data sets to 2.6% or less.

Suggested Citation

  • Nicolas Andalaft & Pablo Andalaft & Monique Guignard & Adrian Magendzo & Alexis Wainer & Andres Weintraub, 2003. "A Problem of Forest Harvesting and Road Building Solved Through Model Strengthening and Lagrangean Relaxation," Operations Research, INFORMS, vol. 51(4), pages 613-628, August.
    • Handle: RePEc:inm:oropre:v:51:y:2003:i:4:p:613-628
    DOI: 10.1287/opre.51.4.613.16107
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.51.4.613.16107
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.51.4.613.16107?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Francisco Barahona & Andrés Weintraub & Rafael Epstein, 1992. "Habitat Dispersion in Forest Planning and the Stable Set Problem," Operations Research, INFORMS, vol. 40(1-supplem), pages 14-21, February.
    2. Guignard, Monique & Ryu, Choonho & Spielberg, Kurt, 1998. "Model tightening for integrated timber harvest and transportation planning," European Journal of Operational Research, Elsevier, vol. 111(3), pages 448-460, December.
    3. Michael Held & Richard M. Karp, 1970. "The Traveling-Salesman Problem and Minimum Spanning Trees," Operations Research, INFORMS, vol. 18(6), pages 1138-1162, December.
    4. Andres Weintraub & Daniel Navon, 1976. "A Forest Management Planning Model Integrating Silvicultural and Transportation Activities," Management Science, INFORMS, vol. 22(12), pages 1299-1309, August.
    5. Daniel Bienstock & Oktay Günlük, 1996. "Capacitated Network Design---Polyhedral Structure and Computation," INFORMS Journal on Computing, INFORMS, vol. 8(3), pages 243-259, August.
    6. Andrés Weintraub & Greg Jones & Adrian Magendzo & Mary Meacham & Malcolm Kirby, 1994. "A Heuristic System to Solve Mixed Integér Forest Planning Models," Operations Research, INFORMS, vol. 42(6), pages 1010-1024, December.
    7. Thomas L. Magnanti & Prakash Mirchandani & Rita Vachani, 1995. "Modeling and Solving the Two-Facility Capacitated Network Loading Problem," Operations Research, INFORMS, vol. 43(1), pages 142-157, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Antonio Alonso-Ayuso & Laureano Escudero & Monique Guignard & Martín Quinteros & Andres Weintraub, 2011. "Forestry management under uncertainty," Annals of Operations Research, Springer, vol. 190(1), pages 17-39, October.
    2. Quadrifoglio, Luca & Dessouky, Maged M. & Ordonez, Fernando, 2008. "Mobility allowance shuttle transit (MAST) services: MIP formulation and strengthening with logic constraints," European Journal of Operational Research, Elsevier, vol. 185(2), pages 481-494, March.
    3. Sanei Bajgiran, Omid & Kazemi Zanjani, Masoumeh & Nourelfath, Mustapha, 2016. "The value of integrated tactical planning optimization in the lumber supply chain," International Journal of Production Economics, Elsevier, vol. 171(P1), pages 22-33.
    4. Andres Weintraub P., 2007. "Integer programming in forestry," Annals of Operations Research, Springer, vol. 149(1), pages 209-216, February.
    5. Omid Sanei Bajgiran & Masoumeh Kazemi Zanjani & Mustapha Nourelfath, 2017. "Forest harvesting planning under uncertainty: a cardinality-constrained approach," International Journal of Production Research, Taylor & Francis Journals, vol. 55(7), pages 1914-1929, April.
    6. Nader Naderializadeh & Kevin A. Crowe, 2020. "Formulating the integrated forest harvest-scheduling model to reduce the cost of the road-networks," Operational Research, Springer, vol. 20(4), pages 2283-2306, December.
    7. Alonso-Ayuso, Antonio & Escudero, Laureano F. & Guignard, Monique & Weintraub, Andres, 2018. "Risk management for forestry planning under uncertainty in demand and prices," European Journal of Operational Research, Elsevier, vol. 267(3), pages 1051-1074.
    8. Mikael Rönnqvist & Sophie D’Amours & Andres Weintraub & Alejandro Jofre & Eldon Gunn & Robert Haight & David Martell & Alan Murray & Carlos Romero, 2015. "Operations Research challenges in forestry: 33 open problems," Annals of Operations Research, Springer, vol. 232(1), pages 11-40, September.
    9. Bisera Andrić Gušavac & Selman Karagoz & Milena Popović & Dragan Pamućar & Muhammet Deveci, 2023. "Reconcilement of conflicting goals: a novel operations research-based methodology for environmental management," Environment, Development and Sustainability: A Multidisciplinary Approach to the Theory and Practice of Sustainable Development, Springer, vol. 25(8), pages 7423-7460, August.
    10. Hauer, Grant & Cumming, Steve & Schmiegelow, Fiona & Adamowicz, Wiktor & Weber, Marian & Jagodzinski, Robert, 2010. "Tradeoffs between forestry resource and conservation values under alternate policy regimes: A spatial analysis of the western Canadian boreal plains," Ecological Modelling, Elsevier, vol. 221(21), pages 2590-2603.
    11. Monique Guignard, 2003. "Lagrangean relaxation," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 11(2), pages 151-200, December.
    12. Fernando Veliz & Jean-Paul Watson & Andres Weintraub & Roger Wets & David Woodruff, 2015. "Stochastic optimization models in forest planning: a progressive hedging solution approach," Annals of Operations Research, Springer, vol. 232(1), pages 259-274, September.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Nader Naderializadeh & Kevin A. Crowe, 2020. "Formulating the integrated forest harvest-scheduling model to reduce the cost of the road-networks," Operational Research, Springer, vol. 20(4), pages 2283-2306, December.
    2. Andres Weintraub P., 2007. "Integer programming in forestry," Annals of Operations Research, Springer, vol. 149(1), pages 209-216, February.
    3. Ioannis Gamvros & Bruce Golden & S. Raghavan, 2006. "The Multilevel Capacitated Minimum Spanning Tree Problem," INFORMS Journal on Computing, INFORMS, vol. 18(3), pages 348-365, August.
    4. Alonso-Ayuso, Antonio & Escudero, Laureano F. & Guignard, Monique & Weintraub, Andres, 2018. "Risk management for forestry planning under uncertainty in demand and prices," European Journal of Operational Research, Elsevier, vol. 267(3), pages 1051-1074.
    5. Ram Kumar P N, 2013. "On Modeling The Step Fixed-Charge Transportation Problem," Working papers 134, Indian Institute of Management Kozhikode.
    6. F. J. Hwang & Yao-Huei Huang, 2021. "An effective logarithmic formulation for piecewise linearization requiring no inequality constraint," Computational Optimization and Applications, Springer, vol. 79(3), pages 601-631, July.
    7. Sridhar, Varadharajan & Park, June S., 2000. "Benders-and-cut algorithm for fixed-charge capacitated network design problem," European Journal of Operational Research, Elsevier, vol. 125(3), pages 622-632, September.
    8. Morten Riis & Kim Allan Andersen, 2002. "Capacitated Network Design with Uncertain Demand," INFORMS Journal on Computing, INFORMS, vol. 14(3), pages 247-260, August.
    9. Ya Ping Fang & Kaiwen Meng & Xiao Qi Yang, 2012. "Piecewise Linear Multicriteria Programs: The Continuous Case and Its Discontinuous Generalization," Operations Research, INFORMS, vol. 60(2), pages 398-409, April.
    10. Martell, David L. & Gunn, Eldon A. & Weintraub, Andres, 1998. "Forest management challenges for operational researchers," European Journal of Operational Research, Elsevier, vol. 104(1), pages 1-17, January.
    11. Andrew P. Armacost & Cynthia Barnhart & Keith A. Ware, 2002. "Composite Variable Formulations for Express Shipment Service Network Design," Transportation Science, INFORMS, vol. 36(1), pages 1-20, February.
    12. Nader Naderializadeh & Kevin A. Crowe & Melika Rouhafza, 2022. "Solving the integrated forest harvest scheduling model using metaheuristic algorithms," Operational Research, Springer, vol. 22(3), pages 2437-2463, July.
    13. Keely L. Croxton & Bernard Gendron & Thomas L. Magnanti, 2007. "Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs," Operations Research, INFORMS, vol. 55(1), pages 146-157, February.
    14. Marta Mesquita & Susete Marques & Marlene Marques & Marco Marto & Miguel Constantino & José G. Borges, 2022. "An optimization approach to design forest road networks and plan timber transportation," Operational Research, Springer, vol. 22(3), pages 2973-3001, July.
    15. Jiehong Kong & Mikael Rönnqvist & Mikael Frisk, 2015. "Using mixed integer programming models to synchronously determine production levels and market prices in an integrated market for roundwood and forest biomass," Annals of Operations Research, Springer, vol. 232(1), pages 179-199, September.
    16. Grit Claßen & Arie M. C. A. Koster & David Coudert & Napoleão Nepomuceno, 2014. "Chance-Constrained Optimization of Reliable Fixed Broadband Wireless Networks," INFORMS Journal on Computing, INFORMS, vol. 26(4), pages 893-909, November.
    17. Olsson, Leif & Lohmander, Peter, 2005. "Optimal forest transportation with respect to road investments," Forest Policy and Economics, Elsevier, vol. 7(3), pages 369-379, March.
    18. Mervat Chouman & Teodor Gabriel Crainic & Bernard Gendron, 2018. "The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 6(2), pages 143-184, June.
    19. F. Sibel Salman & R. Ravi & John N. Hooker, 2008. "Solving the Capacitated Local Access Network Design Problem," INFORMS Journal on Computing, INFORMS, vol. 20(2), pages 243-254, May.
    20. Anantaram Balakrishnan & Thomas L. Magnanti & Joel S. Sokol & Yi Wang, 2002. "Spare-Capacity Assignment For Line Restoration Using a Single-Facility Type," Operations Research, INFORMS, vol. 50(4), pages 617-635, August.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:51:y:2003:i:4:p:613-628. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.