In the past, most researchers have paid attention to the storage space allocation problem in maritime container terminals, while few have studied this problem in rail–water intermodal container terminals. Therefore, this paper proposes a storage space allocation problem to look for a symmetry point between the efficiency and effectivity of rail–water intermodal container terminals and the unbalanced allocations and reallocation operations of inbound containers in the railway operation area, which are two interactive aspects. In this paper, a two-stage model on the storage space allocation problem is formulated, whose objective is to balance inbound container distribution and minimize overlapping amounts, considering both stacking principles, such as container departure time, weight and stacking height, and containers left in railway container yards from earlier planning periods. In Stage 1, a novel simulated annealing algorithm based on heuristics is introduced and a new heuristic algorithm based on a rolling horizon approach is developed in Stage 2. Computational experiments are implemented to verify that the model and algorithm we introduce can enhance the storage effect feasibly and effectively. Additionally, two comparison experiments are carried out: the results show that the approach in the paper performs better than the regular allocation approach and weight constraint is the most important influence on container storage.
Stowage plan, which is planning for a reasonable movement of containers, plays an important role in enhancing the efficiency and competitiveness of container terminals. The time required for handling containerships also depends on the operations of quay cranes, which is one of the most expensive equipment in container terminals. Hence, this paper integrates stowage planning and crane split problem to minimize the total berthing time at each visiting port over the voyage. A new mathematical model is developed, which covers a wide range of operational and structural constraints for both stowage plan and crane operation. An improved genetic algorithm based on a novel encoding mode of assignment strategies, including container grouping and operation strategies, is designed to solve the problem, which also introduces penalty operations to solve the infeasible solutions. Finally, some computational experiments are carried out. Firstly, three small-sized experiments are implemented to verify the feasibility of the proposed model and algorithm. Secondly, large-sized experiments with 5 ports, 3385 containers, and 2 quay cranes show that the proposed approach can solve the integration problem with different productivity of quay cranes effectively and decrease the berthing time by 6.0%. Eventually, a comparison experiment with 5 ports, 5752 containers, and 2 quay cranes is conducted, and the results indicate that the proposed algorithm results in 62.3% and 87.7% decrease in the total number of rehandling times and computational time. Meanwhile, the results also show that the proposed algorithm can be convergent. So the proposed algorithm is effective and efficient in solving the integration problem and enhancing the efficiency of container terminals.
Storage space allocation and handling operation problems are two main crucial problems in container terminals. Early research efforts, however, are seldom devoted to studying them together. So, this paper considers these two problems simultaneously for outbound containers in rail-water intermodal container terminals (RWICTs), where rail mounted gantry cranes, inner trucks and quay cranes are involved. A two-stage problem is proposed: Stage 1 is to determine locations of the containers and reduce the overlapping amount, considering container weight, departure time, destination ports and containers left from earlier planning periods in railway container yards; according to the locations of containers from Stage 1, Stage 2 aims at obtaining optimal job sequences of different types of equipment and minimizing makespans of handling operations, considering some operational constraints, particularly rehandling time and inner truck congestion. To solve the problem, a two-stage heuristic algorithm is proposed, where the rolling planning horizon and a new update strategy are introduced. A heuristic algorithm is introduced in Stage 1 and a novel two-layer genetic algorithm is proposed in Stage 2, which introduces proximity principles and the reselection operation. Afterwards, the results from Stage 2 are used to resolve the first stage problem, while the problem in Stage 2 is also resolved using the new results from Stage 1. This iterative process continues until there are no more improvements in Stage 1. Finally, the results of the computational experiments indicate that the proposed model and solution approach are effective and efficient in solving the two-stage problem for outbound containers in RWICTs.
In the past, most researchers focused on the storage space allocation problem or container block allocation problem in maritime container terminals, while few studied the container slot allocation problem in rail–water intermodal container terminals. Container slot allocation problem is proposed to reduce relocation operations of containers in railway container yards and improve the efficiency of rail–water intermodal container terminals. In this paper, a novel outbound container slot allocation model is introduced to reduce the rehandling operations, considering stowage plan, containers left from earlier planning periods and container departure time. A novel heuristic algorithm based on the rolling planning horizon approach is developed to solve the proposed problem effectively. Computational experiments are carried out to validate that the proposed model and algorithm are feasible and effective to enhance the storage effect. Meanwhile, some other experiments are conducted to verify that our approach is better than the regular allocation approach, which is a common method in marine and railway container terminals, and container weight is the most important influence factor when storing containers.
In order to address the diverse and personalized needs of consumers for fresh products, as well as to enhance the efficiency and safety of fresh product delivery, this paper proposes an integer programming model aimed at minimizing total distribution costs. The model takes into account the cold storage multi-temperature joint distribution mode, carbon emission costs, and actual constraints associated with the distribution process of fresh products. To solve this model, an improved salp swarm algorithm (SSA) has been developed. The feasibility and effectiveness of both the proposed model and algorithm are demonstrated using R110 data from the Solomon standard calculation example. Research findings indicate that compared to traditional single-product temperature distribution modes, the multi-temperature joint distribution mode achieves reductions in total distribution costs and vehicle quantities by 45.4% and 72.2%, respectively. Furthermore, it is observed that total distribution costs increase with rising unit carbon tax prices; however, the rate of growth gradually diminishes over time. Additionally, a reduction in vehicle load capacity results in a continuous rise in total delivery costs after reaching a certain turning point. When compared to conventional SSAs and genetic algorithms, the proposed algorithm demonstrates superior performance in generating optimal multi-temperature joint distribution route schemes for fresh products.