IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i7p984-d1364013.html
   My bibliography  Save this article

Pallet Loading Problem: A Case Study in the Automotive Industry Applying a Simplified Mathematical Model

Author

Listed:
  • Naiara P. V. Sebbe

    (CIDEM, ISEP, Polytechnic of Porto, Rua Dr. António Bernardino de Almeida, 4249-015 Porto, Portugal
    Department of Mechanical Engineering, Faculty of Engineering, University of Porto, Rua Dr. Roberto Frias, 400, 4200-465 Porto, Portugal)

  • Francisco J. G. Silva

    (CIDEM, ISEP, Polytechnic of Porto, Rua Dr. António Bernardino de Almeida, 4249-015 Porto, Portugal
    Associate Laboratory for Energy, Transports and Aerospace (LAETA-INEGI), Rua Dr. Roberto Frias, 400, 4200-465 Porto, Portugal)

  • Alcinda M. S. Barreiras

    (CIDEM, ISEP, Polytechnic of Porto, Rua Dr. António Bernardino de Almeida, 4249-015 Porto, Portugal)

  • Isabel M. Pinto

    (CIDEM, ISEP, Polytechnic of Porto, Rua Dr. António Bernardino de Almeida, 4249-015 Porto, Portugal)

  • Rita C. M. Sales-Contini

    (CIDEM, ISEP, Polytechnic of Porto, Rua Dr. António Bernardino de Almeida, 4249-015 Porto, Portugal
    Technological College of São José dos Campos, Centro Paula Souza, Avenida Cesare Mansueto Giulio Lattes, 1350 Distrito Eugênio de Melo, São José dos Campos 12247-014, Brazil)

  • Luis P. Ferreira

    (CIDEM, ISEP, Polytechnic of Porto, Rua Dr. António Bernardino de Almeida, 4249-015 Porto, Portugal
    Associate Laboratory for Energy, Transports and Aerospace (LAETA-INEGI), Rua Dr. Roberto Frias, 400, 4200-465 Porto, Portugal)

  • Ana B. M. Machado

    (CIDEM, ISEP, Polytechnic of Porto, Rua Dr. António Bernardino de Almeida, 4249-015 Porto, Portugal)

Abstract

Logistics and the supply chain are areas of great importance within organizations. Due to planning gaps, an increase in extra and unnecessary transport costs is usually observed in several companies due to their commercial commitments and need to comply with the delivery time and the batch quantity of products, leading to a negative economic impact. Thus, the objective of this work was to adjust an optimization model to maximize the shipments usually carried out by the companies. To validate the model, an automotive components manufacturer was selected, allowing us to apply the model to a real case study and evaluate the advantages and drawbacks of this tool. It was found that the company to validate the model exports most of its products, and most pallets sent are not fully optimized, generating excessive expense for the company in terms of urgent transport. To solve this problem, two mathematical optimization models were used for the company’s current reality, optimizing the placement of boxes per pallet and customer. With the use of the new tool, it was possible to determine that five pallets should be sent to the customer weekly, which correspond to their needs, and that have the appropriate configurations so that the pallet is sent completely.

