9. Adapted Bin-Packing Algorithm for the Yard Optimization Problem

Given the importance of the Maritime transportation to move goods between continent, optimizing their processes becomes the objective of many types of research. In this paper, we present a new model of the yard optimization problem which contains three important components: unloading/loading, transfer and storage process. Our proposed method called Adapted Bin Packing Algorithm for the yard optimization problem (ABPAYOP) focus on using the approach of the Bin packing algorithm to build Bins (free positions in the yard, subgroup of containers) this will be a generalization of the container stacking problem as it will include the use of yard cranes, quay cranes and internal trucks. the ABPAYOP solutions can be represented as a set of disjoint clusters satisfying of given number of constraints (yard bays, subgroup of containers). In this work, we present the new formulation of the yard optimization problem, then we will apply our heuristic ABPAYOP to solve it. Computational results are presented at the end using instances created and adapted to the ones existing in the literature. Our results illustrate the performance of the applied method for the medium and big instances.