Joint planning of berth and yard allocation in transshipment terminals using multi-cluster stacking strategy

In this work, a joint planning problem for berth and yard allocation in transshipment terminals is addressed. Multi-cluster stacking strategy is proposed to split each transshipment flow into a number of container clusters and then stack each cluster in different yard blocks. A mixed integer quadratic programming model is formulated to minimize the total distance of exchanging containers between mother vessels and feeders, and the workload imbalance among yard blocks. A novel three-stage heuristic solution approach is developed and extensive numerical experiments are conducted to show the effectiveness of the proposed approach and the benefit of the multi-cluster strategy.     

Tactical berth and yard template design at container transshipment terminals: A column generation based approach

Quay-side berthing congestion is an emerging challenging issue that arises in busy container transshipment terminals and calls for effective management of terminal operations. This paper tackles the berthing congestion problem by introducing a proactive management strategy from the terminal’s perspective that adjusts the calling schedule of feeder vessels in such a way that the quay-side workload distribution in the temporal dimension can be balanced. Such a schedule template design problem is considered simultaneously with another two tactical level decision problems, berth template design (i.e., determining preferred berthing positions for vessels) and yard template design (i.e., allocating storage yard space to transshipment flows). This highly integrated problem is formulated as a set covering model. Heuristic methods based on column generation are developed to obtain near-optimal solutions in an efficient way. Computational experiments on real-world sized test instances demonstrate the efficiency and effectiveness of the proposed approach.     

Optimal space for storage yard considering yard inventory forecasts and terminal performance

This paper presents a method for forecasting the yard inventory of container terminals over an extended period, and addresses an integrated yard planning problem for determining the optimal storage space utilization by considering the yard congestion effect on terminal performance. A formulation based on random variables and probabilistic functions was developed, which allows prediction of the storage space requirement without requiring fully-integrated simulation models. Then, an integrated cost objective function was defined. Numerical experiments were performed to illustrate how the forecasting model works and to support decision-making on yard planning and design for both inbound and outbound/transshipment areas.     

A heuristic algorithm for yard truck scheduling and storage allocation problems

The yard truck scheduling and the storage allocation are two important decision problems affecting the efficiency of container terminal operations. This paper proposes a novel approach that integrates these two problems into a whole. The objective is to minimize the weighted sum of total delay of requests and the total travel time of yard trucks. Due to the intractability of the proposed problem, a hybrid insertion algorithm is designed for effective problem solutions. Computational experiments are conducted to examine the key factors of the problem and the performance of the proposed heuristic algorithm.     

Container storage and transshipment marine terminals

This study addresses the storage arrangement of transshipment containers on a container yard, in order to carry out efficiently the ship handling operations at a terminal where mega-containerships call. An optimization model is specified to investigate the flow of containers from the mega-containership to feeder ships using intermediate storage at the yard. A heuristic based on the lagrangian relaxation is formulated. The quality of the heuristic approach is tested in a number of experiments. In the experiments, various situations are analyzed with respect to mega-containership arrival rates, some strategies for stack arrangements and terminal layouts.     

The simultaneous berth and quay crane allocation problem

This paper addresses efficient berth and crane allocation scheduling at a multi-user container terminal. First, we introduce a formulation for the simultaneous berth and crane allocation problem. Next, by employing genetic algorithm we develop a heuristic to find an approximate solution for the problem. The fitness value of a chromosome is obtained by crane transfer scheduling across berths, which is determined by a maximum flow problem-based algorithm based on a berth allocation problem solution defined by the chromosome. The results of numerical experiments show that the proposed heuristic is applicable to solve this difficult but essential terminal operation problem.     

The integrated yard truck and yard crane scheduling problem: Benders’ decomposition-based methods

This paper proposes a novel integrated model for yard truck and yard crane scheduling problems for loading operations in container terminal. The problem is formulated as a mixed-integer programming model. Due to the computational intractability, two efficient solution methods, based on Benders’ decomposition, are developed for problem solution; namely, the general Benders’ cut-based method and the combinatorial Benders’ cut-based method. Computational experiments are conducted to evaluate the effectiveness of the proposed solution methods.     

Determining fixed crane areas in rail–rail transshipment yards

To enable rapid container transshipment between freight trains in modern rail–rail transshipment yards efficient computerized scheduling procedures are indispensable. This paper proposes a dynamic programming approach, which determines yard areas for gantry cranes, so that the workload is evenly spread among cranes and, thus, train processing is accelerated. In a straightforward simulation of transshipment yard operations, the effect of optimal crane areas vs. equally sized areas is studied, the latter being a common real-world policy. The results indicate a remarkable speed-up of train processing if optimal crane areas are applied.     

