IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v332y2024i1d10.1007_s10479-023-05479-z.html
   My bibliography  Save this article

Assessing the benefits of storage and transshipments yards in timber supply chains by a column generation + grasp approach

Author

Listed:
  • Ignacio Vitale

    (INTEC (Universidad Nacional del Litoral - CONICET))

  • Mariana E. Cóccola

    (CONICET/UTN-FRCU)

  • Rodolfo G. Dondo

    (INTEC (Universidad Nacional del Litoral - CONICET))

Abstract

Transshipment yards are not usually considered in optimization approaches proposed for solving the log transportation problem. However, they may provide substantive advantages with respect to the usual logistics practice of direct delivering from supply forests to mills. Therefore, this paper evaluates, at the operational level, different supply chain topologies with the purpose of assessing potential costs savings associated to the use of intermediate storage facilities. The researched problem is defined by stated sets of log-suppliers, storage and transshipment yards, and facilities demanding several types of logs over a known planning horizon. The optimal transportation and inventory plan must be found. An optimization algorithm based on Column Generation + GRASP pricing metaheuristic was developed to compute minimal operation costs associated to different supply-chain topologies over a bank of instances generated from realistic information of the forestry activity in the Argentinean province of Misiones.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:annopr:v:332:y:2024:i:1:d:10.1007_s10479-023-05479-z
    DOI: 10.1007/s10479-023-05479-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-023-05479-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-023-05479-z?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. Gregory Rix & Louis-Martin Rousseau & Gilles Pesant, 2015. "A column generation algorithm for tactical timber transportation planning," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 66(2), pages 278-287, February.
    2. Marco E. Lübbecke & Jacques Desrosiers, 2005. "Selected Topics in Column Generation," Operations Research, INFORMS, vol. 53(6), pages 1007-1023, December.
    3. José Arroyo & Pedro Vieira & Dalessandro Vianna, 2008. "A GRASP algorithm for the multi-criteria minimum spanning tree problem," Annals of Operations Research, Springer, vol. 159(1), pages 125-133, March.
    4. Iván Contreras & Juan Díaz, 2008. "Scatter search for the single source capacitated facility location problem," Annals of Operations Research, Springer, vol. 157(1), pages 73-89, January.
    5. 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.
    6. Alayet, Chaker & Lehoux, Nadia & Lebel, Luc, 2018. "Logistics approaches assessment to better coordinate a forest products supply chain," Journal of Forest Economics, Elsevier, vol. 30(C), pages 13-24.
    7. 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).
    8. Vitale, Ignacio & Dondo, Rodolfo G. & González, Matías & Cóccola, Mariana E., 2022. "Modelling and optimization of material flows in the wood pellet supply chain," Applied Energy, Elsevier, vol. 313(C).
    9. John Klincewicz, 2002. "Enumeration and Search Procedures for a Hub Location Problem with Economies of Scale," Annals of Operations Research, Springer, vol. 110(1), pages 107-122, February.
    10. 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.
    11. Timothy Urban, 1998. "Solution procedures for the dynamic facility layout problem," Annals of Operations Research, Springer, vol. 76(0), pages 323-342, January.
    Full references (including those not matched with items on IDEAS)

    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. 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).
    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. Maximiliano R. Bordón & Jorge M. Montagna & Gabriela Corsano, 2023. "Operational transportation planning in the forest industry integrating bucking decisions," Annals of Operations Research, Springer, vol. 322(1), pages 385-411, March.
    4. Christensen, Tue R.L. & Labbé, Martine, 2015. "A branch-cut-and-price algorithm for the piecewise linear transportation problem," European Journal of Operational Research, Elsevier, vol. 245(3), pages 645-655.
    5. Ogbe, Emmanuel & Li, Xiang, 2017. "A new cross decomposition method for stochastic mixed-integer linear programming," European Journal of Operational Research, Elsevier, vol. 256(2), pages 487-499.
    6. François Clautiaux & Cláudio Alves & José Valério de Carvalho & Jürgen Rietz, 2011. "New Stabilization Procedures for the Cutting Stock Problem," INFORMS Journal on Computing, INFORMS, vol. 23(4), pages 530-545, November.
    7. de Lima, Vinícius L. & Alves, Cláudio & Clautiaux, François & Iori, Manuel & Valério de Carvalho, José M., 2022. "Arc flow formulations based on dynamic programming: Theoretical foundations and applications," European Journal of Operational Research, Elsevier, vol. 296(1), pages 3-21.
    8. Omid Shahvari & Rasaratnam Logendran & Madjid Tavana, 2022. "An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems," Journal of Scheduling, Springer, vol. 25(5), pages 589-621, October.
    9. 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).
    10. Ann-Kathrin Rothenbächer & Michael Drexl & Stefan Irnich, 2018. "Branch-and-Price-and-Cut for the Truck-and-Trailer Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 52(5), pages 1174-1190, October.
    11. Araya-Córdova, P.J. & Vásquez, Óscar C., 2018. "The disaster emergency unit scheduling problem to control wildfires," International Journal of Production Economics, Elsevier, vol. 200(C), pages 311-317.
    12. Oliver Faust & Jochen Gönsch & Robert Klein, 2017. "Demand-Oriented Integrated Scheduling for Point-to-Point Airlines," Transportation Science, INFORMS, vol. 51(1), pages 196-213, February.
    13. Ibrahim Muter & Tevfik Aytekin, 2017. "Incorporating Aggregate Diversity in Recommender Systems Using Scalable Optimization Approaches," INFORMS Journal on Computing, INFORMS, vol. 29(3), pages 405-421, August.
    14. Sune Lauth Gadegaard & Andreas Klose & Lars Relund Nielsen, 2018. "An improved cut-and-solve algorithm for the single-source capacitated facility location problem," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 6(1), pages 1-27, March.
    15. André Rossi & Alok Singh & Marc Sevaux, 2021. "Focus distance-aware lifetime maximization of video camera-based wireless sensor networks," Journal of Heuristics, Springer, vol. 27(1), pages 5-30, April.
    16. Flötteröd, Gunnar, 2017. "A search acceleration method for optimization problems with transport simulation constraints," Transportation Research Part B: Methodological, Elsevier, vol. 98(C), pages 239-260.
    17. Renaud Chicoisne, 2023. "Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes," Computational Optimization and Applications, Springer, vol. 84(3), pages 789-831, April.
    18. Timo Gschwind & Stefan Irnich, 2012. "Effective Handling of Dynamic Time Windows and Synchronization with Precedences for Exact Vehicle Routing," Working Papers 1211, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    19. R. Montemanni & V. Leggieri, 2011. "A branch and price algorithm for the minimum power multicasting problem in wireless sensor networks," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 74(3), pages 327-342, December.
    20. Perumal, Shyam S.G. & Lusby, Richard M. & Larsen, Jesper, 2022. "Electric bus planning & scheduling: A review of related problems and methodologies," European Journal of Operational Research, Elsevier, vol. 301(2), pages 395-413.

    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:332:y:2024:i:1:d:10.1007_s10479-023-05479-z. 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.