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

A Combinatorial Heuristic Approach for Solving Real-Size Machinery Location and Road Design Problems in Forestry Planning

Author

Listed:
  • Rafael Epstein

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

  • Andrés Weintraub

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

  • Pedro Sapunar

    (Forestal Arauco)

  • Enrique Nieto

    (Forestal Arauco)

  • Julian B. Sessions

    (Tektronix, Inc., Beaverton, Oregon)

  • John Sessions

    (College of Forestry, Oregon State University, Corvallis, Oregon 97331)

  • Fernando Bustamante

    (Forestal Bio-Bio)

  • Hugo Musante

    (Forestal Mininco)

Abstract

The location and operation of harvest machinery, along with the design and construction of access roads, are important problems faced by forestry planners, making up about 55% of total production costs. One of the main challenges consists of finding a design that will minimize the cost of installation and operation of harvest machinery, road construction, and timber transport, while complying with the technical restrictions that apply to the operation of harvesting equipment and road construction. We can model the network design problem as a mixed-integer linear programming problem. This model is fed with cartographic information, provided by a geographic information system (GIS), along with technical and economic parameters determined by the planner. We developed a specialized heuristic for the problem to obtain solutions that enable harvesting economically profitable volumes at a low cost. This methodology was programmed into a computer system known as PLANEX and is being applied in nine forestry companies that report important benefits from its use.

