This paper presents a mixed-integer linear programming (MILP) model for scheduling container handling activities at maritime terminals. The model coordinates the assignment and sequencing of trailers and reach stackers for both import and export containers, synchronizing the vehicles’ operation to minimize waiting time. Computational experiments show that the model generates optimal schedules across various instance sizes. While small and medium instances are solved within a reasonable amount of time, larger instances exhibit increased computation time due to the problem’s combinatorial complexity. These results validate the model as a reliable foundation for vehicle scheduling in terminal environments and emphasize the need for more scalable solution approaches.
Optimizing Port Terminal Vehicle Scheduling for Containership Berth Operations
Baratzadeh A.;Paolucci M.;Sciomachen A.
2026-01-01
Abstract
This paper presents a mixed-integer linear programming (MILP) model for scheduling container handling activities at maritime terminals. The model coordinates the assignment and sequencing of trailers and reach stackers for both import and export containers, synchronizing the vehicles’ operation to minimize waiting time. Computational experiments show that the model generates optimal schedules across various instance sizes. While small and medium instances are solved within a reasonable amount of time, larger instances exhibit increased computation time due to the problem’s combinatorial complexity. These results validate the model as a reliable foundation for vehicle scheduling in terminal environments and emphasize the need for more scalable solution approaches.| File | Dimensione | Formato | |
|---|---|---|---|
|
1-s2.0-S2352146526001973-main.pdf
accesso aperto
Tipologia:
Documento in Post-print
Dimensione
398.71 kB
Formato
Adobe PDF
|
398.71 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.



