The multi-trip container drayage problem with synchronization for multi-size empty containers re-usage

Abstract

This thesis investigates a container drayage problem involving terminals, depots, and shippers. Each terminal operates a homogeneous fleet of trucks that start and end at their respective terminals, carrying either one 40ft or two 20ft containers, and can make multiple trips within a single planning horizon. Terminals handle full containers and maintain a limited stock of empty containers, while depots provide additional empty containers. Shippers have specific time windows for service, and requests include sending and receiving empty or full containers to designated terminals, with street turns of empty containers possible. An Adaptive Large Neighborhood Search (ALNS) algorithm is implemented to address this problem, outperforming traditional methods like CPLEX. Extensive computational experiments validate the ALNS algorithm's efficacy, highlighting the logistical benefits of optimal depot placement and the impact of street turns, emphasizing the practical implications for container logistics.