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

A simple and effective recursive procedure for the manufacturer's pallet loading problem

Author

Listed:
  • R Morabito

    (Universidade Federal de São Carlos)

  • S Morales

    (Universidade Federal de São Carlos)

Abstract

In this paper we present a simple and effective heuristic to solve the problem of packing the maximum number of rectangles of sizes (l,w) and (w,l) into a larger rectangle (L,W) without overlapping. This problem appears in the loading of identical boxes on pallets, namely the manufacturer's pallet loading (MPL), as well as in package design and truck or rail car loading. Although apparently easy to be optimally solved, the MPL is claimed to be NP-complete and several authors have proposed approximate methods to deal with it. The procedure described in the present paper can be seen as a refinement of Bischoff and Dowsland's heuristic and can easily be implemented on a microcomputer. Using moderate computational resources, the procedure was able to find the optimal solution of 99.9% of more than 20 000 examples analysed.

Suggested Citation

  • R Morabito & S Morales, 1998. "A simple and effective recursive procedure for the manufacturer's pallet loading problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 49(8), pages 819-828, August.
    • Handle: RePEc:pal:jorsoc:v:49:y:1998:i:8:d:10.1057_palgrave.jors.2600588
    DOI: 10.1057/palgrave.jors.2600588
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2600588
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2600588?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. M. T. Alonso & R. Alvarez-Valdes & F. Parreño, 2020. "A GRASP algorithm for multi container loading problems with practical constraints," 4OR, Springer, vol. 18(1), pages 49-72, March.
    2. Wei, Lijun & Hu, Qian & Lim, Andrew & Liu, Qiang, 2018. "A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem," European Journal of Operational Research, Elsevier, vol. 270(2), pages 448-474.
    3. Hugo Barros & Teresa Pereira & António G. Ramos & Fernanda A. Ferreira, 2021. "Complexity Constraint in the Distributor’s Pallet Loading Problem," Mathematics, MDPI, vol. 9(15), pages 1-20, July.
    4. Linda S. Moonen & Frits C. R. Spieksma, 2006. "Exact Algorithms for a Loading Problem with Bounded Clique Width," INFORMS Journal on Computing, INFORMS, vol. 18(4), pages 455-465, November.
    5. 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.
    6. Naiara P. V. Sebbe & Francisco J. G. Silva & Alcinda M. S. Barreiras & Isabel M. Pinto & Rita C. M. Sales-Contini & Luis P. Ferreira & Ana B. M. Machado, 2024. "Pallet Loading Problem: A Case Study in the Automotive Industry Applying a Simplified Mathematical Model," Mathematics, MDPI, vol. 12(7), pages 1-17, March.
    7. 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.
    8. Adamos Daios & Nikolaos Kladovasilakis & Ioannis Kostavelis, 2024. "Mixed Palletizing for Smart Warehouse Environments: Sustainability Review of Existing Methods," Sustainability, MDPI, vol. 16(3), pages 1-15, February.
    9. E G Birgin & J M Martínez & W F Mascarenhas & D P Ronconi, 2006. "Method of sentinels for packing items within arbitrary convex regions," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(6), pages 735-746, June.
    10. 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.
    11. Lorenzo Brunetta & Philippe Grégoire, 2005. "A General Purpose Algorithm for Three-Dimensional Packing," INFORMS Journal on Computing, INFORMS, vol. 17(3), pages 328-338, 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:pal:jorsoc:v:49:y:1998:i:8:d:10.1057_palgrave.jors.2600588. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.