Parametric analysis of evolutionary algorithms for the storage location of outbound containers at a seaport terminal

The research aims to minimise the handling time of containers in the storage yard. In such a way it finds an efficient strategy and a loading schedule that avoids unnecessary container moves in the yard. Two loading strategies are examined, namely LCFS and FCFS in terms of handling time in the storage area. Results show that an LCFS loading schedule is far more efficient than an FCFS schedule. A genetic algorithm (GA) is used to optimise both loading schemes. The objectives of the optimisation problem are two-fold: on the one hand one wants to minimise the handling time, and on the other hand one wants to minimise the number of re-handles. The effect of the genetic operators on the solutions are analysed and results show that a GA with mutation as operator only is best in finding efficient solutions. A sensitivity analysis based on Sobol’s method is carried out to test the importance of the parameter values of the GA.