Approaches for the On-Line Three-Dimensional Knapsack Problem with Buffering and Repacking

Juan Manuel Huertas Arango, German Pantoja-Benavides, Sebastián Valero and David Álvarez-Martínez ()
Additional contact information
Juan Manuel Huertas Arango: School of Engineering, Los Andes University, Bogota 111711, Colombia
German Pantoja-Benavides: School of Engineering, Los Andes University, Bogota 111711, Colombia
Sebastián Valero: School of Engineering, Los Andes University, Bogota 111711, Colombia
David Álvarez-Martínez: School of Engineering, Los Andes University, Bogota 111711, Colombia

Mathematics, 2024, vol. 12, issue 20, 1-20

Abstract: The rapid growth of the e-commerce sector, particularly in Latin America, has highlighted the need for more efficient automated packing and distribution systems. This study presents heuristic algorithms to solve the online three-dimensional knapsack problem (OSKP), incorporating buffering and repacking strategies to optimize space utilization in automated packing environments. These strategies enable the system to handle the stochastic nature of item arrivals and improve container utilization by temporarily storing boxes (buffering) and rearranging already packed boxes (repacking) to enhance packing efficiency. Computational experiments conducted on specialized datasets from the existing literature demonstrate that the proposed heuristics perform comparably to state-of-the-art methodologies. Moreover, physical experiments were conducted on a robotic packing cell to determine the time that buffering and repacking implicate. The contributions of this paper lie in the integration of buffering and repacking into the OSKP, the development of tailored heuristics, and the validation of these heuristics in both simulated and real-world environments. The findings indicate that including buffering and repacking strategies significantly improves space utilization in automated packing systems. However, they significantly increase the time spent packing.

Keywords: buffering; repacking; heuristics; online packing problem (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/12/20/3223/pdf (application/pdf)
https://www.mdpi.com/2227-7390/12/20/3223/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:12:y:2024:i:20:p:3223-:d:1498936

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().