This paper was published through Galoá and has a deposited DOI. To cite this paper, use one of the standards below:
In case you are one of the co-authors and want to register this paper in your Lattes, use the following code: doi > 10.59254/sbpo-2024-193632
If you've NEVER registered a DOI in your Lattes, check our tutorial!The problem of Bin Packing (BPP) is widely studied due to its practical application in areas such as logistics, manufacturing, and resource management. In practice, these problems are common in applications such as vehicle loading, product cutting processes, and packaging. Therefore, the aim of this article is to propose the use of the First Fit Decreasing (FFD) heuristic to solve a Bin Packing problem in the context of the fashion retail sector. Considering specific constraints such as volume, weight, and others related to the logistics of this sector, FFD was applied to optimize the packaging of items in boxes. The results are compared with an exact modeling approach, demonstrating the effectiveness of FFD in providing competitive solutions in a computationally efficient manner.
With nearly 200,000 papers published, Galoá empowers scholars to share and discover cutting-edge research through our streamlined and accessible academic publishing platform.
Learn more about our products:
This proceedings is identified by a DOI , for use in citations or bibliographic references. Attention: this is not a DOI for the paper and as such cannot be used in Lattes to identify a particular work.
Check the link "How to cite" in the paper's page, to see how to properly cite the paper