Un Modelo de optimización para el problema de reubicación dinámica de contenedores aplicado al puerto de Esmeraldas.

Abstract

The Dynamic Container Relocation Problem (DCRP) studies the emptying and storage of a respective number of containers in a bay in a storage yard, where each container follows a certain collection order to minimize the number of relocations carried out during the process of recovery. This curricular integration work focuses on analyzing the performance of the DCRP for instances of the commercial port of the city of Esmeraldas, where the arrival and departure sequences of the containers are known in advance. A binary integer linear programming model for the problem is presented, adapted to the conditions of the case. Next, the computational experiments are carried out on instances built according to the periods in which the entire planning horizon is subdivided, thus, with the data shared by the Port Authority of Esmeraldas, instances are constructed under three different approaches: a first approach examines daily periods, the second approach weekly periods and a third approach monthly periods. The results show that the DCRP under the weekly periods approach has a better performance than the other approaches studied for the used instances.