Models and algorithms for multi-crane oriented scheduling method in container terminals

“Multi-crane oriented” is a scheduling method that yard trailers can be shared by different quay cranes. In this paper, two models for this problem are developed. The first one is a model for an inter-ship-based sharing method. In this model, yard trailers can be shared by quay cranes of different ships. To solve the model, a two-phase Tabu search algorithm is designed. The second one is a model for a ship-based sharing method. In this model, yard trailers can only be shared by quay cranes of the same ship. Q-learning algorithm is designed to solve the model. Numerical tests show that the “multi-crane oriented” method can decrease the yard trailers’ travel distance, reduce the disequilibrium of different working lines, and thus improve the operation efficiency in container terminals.     

Liner ship fleet deployment with container transshipment operations

This paper proposes a liner ship fleet deployment (LSFD) problem with container transshipment operations. The proposed problem is formulated as a mixed-integer linear programming model which allows container transshipment operations at any port, any number of times, without explicitly defining the container transshipment variables. Experiments on the Asia-Europe-Oceania shipping network of a global liner shipping company show that more than one third (17-22 ports) of the total of 46 ports have transshipment throughputs. Computational studies based on randomly generated large-scale shipping networks demonstrate that the proposed model can be solved efficiently by CPLEX.     

Space allocating strategies for improving import yard performance at marine terminals

This paper focuses on the organization of the import storage yard at container port terminals. Three new stacking strategies are introduced which take into account the containers’ arrival and departure rates and the storage yard characteristics. A mathematical model based on probabilistic distribution functions is developed to estimate the number of rehandles required to manage an import container yard. The model is applied to the three proposed stacking strategies. Results show that the optimal strategy depends on stacking height and the relationship between vessel headway and container dwell time.     

A hybrid parallel genetic algorithm for yard crane scheduling

This paper aims at postulating a novel strategy in terms of yard crane scheduling. In this study, a dynamic scheduling model using objective programming for yard cranes is initially developed based on rolling-horizon approach. To resolve the NP-complete problem regarding the yard crane scheduling, a hybrid algorithm, which employs heuristic rules and parallel genetic algorithm (PGA), is then employed. Then a simulation model is developed for evaluating this approach. Finally, numerical experiments on a specific container terminal yard are used for system illustration. Computational results suggest that the proposed method is able to solve the problem efficiently.     

Migration of container terminals as their natural process of evolution: Case study of Gdańsk and Gdynia ports

The paper proposes a theoretical model of container terminals and container port development, based on the life cycle theory, threshold theory and catastrophe theory, and in references to Kuznets' swings (interpreted as waves of infrastructural investments), and Kondratiev long economic waves.The aim of this model is to explain the development process of a container terminal and a port within one technological generation, as well as in intergenerational configuration, and relate it to the migration process of container terminals in the scale of a port-city urban area. Then, the applicability of this model was checked in the case of the container ports in Gdynia and Gdańsk (Poland). The analysed evolution process of ports of Gdynia and Gdańsk conforms with the proposed theoretical model, proving that the migration of container terminals within these ports is a part of their natural process of evolution, being a consequence of their threshold development and location splitting.Considering the physical location of development investments within the container ports of Gdańsk and Gdynia, it was noticed that there are two basic directions of migration of container terminals. One is the migration of the port's main container activity (core terminal or terminals), being a result of a generational change taking place after overcoming the maturity point. The second type of migration is connected with dispersion of port development investments in the increasingly distant port hinterland, caused by the need of the life extension of terminals within one technological generation.In an analogy to the processes of development of living organisms, we can treat the migration of terminal outsourced functions as a “vegetative” increase, being an attempt to extend the life of the terminal, while the migration of the core terminal within the port area (erecting a new generation terminal) can be treated as “generative” growth.     

Effect of block width and storage yard layout on marine container terminal performance

Block widths ranging from two to fifteen rows in a marine container terminal are evaluated by a fully-integrated, discrete event simulation model. Experiments consider dozens of yard configurations and four container terminal settings that are designed to reproduce the microscopic, stochastic, real-time environment at a multiple-berth facility. Results show that the quay crane rate is concave with respect to block width when the yard storage capacity and amount of yard equipment is constant. The optimal block width ranges from 6 to 12 rows depending on the amount of equipment deployed and the size, shape, and throughput of the terminal.     