Suggested Citation

  • 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.
    • Handle: RePEc:gam:jmathe:v:12:y:2024:i:7:p:984-:d:1364013
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/7/984/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/12/7/984/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. 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.
    2. Gzara, Fatma & Elhedhli, Samir & Yildiz, Burak C., 2020. "The Pallet Loading Problem: Three-dimensional bin packing with practical constraints," European Journal of Operational Research, Elsevier, vol. 287(3), pages 1062-1074.
    3. Terno, Johannes & Scheithauer, Guntram & Sommerwei[ss], Uta & Riehme, Jan, 2000. "An efficient approach for the multi-pallet loading problem," European Journal of Operational Research, Elsevier, vol. 123(2), pages 372-381, June.
    4. J. E. Beasley, 1985. "An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure," Operations Research, INFORMS, vol. 33(1), pages 49-64, February.
    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. 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.
    7. 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).
    8. Zhu, Wenbin & Fu, Ying & Zhou, You, 2024. "3D dynamic heterogeneous robotic palletization problem," European Journal of Operational Research, Elsevier, vol. 316(2), pages 584-596.
    9. 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.
    10. Sheng, Liu & Hongxia, Zhao & Xisong, Dong & Changjian, Cheng, 2016. "A heuristic algorithm for container loading of pallets with infill boxes," European Journal of Operational Research, Elsevier, vol. 252(3), pages 728-736.
    11. Machline, Claude, 2011. "Cinco décadas de logística empresarial e administração da cadeia de suprimentos no Brasil," RAE - Revista de Administração de Empresas, FGV-EAESP Escola de Administração de Empresas de São Paulo (Brazil), vol. 51(3), May.
    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. 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.
    2. Carlos A. Vega-Mejía & Jairo R. Montoya-Torres & Sardar M. N. Islam, 2019. "Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review," Annals of Operations Research, Springer, vol. 273(1), pages 311-375, February.
    3. 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.
    4. Kurpel, Deidson Vitorio & Scarpin, Cassius Tadeu & Pécora Junior, José Eduardo & Schenekemberg, Cleder Marcos & Coelho, Leandro C., 2020. "The exact solutions of several types of container loading problems," European Journal of Operational Research, Elsevier, vol. 284(1), pages 87-107.
    5. 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.
    6. 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.
    7. McDonald, Conor M., 2016. "Integrating packaging and supply chain decisions: Selection of economic handling unit quantities," International Journal of Production Economics, Elsevier, vol. 180(C), pages 208-221.
    8. Jean-François Côté & Manuel Iori, 2018. "The Meet-in-the-Middle Principle for Cutting and Packing Problems," INFORMS Journal on Computing, INFORMS, vol. 30(4), pages 646-661, November.
    9. Bonet Filella, Guillem & Trivella, Alessio & Corman, Francesco, 2023. "Modeling soft unloading constraints in the multi-drop container loading problem," European Journal of Operational Research, Elsevier, vol. 308(1), pages 336-352.
    10. Bayliss, Christopher & Currie, Christine S.M. & Bennell, Julia A. & Martinez-Sykora, Antonio, 2021. "Queue-constrained packing: A vehicle ferry case study," European Journal of Operational Research, Elsevier, vol. 289(2), pages 727-741.
    11. Marco Antonio Boschetti & Lorenza Montaletti, 2010. "An Exact Algorithm for the Two-Dimensional Strip-Packing Problem," Operations Research, INFORMS, vol. 58(6), pages 1774-1791, December.
    12. Bortfeldt, Andreas & Wäscher, Gerhard, 2013. "Constraints in container loading – A state-of-the-art review," European Journal of Operational Research, Elsevier, vol. 229(1), pages 1-20.
    13. Juan Manuel Huertas Arango & German Pantoja-Benavides & Sebastián Valero & David Álvarez-Martínez, 2024. "Approaches for the On-Line Three-Dimensional Knapsack Problem with Buffering and Repacking," Mathematics, MDPI, vol. 12(20), pages 1-20, October.
    14. Sheng, Liu & Hongxia, Zhao & Xisong, Dong & Changjian, Cheng, 2016. "A heuristic algorithm for container loading of pallets with infill boxes," European Journal of Operational Research, Elsevier, vol. 252(3), pages 728-736.
    15. Silva, Elsa & Oliveira, José Fernando & Silveira, Tiago & Mundim, Leandro & Carravilla, Maria Antónia, 2023. "The Floating-Cuts model: a general and flexible mixed-integer programming model for non-guillotine and guillotine rectangular cutting problems," Omega, Elsevier, vol. 114(C).
    16. 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.
    17. 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.
    18. 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.
    19. Igor Kierkosz & Maciej Łuczak, 2019. "A one-pass heuristic for nesting problems," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 29(1), pages 37-60.
    20. 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.

    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:gam:jmathe:v:12:y:2024:i:7:p:984-:d:1364013. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.