Simulation-Based Maritime Scheduling Optimization for Bidirectional Ship Flow in Multi-Chamber Lock Systems: Incorporating Chamber Operations for Efficient Management

Abstract

This paper addresses the bidirectional multi-chamber lock scheduling problem by formulating a multi-objective mixed-integer linear programming (MILP) model that simultaneously minimizes average ship waiting time and maximizes chamber utilization. A tailored adaptive large neighborhood search (ALNS) algorithm is developed specifically based on the principle of the destruction and reconstruction of solutions. The algorithm efficacy is validated using the real-word data from Huai’an Lock of the Subei canal. The scheduling rules and parameters are defined from practical operation records. Simulation results demonstrate that the ALNS-based optimization significantly improves lock performance with average chamber utilization increasing by 12.98% and waiting time decreasing by 44.40%. Sensitivity analyses on objective weights further confirm the robustness of the proposed method. Benchmark comparisons with a greedy heuristic, genetic algorithm (GA), and particle swarm optimization (PSO) highlight the effectiveness and computational efficiency of ALNS. This study further explores a threshold-based directional control strategy, showing that relaxing strict alternating-direction rules under asymmetric traffic demand can improve efficiency. The findings provide practical insights for lock scheduling, offering decision support for lock authorities in designing adaptive scheduling and directional control policies.

Bibliographic Information