Container terminals play a crucial role in global logistics and trade, with gate-in operations significantly impacting overall terminal efficiency and cargo turnover speed. This paper analyzes a series of problems caused by the randomness of the arrival of export containers at the container yard, including wastage of yard space, excessive waiting time for external trucks, and conflicts with other production operations. To address these issues, a method based on a decomposed ensemble framework is proposed to predict short-term container quantities for gate-in operations at container terminal gates. The experiment compares the autoregressive integrated moving average (ARIMA) algorithm, the prophet algorithm, and the Long Short-Term Memory (LSTM) algorithm, with results indicating the clear advantage of Long Short-Term Memory in decomposed time series modeling. The introduction of this method is expected to enhance the accuracy and flexibility of terminal production planning, optimizing resource utilization. Contributions of this paper include the proposal of predictive models, a shipping route-based decomposed-ensemble framework, and confirmation of the superiority of Long Short-Term Memory in prediction through comparative analysis. These contributions are expected to improve terminal operational efficiency, reduce resource wastage, and better adapt to the highly stochastic gate-in operation environment.

With the development of economic globalization, shipping exchanges between countries are rapidly increasing and the container throughput of shipping ports has increased quickly, and the operation of most seaport terminals in China has reached a bottleneck which puts forward new requirements for the efficiency of container shipping terminal operations. Therefore, locating for export containers intelligently is of great significance for the development of terminals. This paper focuses on receiving containers intelligently, and establishes the export container locating model based on the principle of actual shipping terminal operations. The Monte Carlo Tree Search algorithm for export container locating problem was proposed and constructed. After examples, the algorithm can effectively solve the problem that meet the constraints, which further proves the practicability of the algorithm and the correctness of the model. The research shows that the method of locating for export container based on Monte Carlo Tree Search algorithm can effectively solve the problem and maintain the green, energy-saving and sustainable development of the shipping terminal. The ideas and methods have certain academic value and reference significance for other NP-Hard problems.

Increasing throughput at container terminals leads to higher yard occupancy rates, reduced yard service capacity, and inefficient use of space. These issues result in longer waiting times for trucks, underutilized yard slots, and longer distances between berth positions and the yard, particularly under high occupancy conditions. Traditional methods for allocating yard space fail to adequately consider dynamic container arrival patterns, conflict between container operations, and efficient use of yard resources. This paper introduces an innovative approach to improve yard efficiency by dividing yard container retrieval into time intervals and dynamically reserving yard slots within each interval. This method aims to minimize operational conflicts, reduce distances between blocks and berths, and avoid excessive reservations. We propose a dynamic reservation algorithm based on a reward-penalty mechanism to handle the problem's complexity and real-time demands. Furthermore, a time-series reward-penalty mechanism, which considers past reservation feedback and future reservation potential, ensures the concentration and continuity of container groups in the yard. Our evaluation metrics and multiple experimental scenarios demonstrate that this method significantly enhances yard efficiency and overall port productivity compared to static and other dynamic algorithms.