A Binary Integer Programming Formulation and Solution for Truck Appointment Scheduling and Reducing Truck Turnaround Time in Container Terminals

2021 ◽  
Author(s):  
Ahmed M. Abdelmagid ◽  
Mohamed S. Gheith ◽  
Amr B. Eltawil
2021 ◽  
Vol 15 ◽  
pp. 174830262199401
Author(s):  
Hammed Bisira ◽  
Abdellah Salhi

There are many ways to measure the efficiency of the storage area management in container terminals. These include minimising the need for container reshuffle especially at the yard level. In this paper, we consider the container reshuffle problem for stacking and retrieving containers. The problem was represented as a binary integer programming model and solved exactly. However, the exact method was not able to return results for large instances. We therefore considered a heuristic approach. A number of heuristics were implemented and compared on static and dynamic reshuffle problems including four new heuristics introduced here. Since heuristics are known to be instance dependent, we proposed a compatibility test to evaluate how well they work when combined to solve a reshuffle problem. Computational results of our methods on realistic instances are reported to be competitive and satisfactory.


Author(s):  
Rodrigo Alexander Castro Campos ◽  
Sergio Luis Pérez Pérez ◽  
Gualberto Vazquez Casas ◽  
Francisco Javier Zaragoza Martínez

Sign in / Sign up

Export Citation Format

Share Document