The Lean-Branch-and-Bound Structure Effectiveness in Enhancing the Logistic Stowage Methodology for the Regular Shapes

Abstract

An excellent e-commerce logistic cycle is based on reducing the delivery time to satisfy customers, accelerating the distribution chain activities at each delivery station, increasing the transported stowage objects for mobilization parallelograms containers to ingest most orders, and reducing the unused area. Because the stowage steps are considered an NP-complexity, the authors introduce the Oriented Stowage Map (OSM) using one of the heuristic methods (i.e., the camel algorithm) that are programmed by the C-sharp software to be easily managed via the Internet of Things (IoT), which is embedded in the distribution chain. The authors called it Oriented Stowage’s Map by Camel algorithm “OSM-CA”. This methodology is considered one of the mat-heuristic approaches (i.e., decomposition metaheuristics) because we resorted to using mathematical steps (branch-and-bound). The OSM-CA reduces transport costs by 7% and delivery time by 14%. Additionally, it shows superiority over the solo Ant-colony for stowage less than 50 boxes by 10% and over the solo camel algorithm by 27%, while for more than 50 boxes, the OSM-CA superiority by 30% over the ant colony, and 17% over the camel algorithm. Creating the map in the proposed way takes 70% less time than using mathematical models, especially for a large number of orders, more than 200.