IDEAS home Printed from https://ideas.repec.org/a/eee/forpol/v128y2021ics1389934121000897.html
   My bibliography  Save this article

Optimizing log transportation in the Argentinean forest industry by column generation

Author

Listed:
  • Vitale, Ignacio
  • Broz, Diego
  • Dondo, Rodolfo

Abstract

A column generation based algorithm for optimally solving a daily log routing problem in the Argentinean forest industry is presented in this work. Minimum-cost truck-routes are dynamically generated by two complementary pricing procedures within this algorithm. The proposed decomposition procedure is able to provide optimal and or near optimal transportation plans for large instances found in the context of the argentine forest industry which considers several modelling features usually no considered in standard OR routing problems. The proposed algorithm is evaluated on several instances from the literature and on a realistic large scale example.

Suggested Citation

  • Vitale, Ignacio & Broz, Diego & Dondo, Rodolfo, 2021. "Optimizing log transportation in the Argentinean forest industry by column generation," Forest Policy and Economics, Elsevier, vol. 128(C).
    • Handle: RePEc:eee:forpol:v:128:y:2021:i:c:s1389934121000897
    DOI: 10.1016/j.forpol.2021.102483
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1389934121000897
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.forpol.2021.102483?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. Luciano Costa & Claudio Contardo & Guy Desaulniers, 2019. "Exact Branch-Price-and-Cut Algorithms for Vehicle Routing," Transportation Science, INFORMS, vol. 53(4), pages 946-985, July.
    2. Nizar El Hachemi & Michel Gendreau & Louis-Martin Rousseau, 2011. "A hybrid constraint programming approach to the log-truck scheduling problem," Annals of Operations Research, Springer, vol. 184(1), pages 163-178, April.
    3. Troncoso, Juan J. & Garrido, Rodrigo A., 2005. "Forestry production and logistics planning: an analysis using mixed-integer programming," Forest Policy and Economics, Elsevier, vol. 7(4), pages 625-633, May.
    4. 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.
    5. Bordón, Maximiliano R. & Montagna, Jorge M. & Corsano, Gabriela, 2018. "An exact mathematical formulation for the optimal log transportation," Forest Policy and Economics, Elsevier, vol. 95(C), pages 115-122.
    6. Stefano Gualandi & Federico Malucelli, 2013. "Constraint Programming-based Column Generation," Annals of Operations Research, Springer, vol. 204(1), pages 11-32, April.
    7. Olsson, Leif, 2005. "Road investment scenarios in Northern Sweden," Forest Policy and Economics, Elsevier, vol. 7(4), pages 615-623, May.
    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. Ignacio Vitale & Mariana E. Cóccola & Rodolfo G. Dondo, 2024. "Assessing the benefits of storage and transshipments yards in timber supply chains by a column generation + grasp approach," Annals of Operations Research, Springer, vol. 332(1), pages 373-403, January.
    2. Melchiori, Luciana & Nasini, Graciela & Montagna, Jorge M. & Corsano, Gabriela, 2022. "A mathematical modeling for simultaneous routing and scheduling of logging trucks in the forest supply chain," Forest Policy and Economics, Elsevier, vol. 136(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. Bordón, Maximiliano R. & Montagna, Jorge M. & Corsano, Gabriela, 2018. "An exact mathematical formulation for the optimal log transportation," Forest Policy and Economics, Elsevier, vol. 95(C), pages 115-122.
    2. Venn, Tyron J. & Dorries, Jack W. & McGavin, Robert L., 2021. "A mathematical model to support investment in veneer and LVL manufacturing in subtropical eastern Australia," Forest Policy and Economics, Elsevier, vol. 128(C).
    3. Veisi, Omid & Moradi, Mohammad Amin & Gharaei, Beheshteh & Maleki, Farid Jabbari & Rahbar, Morteza, 2025. "Sustainable forestry logistics: Using modified A-star algorithm for efficient timber transportation route optimization," Forest Policy and Economics, Elsevier, vol. 173(C).
    4. Olsson, Leif, 2007. "Optimal upgrading of forest road networks: Scenario analysis vs. stochastic modelling," Forest Policy and Economics, Elsevier, vol. 9(8), pages 1071-1078, May.
    5. Kai L. Ross & Sándor F. Tóth & Weikko S. Jaross, 2018. "Forest Harvest Scheduling with Endogenous Road Costs," Interfaces, INFORMS, vol. 48(3), pages 260-270, June.
    6. Luo, Li & O'Hehir, Jim & Regan, Courtney M. & Meng, Li & Connor, Jeffery D. & Chow, Christopher W.K., 2021. "An integrated strategic and tactical optimization model for forest supply chain planning," Forest Policy and Economics, Elsevier, vol. 131(C).
    7. Correia, Isabel & Melo, Teresa, 2016. "A computational comparison of formulations for a multi-period facility location problem with modular capacity adjustments and flexible demand fulfillment," Technical Reports on Logistics of the Saarland Business School 11, Saarland University of Applied Sciences (htw saar), Saarland Business School.
    8. Liu, Yiming & Yu, Yang & Baldacci, Roberto & Tang, Jiafu & Sun, Wei, 2025. "Optimizing carbon emissions in green logistics for time-dependent routing," Transportation Research Part B: Methodological, Elsevier, vol. 192(C).
    9. Jiliu Li & Zhixing Luo & Roberto Baldacci & Hu Qin & Zhou Xu, 2023. "A New Exact Algorithm for Single-Commodity Vehicle Routing with Split Pickups and Deliveries," INFORMS Journal on Computing, INFORMS, vol. 35(1), pages 31-49, January.
    10. Mumm, Harald, 2025. "Generische Tourenpläne," Wismar Discussion Papers 01/2025, Hochschule Wismar, Wismar Business School.
    11. Jan Zazgornik & Manfred Gronalt & Patrick Hirsch, 2012. "A comprehensive approach to planning the deployment of transportation assets in distributing forest products," International Journal of Revenue Management, Inderscience Enterprises Ltd, vol. 6(1/2), pages 45-61.
    12. Zakaria Chekoubi & Wajdi Trabelsi & Nathalie Sauer & Ilias Majdouline, 2022. "The Integrated Production-Inventory-Routing Problem with Reverse Logistics and Remanufacturing: A Two-Phase Decomposition Heuristic," Sustainability, MDPI, vol. 14(20), pages 1-30, October.
    13. He, Ping & Jin, Jian Gang & Trépanier, Martin & Schulte, Frederik, 2024. "A math-heuristic and exact algorithm for first-mile ridesharing problem with passenger service quality preferences," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 192(C).
    14. Sluijk, Natasja & Florio, Alexandre M. & Kinable, Joris & Dellaert, Nico & Van Woensel, Tom, 2023. "Two-echelon vehicle routing problems: A literature review," European Journal of Operational Research, Elsevier, vol. 304(3), pages 865-886.
    15. Alexandre M. Florio & Nabil Absi & Dominique Feillet, 2021. "Routing Electric Vehicles on Congested Street Networks," Transportation Science, INFORMS, vol. 55(1), pages 238-256, 1-2.
    16. Benati, Stefano & Ponce, Diego & Puerto, Justo & Rodríguez-Chía, Antonio M., 2022. "A branch-and-price procedure for clustering data that are graph connected," European Journal of Operational Research, Elsevier, vol. 297(3), pages 817-830.
    17. Liu, Yiming & Roberto, Baldacci & Zhou, Jianwen & Yu, Yang & Zhang, Yu & Sun, Wei, 2023. "Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 310(1), pages 133-155.
    18. Nikolaus Furian & Michael O’Sullivan & Cameron Walker & Eranda Çela, 2021. "A machine learning-based branch and price algorithm for a sampled vehicle routing problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(3), pages 693-732, September.
    19. Nizar Hachemi & Issmail Hallaoui & Michel Gendreau & Louis-Martin Rousseau, 2015. "Flow-based integer linear programs to solve the weekly log-truck scheduling problem," Annals of Operations Research, Springer, vol. 232(1), pages 87-97, September.
    20. Ignacio Vitale & Mariana E. Cóccola & Rodolfo G. Dondo, 2024. "Assessing the benefits of storage and transshipments yards in timber supply chains by a column generation + grasp approach," Annals of Operations Research, Springer, vol. 332(1), pages 373-403, January.

    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:eee:forpol:v:128:y:2021:i:c:s1389934121000897. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/forpol .

    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.