Comparative Analysis of Algorithms for Cargo Container Space Optimization

This work delves into optimizing container space utilization in contemporary logistics and warehousing by addressing the intricate challenge of efficiently fitting various tire types into 2D and 3D containers. In our work we have used cutting-edge algorithms such as Next Fit, Best Fit Decreasing, Ge...

Full description

Saved in:
Bibliographic Details
Published in:2023 6th International Conference on Advances in Science and Technology (ICAST) pp. 319 - 324
Main Authors: Gadhikar, Lakshmi, Bomble, Sanskar, Chatur, Swayam, Karekar, Sarvesh, Khamkar, Sarvesh
Format: Conference Proceeding
Language:English
Published: IEEE 08-12-2023
Subjects:
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This work delves into optimizing container space utilization in contemporary logistics and warehousing by addressing the intricate challenge of efficiently fitting various tire types into 2D and 3D containers. In our work we have used cutting-edge algorithms such as Next Fit, Best Fit Decreasing, Genetic Algorithm, Dynamic Programming, and Ant Colony Optimization, the study aims to maximize container space utilization while offering insights into tire arrangement and container occupancy percentages. Our evaluation showed significant differences in algorithm performance regarding time and space complexity. Next Fit is simple but can lead to suboptimal space usage. Best Fit Decreasing optimizes space better but demands more computation. Genetic Algorithm and Dynamic Programming are competitive but resource-intensive. Ant Colony Optimization excels in container space optimization with a unique, nature-inspired approach. This study serves as a valuable reference for professionals and researchers tackling complex packing challenges in logistics and warehousing, fostering advancements in efficiency.
DOI:10.1109/ICAST59062.2023.10454999