Algoritmos heurísticos para la optimización del problema de asignación de contenedores en un puerto marítimo Thesis

short description

  • Undergraduate thesis

Thesis author

  • Hoyos Ortiz, Santiago

external tutor

  • Yepes Borrero, Juan Camilo

abstract

  • Optimizing container allocation in a port terminal involves developing efficient strategies to organize and move containers effectively. This includes considering factors such as space availability, duration of the transfer and minimization of time, taking into account whether the containers are destined for sea or land transport. By implementing optimization techniques, it is possible to improve the efficiency of container allocation. This not only streamlines processes at the container yard, but also helps maximize the port's productivity, sustainability and economic benefits. The main focus of this final degree project is to generate an improvement proposal for the container assignment problem, which minimizes the total time required for the assignment of each container in the blocks. To solve the problem, algorithmic and statistical concepts and strategies are used, specifically metaheuristic optimization methods such as the GRASP algorithm. Finally, through different experiments using the instances previously generated in the literature, the results of the GRASP with another existing proximity algorithm will be analyzed. In this way, it will be demonstrated which method generates the best solution for each case.

publication date

  • March 5, 2024 7:49 PM

keywords

  • Metaeuristic models
  • Optimization
  • Proximity algorithm

Document Id

  • aa8e1396-8820-412d-88da-decf3352406f