Integrated optimization of multi-machine scheduling and berth allocation in automated ore terminals

Abstract

As water transportation undergoes a new technological revolution, automated terminal technology has become a key issue in reducing costs and improving efficiency. However, the operation theory limitation makes it problematic for machines to cooperate effectively and operate profitably, which is notably salient at ore terminals with their unique structure. This study focuses on the integrated scheduling of a new automated ore terminal. It comprises three main processes: (a) berth allocation, (b) splitter scheduling, and (c) feeder scheduling. We attempt to tackle this issue by developing a mixed-integer linear programming (MILP) model to minimize the vessels’ maximum departure time. Considering the complexity of the MILP model, we propose a logic-based Benders decomposition algorithm to solve the efficiency problem. The results indicate that the algorithm can solve realistically sized problem instances. The main factors affecting the computation time are the congestion level, total cargo types, and vessel service time. The integrated scheduling methods can effectively solve the actual challenges faced by terminals and provide suggestions and references for terminal expansion planning.