In this study, we propose a real-time ship anomaly detection method driven by Automatic Identification System (AIS) data. The method uses ship trajectory clustering classes as a normal model and a deep learning algorithm as an anomaly detection tool. The method is divided into three main steps: (1) quality maintenance of the original AIS data, (2) extraction of normal ship trajectory clusters using Density-Based Spatial Clustering of Applications with Noise (DBSCAN), in which a segmented improved Dynamic Time Warping (DTW) algorithm is used to measure the degree of trajectory similarity, (3) the clustering results are used as a normative model to train a Bi-directional Gated Recurrent Unit (BiGRU) recurrent neural network, which is used as a trajectory predictor to achieve real-time ship anomaly detection. Experiments were conducted using real AIS data from the port of Tianjin, China. The experimental results are manifold. Firstly, the data pre-processing process effectively improves the quality of raw AIS data. Secondly, the ship trajectory clustering model can accurately classify the traffic flow of different modes in the sea area. Moreover, the trajectory prediction result of the BiGRU model has the smallest error with the actual ship trajectory and has a better trajectory prediction performance compared with the Long Short-Term Memory Network model (LSTM) and Gated Recurrent Unit (GRU). In the final anomaly detection experiment, the detection accuracy and timeliness of the BiGRU model are also higher than LSTM and GRU. Therefore, the proposed method can achieve effective and timely detection of ship anomalous behaviors in terms of position, heading and speed during ship navigation, which provides insight to enhance the intelligence of marine traffic supervision and improve the safety of marine navigation.

The container ship stowage planning problem (CSPP) is a very complex and challenging issue concerning the interests of shipping companies and ports. This article has developed a many-objective CSPP solution that optimizes ship stability and reduces the number of shifts over the whole route while at the same time considering realistic constraints such as the physical structure of the ship and the layout of the container yard. Use the initial metacentric height (GM) along with the ship’s heeling angle and trim to measure its stability. Meanwhile, use the total amount of relocation in the container terminal yard, the voluntary shift in the container ship’s bay, and the necessary shift of the future unloading port to measure the number of shifts on the whole route. This article proposes a variant of the nondominated sorting genetic algorithm III (NSGA-III) combined with local search components to solve this problem. The algorithm can produce a set of non-dominated solutions, then decision-makers can choose the best practical implementation based on their experience and preferences. After carrying out a large number of experiments on 48 examples, our calculation results show that the algorithm is effective compared with NSGA-II and random weighted genetic algorithms, especially when applied to solve many-objective CSPPs.

To improve the efficiency of in-wharf vessels and out-wharf vessels in seaports, taking into account the characteristics of vessel speeds that are not fixed, a vessel scheduling method with whole voyage constraints is proposed. Based on multi-time constraints, the concept of a minimum safety time interval (MSTI) is clarified to make the mathematical formula more compact and easier to understand. Combining the time window concept, a calculation method for the navigable time window constrained by tidal height and drafts for vessels is proposed. In addition, the nonlinear global constraint problem is converted into a linear problem discretely. With the minimum average waiting time as the goal, the genetic algorithm (GA) is designed to optimize the reformulated vessel scheduling problem (VSP). The scheduling methods under different priorities, such as the first-in-first-out principle, the largest-draft-vessel-first-service principle, and the random service principle are compared and analyzed experimentally with the simulation data. The results indicate that the reformulated and simplified VSP model has a smaller relative error compared with the general priority scheduling rules and is versatile, can effectively improve the efficiency of vessel optimization scheduling, and can ensure traffic safety.