IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v59y2008i5d10.1057_palgrave.jors.2602367.html
   My bibliography  Save this article

Optimizing the woodpulp stowage using Lagrangean relaxation with clusters

Author

Listed:
  • G M Ribeiro

    (UniAracruz)

  • L A N Lorena

    (Brazilian Space Research Institute)

Abstract

The cargo stowage process in ships consists in arranging items into holds. This paper approaches the problem of finding the maximum number of stowed units of woodpulp into holds of dedicated maritime international ships. This problem, essentially three-dimensional, can be reduced to the two-dimensional case due to constraints provided by the transport, and becomes similar to the manufacturer's pallet loading problem. We present in this paper a formulation to the woodpulp stowage solved by a Lagrangean relaxation with clusters (LagClus) that considers the conflict graph generated by overlaps of woodpulp units. Computational tests are performed and compared with the real results obtained in Brazilian ports. The results obtained by LagClus were better than the real results, and consequently it can provide savings if we look at the shipping logistics costs.

Suggested Citation

  • G M Ribeiro & L A N Lorena, 2008. "Optimizing the woodpulp stowage using Lagrangean relaxation with clusters," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(5), pages 600-606, May.
  • Handle: RePEc:pal:jorsoc:v:59:y:2008:i:5:d:10.1057_palgrave.jors.2602367
    DOI: 10.1057/palgrave.jors.2602367
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2602367
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1057/palgrave.jors.2602367?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. Nicos Christofides & Charles Whitlock, 1977. "An Algorithm for Two-Dimensional Cutting Problems," Operations Research, INFORMS, vol. 25(1), pages 30-44, February.
    2. G, Young-Gun & Kang, Maing-Kyu, 2001. "A fast algorithm for two-dimensional pallet loading problems of large size," European Journal of Operational Research, Elsevier, vol. 134(1), pages 193-202, October.
    3. Bhattacharya, Subir & Roy, Rahul & Bhattacharya, Sumita, 1998. "An exact depth-first algorithm for the pallet loading problem," European Journal of Operational Research, Elsevier, vol. 110(3), pages 610-625, November.
    4. Narciso, Marcelo G. & Lorena, Luiz Antonio N., 1999. "Lagrangean/surrogate relaxation for generalized assignment problems," European Journal of Operational Research, Elsevier, vol. 114(1), pages 165-177, April.
    5. Dowsland, Kathryn A., 1987. "An exact algorithm for the pallet loading problem," European Journal of Operational Research, Elsevier, vol. 31(1), pages 78-84, July.
    6. L Lins & S Lins & R Morabito, 2003. "An L-approach for packing (ℓ, w)-rectangles into rectangular and L-shaped pieces," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(7), pages 777-789, July.
    7. Morabito, Reinaldo & Morales, Silvia Regina & Widmer, João Alexandre, 2000. "Loading optimization of palletized products on trucks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 36(4), pages 285-296, December.
    8. J. E. Beasley, 1985. "An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure," Operations Research, INFORMS, vol. 33(1), pages 49-64, February.
    9. E G Birgin & R Morabito & F H Nishihara, 2005. "A note on an L-approach for solving the manufacturer's pallet loading problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(12), pages 1448-1451, December.
    10. Dyckhoff, Harald, 1990. "A typology of cutting and packing problems," European Journal of Operational Research, Elsevier, vol. 44(2), pages 145-159, January.
    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. E G Birgin & R D Lobato & R Morabito, 2010. "An effective recursive partitioning approach for the packing of identical rectangles in a rectangle," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(2), pages 306-320, February.

    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. L Lins & S Lins & R Morabito, 2003. "An L-approach for packing (ℓ, w)-rectangles into rectangular and L-shaped pieces," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(7), pages 777-789, July.
    2. E G Birgin & R D Lobato & R Morabito, 2010. "An effective recursive partitioning approach for the packing of identical rectangles in a rectangle," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(2), pages 306-320, February.
    3. Lu, Yiping & Cha, Jianzhong, 2014. "A fast algorithm for identifying minimum size instances of the equivalence classes of the Pallet Loading Problem," European Journal of Operational Research, Elsevier, vol. 237(3), pages 794-801.
    4. Arenales, Marcos & Morabito, Reinaldo, 1995. "An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems," European Journal of Operational Research, Elsevier, vol. 84(3), pages 599-617, August.
    5. Martins, Gustavo H.A. & Dell, Robert F., 2008. "Solving the pallet loading problem," European Journal of Operational Research, Elsevier, vol. 184(2), pages 429-440, January.
    6. Hadjiconstantinou, Eleni & Christofides, Nicos, 1995. "An exact algorithm for general, orthogonal, two-dimensional knapsack problems," European Journal of Operational Research, Elsevier, vol. 83(1), pages 39-56, May.
    7. Martins, Gustavo H.A. & Dell, Robert F., 2007. "The minimum size instance of a Pallet Loading Problem equivalence class," European Journal of Operational Research, Elsevier, vol. 179(1), pages 17-26, May.
    8. Baldacci, Roberto & Boschetti, Marco A., 2007. "A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1136-1149, December.
    9. Chen, C. S. & Lee, S. M. & Shen, Q. S., 1995. "An analytical model for the container loading problem," European Journal of Operational Research, Elsevier, vol. 80(1), pages 68-76, January.
    10. Wascher, Gerhard & Hau[ss]ner, Heike & Schumann, Holger, 2007. "An improved typology of cutting and packing problems," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1109-1130, December.
    11. Sándor P. Fekete & Jörg Schepers, 2004. "A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing," Mathematics of Operations Research, INFORMS, vol. 29(2), pages 353-368, May.
    12. Letchford, Adam N. & Amaral, Andre, 2001. "Analysis of upper bounds for the Pallet Loading Problem," European Journal of Operational Research, Elsevier, vol. 132(3), pages 582-593, August.
    13. E G Birgin & R Morabito & F H Nishihara, 2005. "A note on an L-approach for solving the manufacturer's pallet loading problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(12), pages 1448-1451, December.
    14. Igor Kierkosz & Maciej Luczak, 2014. "A hybrid evolutionary algorithm for the two-dimensional packing problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 22(4), pages 729-753, December.
    15. Iori, Manuel & de Lima, Vinícius L. & Martello, Silvano & Miyazawa, Flávio K. & Monaci, Michele, 2021. "Exact solution techniques for two-dimensional cutting and packing," European Journal of Operational Research, Elsevier, vol. 289(2), pages 399-415.
    16. Felix Prause & Kai Hoppmann-Baum & Boris Defourny & Thorsten Koch, 2021. "The maximum diversity assortment selection problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 93(3), pages 521-554, June.
    17. Lins, Lauro & Lins, Sostenes & Morabito, Reinaldo, 2002. "An n-tet graph approach for non-guillotine packings of n-dimensional boxes into an n-container," European Journal of Operational Research, Elsevier, vol. 141(2), pages 421-439, September.
    18. Beasley, J. E., 2004. "A population heuristic for constrained two-dimensional non-guillotine cutting," European Journal of Operational Research, Elsevier, vol. 156(3), pages 601-627, August.
    19. Song, X. & Chu, C.B. & Lewis, R. & Nie, Y.Y. & Thompson, J., 2010. "A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting," European Journal of Operational Research, Elsevier, vol. 202(2), pages 368-378, April.
    20. Lodi, Andrea & Martello, Silvano & Vigo, Daniele, 1999. "Approximation algorithms for the oriented two-dimensional bin packing problem," European Journal of Operational Research, Elsevier, vol. 112(1), pages 158-166, 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:pal:jorsoc:v:59:y:2008:i:5:d:10.1057_palgrave.jors.2602367. 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.palgrave-journals.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.