Genetic and hybrid algorithms to solve the container stacking problem at Tripoli-Lebanon seaport

Several factors determined the survival of the seaport: logistics, storage and distribution. A storage strategy dependent on container stacking rules is an important factor in the competence of the container terminal. This article focuses on solving the problem of stacking incoming containers in the storage yard, taking into account several criteria regarding the port of Tripoli-Lebanon. A mathematical model with a mixed integer linear program for the container stacking problem is considered in this paper. As this problem is NP-hard, large instances cannot be solved by optimisation solvers as Gurobi. We develop four algorithms to tackle this problem: a genetic algorithm (GA), a randomised greedy algorithm (RGA), an iterated local search (ILS) and a hybridisation approach between RGA and ILS. Finally, numerical simulations prove the efficiency of the GA which produces results close to the optimal solution on real instances taken from the containers terminal for small and medium sizes.