Suggested Citation

  • Rafael Epstein & Andrés Weintraub & Pedro Sapunar & Enrique Nieto & Julian B. Sessions & John Sessions & Fernando Bustamante & Hugo Musante, 2006. "A Combinatorial Heuristic Approach for Solving Real-Size Machinery Location and Road Design Problems in Forestry Planning," Operations Research, INFORMS, vol. 54(6), pages 1017-1027, December.
    • Handle: RePEc:inm:oropre:v:54:y:2006:i:6:p:1017-1027
    DOI: 10.1287/opre.1060.0331
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.1060.0331
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.1060.0331?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. A. Balakrishnan & T. L. Magnanti & R. T. Wong, 1989. "A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design," Operations Research, INFORMS, vol. 37(5), pages 716-740, October.
    2. Rafael Epstein & Ramiro Morales & Jorge Serón & Andres Weintraub, 1999. "Use of OR Systems in the Chilean Forest Industries," Interfaces, INFORMS, vol. 29(1), pages 7-29, 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. De Boeck, Kim & Decouttere, Catherine & Jónasson, Jónas Oddur & Vandaele, Nico, 2022. "Vaccine supply chains in resource-limited settings: Mitigating the impact of rainy season disruptions," European Journal of Operational Research, Elsevier, vol. 301(1), pages 300-317.
    3. Güden, Hüseyin & Süral, Haldun, 2014. "Locating mobile facilities in railway construction management," Omega, Elsevier, vol. 45(C), pages 71-79.
    4. 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.
    5. 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.
    6. Ezzati, Sattar & Najafi, Akbar & Yaghini, Masoud & Hashemi, Amir Ala & Bettinger, Pete, 2015. "An optimization model to solve skidding problem in steep slope terrain," Journal of Forest Economics, Elsevier, vol. 21(4), pages 250-268.
    7. Leo Bont & Hans Heinimann & Richard Church, 2015. "Concurrent optimization of harvesting and road network layouts under steep terrain," Annals of Operations Research, Springer, vol. 232(1), pages 41-64, September.
    8. E. Abdi & B. Majnounian & A. Darvishsefat & Z. Mashayekhi & J. Sessions, 2009. "A GIS-MCE based model for forest road planning," Journal of Forest Science, Czech Academy of Agricultural Sciences, vol. 55(4), pages 171-176.

    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. Leo Bont & Hans Heinimann & Richard Church, 2015. "Concurrent optimization of harvesting and road network layouts under steep terrain," Annals of Operations Research, Springer, vol. 232(1), pages 41-64, September.
    2. Melkote, Sanjay & Daskin, Mark S., 2001. "Capacitated facility location/network design problems," European Journal of Operational Research, Elsevier, vol. 129(3), pages 481-495, March.
    3. Crainic, Teodor Gabriel, 2000. "Service network design in freight transportation," European Journal of Operational Research, Elsevier, vol. 122(2), pages 272-288, April.
    4. Abdolsalam Ghaderi, 2015. "Heuristic Algorithms for Solving an Integrated Dynamic Center Facility Location - Network Design Model," Networks and Spatial Economics, Springer, vol. 15(1), pages 43-69, March.
    5. Contreras, Ivan & Fernández, Elena & Reinelt, Gerhard, 2012. "Minimizing the maximum travel time in a combined model of facility location and network design," Omega, Elsevier, vol. 40(6), pages 847-860.
    6. M. Gisela Bardossy & S. Raghavan, 2010. "Dual-Based Local Search for the Connected Facility Location and Related Problems," INFORMS Journal on Computing, INFORMS, vol. 22(4), pages 584-602, November.
    7. Kaj Holmberg & Johan Hellstrand, 1998. "Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound," Operations Research, INFORMS, vol. 46(2), pages 247-259, April.
    8. Herrmann, J. W. & Ioannou, G. & Minis, I. & Proth, J. M., 1996. "A dual ascent approach to the fixed-charge capacitated network design problem," European Journal of Operational Research, Elsevier, vol. 95(3), pages 476-490, December.
    9. Patrik Flisberg & Mikael Rönnqvist & Stefan Nilsson, 2009. "Billerud Optimizes Its Bleaching Process Using Online Optimization," Interfaces, INFORMS, vol. 39(2), pages 119-132, April.
    10. Sabyasachi Mitra & Ishwar Murthy, 1998. "A Dual Ascent Procedure with Valid Inequalities for Designing Hierarchical Network Topologies," INFORMS Journal on Computing, INFORMS, vol. 10(1), pages 40-55, February.
    11. Van Horne, Constance & Frayret, Jean-Marc & Poulin, Diane, 2006. "Creating value with innovation: From centre of expertise to the forest products industry," Forest Policy and Economics, Elsevier, vol. 8(7), pages 751-761, October.
    12. Gouveia, Luis, 1996. "Multicommodity flow models for spanning trees with hop constraints," European Journal of Operational Research, Elsevier, vol. 95(1), pages 178-190, November.
    13. Gendron, Bernard, 2002. "A note on "a dual-ascent approach to the fixed-charge capacitated network design problem"," European Journal of Operational Research, Elsevier, vol. 138(3), pages 671-675, May.
    14. Kaj Holmberg & Di Yuan, 2000. "A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem," Operations Research, INFORMS, vol. 48(3), pages 461-481, June.
    15. Bjorndal, M. H. & Caprara, A. & Cowling, P. I. & Della Croce, F. & Lourenco, H. & Malucelli, F. & Orman, A. J. & Pisinger, D. & Rego, C. & Salazar, J. J., 1995. "Some thoughts on combinatorial optimisation," European Journal of Operational Research, Elsevier, vol. 83(2), pages 253-270, June.
    16. Anantaram Balakrishnan & Prakash Mirchandani & Harihara Prasad Natarajan, 2009. "Connectivity Upgrade Models for Survivable Network Design," Operations Research, INFORMS, vol. 57(1), pages 170-186, February.
    17. Agarwal, Y.K. & Aneja, Y.P., 2017. "Fixed charge multicommodity network design using p-partition facets," European Journal of Operational Research, Elsevier, vol. 258(1), pages 124-135.
    18. Fragkos, Ioannis & Cordeau, Jean-François & Jans, Raf, 2021. "Decomposition methods for large-scale network expansion problems," Transportation Research Part B: Methodological, Elsevier, vol. 144(C), pages 60-80.
    19. Eduardo González & Leonardo Epstein, 2015. "Minimum cost in a mix of new and old reusable items: an application to sizing a fleet of delivery trucks," Annals of Operations Research, Springer, vol. 232(1), pages 135-149, September.
    20. Teodor Gabriel Crainic & Michel Gendreau & Judith M. Farvolden, 2000. "A Simplex-Based Tabu Search Method for Capacitated Network Design," INFORMS Journal on Computing, INFORMS, vol. 12(3), pages 223-236, 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:54:y:2006:i:6:p:1017-1027. 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.