<![CDATA[Background of Study: The 3D Bin Packing Problem (3D-BPP) is an NP-hard problem crucial for logistics and supply chain optimization, aiming to efficiently pack boxes into containers while maximizing space and maintaining stability. Traditional heuristics like First Fit and Best Fit are fast but lack optimality and adaptability in dynamic environments. Metaheuristic approaches, such as Genetic Algorithms (GA), offer better solutions but with higher computational costs.Aims and Scope of Paper: This study presents a comparative analysis of First Fit, Best Fit, and a custom Genetic Algorithm as packing strategies for 3D-BPP. It evaluates these methods against multiple performance metrics to understand their trade-offs and proposes future research directions.Methods: The study uses a dataset of 5,000 cargo records from an Indonesian logistics company, including item dimensions and weights, preprocessed for normalization and filtering. A 3D simulation environment built with PyBullet visualizes the packing process. Performance metrics include space utilization, total packed weight, packing time, access efficiency, stability score, and placement success rate. A Wall-Building heuristic acts as a fallback for unplaced items.Result: First Fit provides fast, lightweight solutions suitable for real-time applications. Best Fit shows marginally better space utilization but lacks robustness. The Genetic Algorithm outperforms both heuristics in packing quality, accessibility, and load stability, though with significantly higher computation time. No single algorithm dominates across all metrics.Conclusion: The choice of packing method should align with specific operational constraints: speed, compactness, or quality. A hybrid model combining heuristic initialization with GA refinement is a promising direction for future research to develop more intelligent, context-aware packing systems.]]>
Copyrights © 2025