A robust optimization approach to the integrated berth allocation and quay crane assignment problem

This paper investigates the integrated berth allocation and quay crane assignment problem in container terminals. A deterministic model is formulated by considering the setup time of quay cranes. However, data uncertainties widely exist, and it may cause the deterministic solution to be infeasible. To handle the uncertainties, a robust optimization model is established. Furthermore, to control the level of conservativeness, another robust optimization model with the price constraints is proposed. A genetic algorithm and an insertion heuristic algorithm are suggested to obtain near optimal solutions. Computational experiments indicate that the presented models and algorithms are effective to solve the problems.     

The impact of container terminal relocation on hinterland geography

This paper presents a mathematical model for calculating the generalized costs resulting from the transportation of containers from multiple locations in a geographical region to different container terminals serving this region. The generalized costs are calculated using a road and rail transport network model, enabling potential hinterlands of terminals in close competition to be delimited, rather than port hinterlands as is more common in the literature. The mathematical model is used in a case study on the consequences of building a new terminal in the port of Lisbon and closing down an existing terminal, implying a terminal relocation between river banks. The model shows that this relocation has significant implications in the delimitation of container terminal potential hinterlands across southern Portugal. Conclusions and policy recommendations regarding the consequences of such relocation are given in terms of relative competitiveness of the different terminals and suitability of the relocation.     

Sailing speed optimization for container ships in a liner shipping network

This paper first calibrates the bunker consumption - sailing speed relation for container ships using historical operating data from a global liner shipping company. It proceeds to investigate the optimal sailing speed of container ships on each leg of each ship route in a liner shipping network while considering transshipment and container routing. This problem is formulated as a mixed-integer nonlinear programming model. In view of the convexity, non-negativity, and univariate properties of the bunker consumption function, an efficient outer-approximation method is proposed to obtain an ε-optimal solution with a predetermined optimality tolerance level ε. The proposed model and algorithm is applied to a real case study for a global liner shipping company.     

The strategic berth template problem

A marine container terminal operator may have a situation with excessive calling requests to be served especially when some new service contracts are under consideration. For this situation, we propose a strategic berth template problem (BTPS) that selects the ships among the requesting ones to be served and arrange their berth-windows within a limited planning horizon. The BTPS employs the subgradient optimization procedure, which is an improved version of the procedure that the authors developed for the operational berth allocation problem. A wide variety of numerical experiments indicate the improved subgradient procedure works well for the BTPS.     

Path to a multilayered transshipment port system: How the Yangtze River bulk port system has evolved

China's steel output has maintained rapid growth over the past twenty years. Due to this, a large number of iron ore ports/terminals have been built along the Yangtze River, and the Yangtze River bulk port system has experienced a unique development in its structure. This paper aims to understand the evolution of this bulk port system.¹ along the Yangtze River. To achieve this objective, first the development phases of the Yangtze River bulk port system are reviewed, taking the theoretical (container) port evolution model as a benchmark. Then several hypotheses addressing certain features of bulk port system development are proposed, followed by using panel data analysis to test these hypotheses. Based on this discussion and analysis, the major driving forces that are reshaping bulk port development along the Yangtze River are then summarized. It is found that evolution of the Yangtze River bulk port system in general follows the port development models in previous literature. However, the trend toward regionalization and an offshore hub have not appeared. Besides this, iron ore transshipment is moving outward both for sea ports and river ports, and few iron ore transshipment gateway hubs are occurring. Furthermore, the transshipment function of a bulk port plays a significant role in port traffic changes, but this role is affecting sea ports differently to river ports. The container throughput of transshipment sea ports has a significant negative effect on bulk traffic, whereas that of transshipment river ports has a positive effect. Geographical conditions, institutional factors and national policy, industry agglomeration, changes in market supply and demand, and technology updates are major factors driving changes to the port system structure. These factors are observed to function either individually or collectively at different development stages.     

Scheduling reefer mechanics at container terminals

This paper discusses the scheduling of reefer mechanics at container terminals. Reefer mechanics plug and unplug reefer containers such that due times are met. We outline the resulting scheduling problem and two simple heuristics. Subsequently, we present a simulation model to analyze the scheduling methods and the reefer-related processes in a realistic dynamic framework. Some results from the simulation experiments are also presented. They demonstrate the applicability of the heuristic and the use of the simulation model in practice. The simulation study was carried out for a real container terminal in the port of Hamburg, Germany.