Search

The authors analyzed the navigation along the Northern Sea Route (NSR) and developed the pathfinding algorithm for its strategic assessment. It creates a framework connecting weather observations with shipping operational parameters: travel speed, travel time, travel distance, the necessity of icebreaker escort. It is based on the A* algorithm, the Arctic Ice Regime Shipping System (AIRSS) methodology, and empirical relationships between ship's speed and environmental data. The idea is to minimize travel time since sailing through areas with severe weather conditions requires speed reduction. The objective function finds the fastest safe path with minimal icebreaker escort. We used 2019–2020 environmental data to test the algorithm and analyzed daily optimal NSR transit routes for Eastbound and Westbound directions. It was shown that environmental parameters significantly affect the vessel's path, while ice parameters make the largest contribution. Depending on the ship's ice class and sailing season, it takes between 11 and 38 days to complete the entire route. All obtained operational parameters are valuable for assessing transportation costs, profitability, and riskiness of NSR. We provide their seasonal, monthly, and weekly values, and statistical parameters. [ABSTRACT FROM AUTHOR]

With the significant growth of world economy and container transportation, large seaports are under the pressure of higher requirements for handling efficiency and often involved in recurrent congestion. For those large seaports, shuttle vessels are usually run between terminals in order to fulfill container inter-terminal transshipment demand as well as to alleviate seaports' congestion effectively. This paper focuses on planning the shuttle vessel routing and scheduling, in which shuttle vessels connect a main terminal and neighboring terminals for container pickup. Two mixed-integer programming formulations are developed. The first model aims to minimize the total operational cost and the second further takes into account the time window requirement. A two-phase heuristic algorithm is devised to find a near-optimal solution within the short computational time for large-scale problems. According to the computational results, the first model shows high searching efficiency if cargo owners do not have time requirement. The two-phase heuristic algorithm shows both efficiency and effectiveness in searching near-optimal solution of the second model for large-scale instances considering time windows. The routing analysis indicates that terminal operators focus on time or no-load rate, respectively, when the waiting penalty shift from low to high. [ABSTRACT FROM AUTHOR]