liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A Multi-Heuristic Algorithm for Multi-Container 3-D Bin Packing Problem Optimization Using Real World Constraints
Linköping University, Department of Management and Engineering, Product Realisation. Linköping University, Faculty of Science & Engineering.ORCID iD: 0000-0001-7148-037X
Linköping University, Department of Management and Engineering, Product Realisation. Linköping University, Faculty of Science & Engineering.ORCID iD: 0000-0002-0248-8180
2024 (English)In: IEEE Access, E-ISSN 2169-3536, Vol. 12, p. 42105-42130Article in journal (Refereed) Published
Abstract [en]

With the growing demand for sustainable and optimal packaging solutions, this study proposes a novel two-stage algorithm for the multi-container three-dimensional bin packing problem. The research addresses this problem within the context of a real-world industrial scenario and implements several practical constraints including: full shipment, customer positioning requirements, and product geometric interlocking, for increased stability and with the purpose of minimizing the use of plastic wrapping and/or additional supporting surfaces. The main optimization target is to minimize the total number of containers used in the palletization process of custom orders with varying degrees of complexity. The proposed algorithm includes two stages/phases of processing. In the first phase, the algorithm uses constructive heuristics to generate homogeneous product layers. The layers are then stacked to produce blocks, which are then placed on individual containers or pallets. The second phase packs the leftover items using a genetic algorithm. The performance of the proposed solution is benchmarked using real-world industrial data, as well as a more classic academic benchmark. It is demonstrated, across a very large set of orders, that the algorithm always achieves solutions for full palletization of the orders. The analysis shows that the approach is generic and the quality of the solutions generated is relatively even for both small and large, homogeneous and heterogeneous problem instances.

Place, publisher, year, edition, pages
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC , 2024. Vol. 12, p. 42105-42130
Keywords [en]
Multi-container 3D-PP; 3D bin packing problem; multi-heuristic algorithm; industrial application; real world constraints
National Category
Computer Systems
Identifiers
URN: urn:nbn:se:liu:diva-202539DOI: 10.1109/ACCESS.2024.3378063ISI: 001192258100001OAI: oai:DiVA.org:liu-202539DiVA, id: diva2:1851982
Note

Funding Agencies|Strategic Innovation Program Produktion2030, a joint venture between Vinnova, Formas, and the Swedish Energy Agency

Available from: 2024-04-16 Created: 2024-04-16 Last updated: 2024-04-16

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Search in DiVA

By author/editor
Ananno, Anan AshrabiRibeiro, Luis
By organisation
Product RealisationFaculty of Science & Engineering
In the same journal
IEEE Access
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 98 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf