Comparison of Container Routing in Liner Shipping Networks

The increasing volatility of liner shipping networks, characterized by frequent capacity reallocations and schedule disruptions, calls for robust and com-parable container routing models. This paper presents a systematic comparison of two approaches: the Connection Scan Algorithm (CSA) and the RAPTOR algo-rithm. To enable a model-independent assessment, routes are projected onto a canonical representation based on sequences of ports and liner services. Using a set of scenarios to increase network complexity, routing outcomes, computational performance, and route similarity between the two approaches are evaluated. The results show that CSA and RAPTOR exhibit greater sensitivity to network dynam-ics, generating structurally different routes with more transshipments, particularly in large and volatile scenarios. The proposed framework provides a unified basis for comparing heterogeneous routing models and highlights trade-offs between computational efficiency, temporal realism, and robustness, offering guidance for both strategic planning and operational analysis in modern liner shipping networks.