Optimizing maritime routes: A multi-method analysis from Shanghai to Vladivostok

Abstract

This research analyzes the marine route plan from Shanghai to Vladivostok utilizing Dijkstra’s algorithm, Markov chain analysis, game theory, and congestion analysis. Dijkstra determines the route through Busan and Hungnam as the shortest, with a total distance of 2114 kilometers and minimal travel time. The Markov chain analysis supported the designated path by demonstrating greater transition probabilities compared to other routes, so establishing it as the most probable option. Experts in game theory, particularly on the Nash equilibrium, demonstrated that cooperation significantly reduced operating expenses. Further congestion research corroborated that the Shanghai-Busan-Hungnam-Vladivostok route offers a cost advantage, and even with the inclusion of congestion, the route remains less expensive. The study collectively advocates for the consideration of distance, likelihood, collaboration, and congestion while selecting the optimal maritime route, hence enhancing efficiency in maritime logistics.