IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v232y2015i1p41-6410.1007-s10479-012-1273-4.html
   My bibliography  Save this article

Concurrent optimization of harvesting and road network layouts under steep terrain

Author

Listed:
  • Leo Bont
  • Hans Heinimann
  • Richard Church

Abstract

Timber extraction is based on two transportation modes—off-road and on-road—that are connected by a set of landing nodes. Forest operations planning that is oriented toward harvesting consists of concurrently locating a truck road network, designating landing/loading sites along that network, and allocating stands to specific harvest technologies (e.g., cable roads). In central Europe, this problem has, until recently, been solved primarily with rules of thumb. By contrast, only a few attempts, designed for plantation systems, have been made to find the mathematical optima. Here, we present a modeling approach to identify a minimal-cost solution for this problem of laying out truck roads and cable roads when the terrain is steep. This technique is based on a Mixed Integer Linear Programming formulation. Our approach is as good as or better than state-of-the-art methods. Here, the overall costs of harvesting and roading were decreased by about 7 % compared with techniques that called for a heuristic solution only. Depending upon parameter choices, we also determined that a computing time ranging from 4 min to 8 hrs was required when assessing a logging area of 4.3 km 2 . Copyright Springer Science+Business Media New York 2015

Suggested Citation

  • 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.
  • Handle: RePEc:spr:annopr:v:232:y:2015:i:1:p:41-64:10.1007/s10479-012-1273-4
    DOI: 10.1007/s10479-012-1273-4
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-012-1273-4
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1007/s10479-012-1273-4?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Current, J. R. & Re Velle, C. S. & Cohon, J. L., 1985. "The maximum covering/shortest path problem: A multiobjective network design and routing formulation," European Journal of Operational Research, Elsevier, vol. 21(2), pages 189-199, August.
    2. 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.
    3. 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.
    4. Rosing, K. E. & ReVelle, C. S., 1997. "Heuristic concentration: Two stage solution construction," European Journal of Operational Research, Elsevier, vol. 97(1), pages 75-86, February.
    5. Matisziw, Timothy C. & Murray, Alan T. & Kim, Changjoo, 2006. "Strategic route extension in transit networks," European Journal of Operational Research, Elsevier, vol. 171(2), pages 661-673, June.
    6. Legues, Andres Diaz & Ferland, Jacques A. & Ribeiro, Celso C. & Vera, Jorge R. & Weintraub, Andres, 2007. "A tabu search approach for solving a difficult forest harvesting machine location problem," European Journal of Operational Research, Elsevier, vol. 179(3), pages 788-805, June.
    7. 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.
    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. Alan T. Murray, 2016. "Maximal Coverage Location Problem," International Regional Science Review, , vol. 39(1), pages 5-27, January.
    2. 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.
    3. Gomes, Vanessa de Souza & Monti, Cássio Augusto Ussi & Silva, Carolina Souza Jarochinski e & Gomide, Lucas Rezende, 2021. "Operational harvest planning under forest road maintenance uncertainty," Forest Policy and Economics, Elsevier, vol. 131(C).

    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. Murawski, Lisa & Church, Richard L., 2009. "Improving accessibility to rural health services: The maximal covering network improvement problem," Socio-Economic Planning Sciences, Elsevier, vol. 43(2), pages 102-110, June.
    2. Danwen Bao & Shijia Tian & Rui Li & Tianxuan Zhang & Ting Zhu, 2022. "Multi-Objective Decision Method for Airport Landside Rapid Transit Network Design," Networks and Spatial Economics, Springer, vol. 22(4), pages 767-801, December.
    3. Kamruzzaman, Md. & Hine, Julian & Gunay, Banihan & Blair, Neale, 2011. "Using GIS to visualise and evaluate student travel behaviour," Journal of Transport Geography, Elsevier, vol. 19(1), pages 13-32.
    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. Alan T. Murray, 2016. "Maximal Coverage Location Problem," International Regional Science Review, , vol. 39(1), pages 5-27, January.
    6. 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.
    7. Timothy J. Niblett & Richard L. Church, 2016. "The Shortest Covering Path Problem," International Regional Science Review, , vol. 39(1), pages 131-151, January.
    8. 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.
    9. Curtin, Kevin M. & Biba, Steve, 2011. "The Transit Route Arc-Node Service Maximization problem," European Journal of Operational Research, Elsevier, vol. 208(1), pages 46-56, January.
    10. 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.
    11. S Salhi & A Al-Khedhairi, 2010. "Integrating heuristic information into exact methods: The case of the vertex p-centre problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(11), pages 1619-1631, November.
    12. 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.
    13. 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.
    14. 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.
    15. S. A. MirHassani & R. Ebrazi, 2013. "A Flexible Reformulation of the Refueling Station Location Problem," Transportation Science, INFORMS, vol. 47(4), pages 617-628, November.
    16. Joaquín Pacheco & Rafael Caballero & Manuel Laguna & Julián Molina, 2013. "Bi-Objective Bus Routing: An Application to School Buses in Rural Areas," Transportation Science, INFORMS, vol. 47(3), pages 397-411, August.
    17. Francisco Silva & Daniel Serra, 2007. "Incorporating Waiting Time in Competitive Location Models," Networks and Spatial Economics, Springer, vol. 7(1), pages 63-76, March.
    18. Zvi Drezner & Said Salhi, 2017. "Incorporating neighborhood reduction for the solution of the planar p-median problem," Annals of Operations Research, Springer, vol. 258(2), pages 639-654, November.
    19. 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.
    20. 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.

    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:spr:annopr:v:232:y:2015:i:1:p:41-64:10.1007/s10479-012-1273-4. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.