Challenges in Managing Empty Container Movements at Multiple Planning Levels

Empty container management deals with repositioning empty containers at minimum costs while fulfilling empty container demands. Due to imbalances in trade, some areas have a surplus of empty containers, while others have a shortage. Therefore, empty containers need to be repositioned globally to make sure that sufficient empty containers are available everywhere. Besides, empty containers need to be repositioned regionally between shippers, consignees, inland depots, terminals and ports in order to fulfil demand. In this paper, the focus is on the empty container management problem at a regional level. The problem is described in detail and opportunities for reducing empty container movements are discussed. Decisions to be taken at each planning level (strategic, tactical and operational) are described, and for each planning level, a detailed overview of planning models proposed in the literature is presented. Planning models considering decisions at several planning levels are discussed as well. Finally, interesting opportunities for future research are identified.     

A frequency-based maritime container assignment model

This paper transfers the classic frequency-based transit assignment method of Spiess and Florian to containers demonstrating its promise as the basis for a global maritime container assignment model. In this model, containers are carried by shipping lines operating strings (or port rotations) with given service frequencies. An origin–destination matrix of full containers is assigned to these strings to minimize sailing time plus container dwell time at the origin port and any intermediate transhipment ports. This necessitated two significant model extensions. The first involves the repositioning of empty containers so that a net outflow of full containers from any port is balanced by a net inflow of empty containers, and vice versa. As with full containers, empty containers are repositioned to minimize the sum of sailing and dwell time, with a facility to discount the dwell time of empty containers in recognition of the absence of inventory. The second involves the inclusion of an upper limit to the maximum number of container moves per unit time at any port. The dual variable for this constraint provides a shadow price, or surcharge, for loading or unloading a container at a congested port. Insight into the interpretation of the dual variables is given by proposition and proof. Model behaviour is illustrated by a simple numerical example. The paper concludes by considering the next steps toward realising a container assignment model that can, amongst other things, support the assessment of supply chain vulnerability to maritime disruptions.     

Container liner fleet deployment: A systematic overview

Container liner fleet deployment (CLFD) is the assignment of containerships to port rotations (ship routes) for efficient transport of containers. As liner shipping services have fixed schedules, the ship-related operating cost is determined at the CLFD stage. This paper provides a critical review of existing mathematical models developed for the CLFD problems. It first gives a systematic overview of the fundamental assumptions used by the existing CLFD models. The operating characteristics dealt with in existing studies are then examined, including container transshipment and routing, uncertain demand, empty container repositioning, ship sailing speed optimization and ship repositioning. Finally, this paper points out four important future research opportunities: fleet deployment considering ship surveys and inspections, service dependent demand, pollutant emissions, and CLFD for shipping alliances.     

The Impact of Container Type Diversification on Regional British Port Development Strategies

Abstract

Despite a concentration of container traffic in the southeast of the UK over the last few decades, regional ports are attempting new development strategies to capture or retain specific traffic segments. These include intra-European short-sea traffic and a potentially increasing feeder market. These trends are reflected in the movement of different container types, which result in a number of planning challenges related to changing infrastructural and operational requirements. This paper uses highly disaggregated data on container type movements to address three issues that can inform these planning challenges. First, the imbalance of trade resulting in empty container repositioning; second, the requirement for gauge-cleared rail routes to cater for the increasing proportion of high-cube containers; and third, the specialisation of European short-sea traffic at secondary UK ports. The results reveal the disproportionate repositioning of empty containers at Scottish ports and the importance of 45?ft, high-cube and pallet-wide containers at regional ports, highlighting their focus on intra-European short-sea traffic and raising difficulties relating to their lower quality of landside infrastructure (particularly rail) in comparison to the large south-eastern ports. The potential repercussions on hinterland infrastructure development raise questions about both public and private sector responses to regional port development.     

Reversing port rotation directions in a container liner shipping network

Reversing port rotation directions of ship routes is a practical alteration of container liner shipping networks. The port rotation directions of ship routes not only affect the transit time of containers, as has been recognized by the literature, but also the shipping capacity and transshipment cost. This paper aims to obtain the optimal port rotation directions that minimize the generalized network-wide cost including transshipment cost, slot-purchasing cost and inventory cost. A mixed-integer linear programming model is proposed for the optimal port rotation direction optimization problem and it nests a minimum cost multi-commodity network flow model. The proposed model is applied to a liner shipping network operated by a global liner shipping company. Results demonstrate that real-case instances could be efficiently solved and significant cost reductions are gained by optimization of port rotation directions.     

A cost-based maritime container assignment model

A recently proposed frequency-based maritime container assignment model (Bell et al., 2011) seeks an assignment of full and empty containers to paths that minimises expected container travel time, whereas containers are in practice more likely to be assigned to minimise expected cost. A cost-based container assignment model is proposed here. It is assumed that routes and service frequencies are given so ship operating costs are also fixed. The objective is to assign containers to routes to minimise container handling costs, container rental and inventory costs. The constraints in the model are extended to include route as well as port capacities. It is shown that the problem remains a linear program. A numerical example is presented to illustrate the properties of the model. The paper concludes by considering the many applications of the proposed maritime container assignment model.     

Cluster analysis of the competitiveness of container ports in Brazil

The container cargo proportion of total maritime transport increased from 3% in 1980 to 16% in 2011. The largest Brazilian port, the port of Santos, is the 42nd largest container port in the world. However, Santos’ performance indicators are much lower than those of the world’s largest ports, so comparisons with them are difficult. This article focuses on the Brazilian container terminals that handled containers in 2009 and compares port competitiveness. This study classified seventeen Brazilian container terminals into three distinct groups based on the following competitiveness criteria: number of containers handled, berth length, number of berths, terminal tariffs (in US$), berth depth, rate of medium consignment (in containers/ship), medium board (containers/hour), average waiting time for mooring (in hours/ship), and average waiting time for load or unload cargo (in hours/ship). This classification used a hierarchical cluster analysis. The classification shows that the terminal of Tecon in the port of Santos has the best performance of all, while small terminals (<150,000 container units) are the worst performing terminals in Brazil.     

How do economies of density in container handling operations affect ships’ time and emissions in port? Evidence from Norwegian container terminals

Efficient port services are prerequisites for competitive and sustainable maritime transports. This paper makes advances in studying the determinants of the time that ships spend in port and the associated emissions to air. We estimate a production model for cargo handling based on a unique dataset containing each port of call at the largest container terminals in Norway in 2014. In turn, we use auxiliary engine emission factors to estimate particulate matter and nitrogen oxide emissions from ships at berth, to determine how the corresponding damage costs of air pollution vary with container throughput, location, and terminal investments. We find that Norwegian container terminals operate under increasing returns to density. Small ships that unload few containers are far from reaping economies of density, leading to high marginal time requirements for container handling and consequently high marginal external costs. From a Pigouvian taxation perspective, port charges should therefore be regressive in the number of containers handled. Moreover, we find that the external costs of maritime transports are severely understated when port operations are ignored. Our model allows determining the marginal productivities of port facilities. Thereby, it is instrumental in designing port charges that are diversified according to the quantity of containers handled and the service quality (i.e., the speed of handling operations). Regarding contextual factors, we find that establishing high-frequent liner services improves the ship working rate, while simultaneous calls at a terminal impede productivity. The type of container (loading/unloading; empty/laden) also appears to influence the duration of ship working.     

Lightweighting shipping containers: Life cycle impacts on multimodal freight transportation

Freight transportation by truck, train, and ship accounts for 5% of the United States’ annual energy consumption (U.S. Energy Information Administration, 2017a). Much of this freight is transported in shipping containers. Lightweighting containers is an unexplored strategy to decrease energy and GHG emissions. We evaluate life cycle fuel savings and environmental performance of lightweighting scenarios applied to a forty-foot (12.2 meters) container transported by ship, train, and truck. Use phase burdens for both conventional and lightweighted containers (steel reduction, substitution with aluminum, or substitution with high tensile steel) were compared to life cycle burdens. The study scope ranged from the transportation of one container 100 km to the lifetime movement of the global container fleet on ships. Case studies demonstrated the impact of lightweighting on typical multimodal freight deliveries to the United States. GREET 1 and 2 (Argonne National Laboratory, 2016a,b) were used to estimate the total fuel cycle burdens associated with use phase fuel consumption. Fuel consumption was determined using modal Fuel Reduction Values (FRV), which relate mass reduction to fuel reduction. A lifetime reduction of 21% in the fuel required to transport a container, and 1.4% in the total fuel required to move the vehicles, cargo, and containers can be achieved. It was determined that a 10% reduction in mass of the system will result in a fuel reduction ranging from 2% to 8.4%, depending on the mode. Globally, container lightweighting can reduce energy demand by 3.6 EJ and GHG emissions by 300 million tonnes CO₂e over a 15-year lifetime.     

An operational activity-based method to estimate CO2 emissions from container shipping considering empty container repositioning

This paper develops an operational activity-based method to estimate CO₂ emissions from container shipping in contrasts to the traditional aggregated activity-based method. Two case studies investigate the impacts of empty container repositioning policies and port handling capacity on CO₂ emission index. The results show that the aggregated method could well overestimate CO₂ emissions and the operational activity-based method is more appropriate. The paper also demonstrates that high port-handling capacity and efficient empty container repositioning could reduce CO₂ emissions in seaborne container transportation.     

A tabu search algorithm to solve the integrated planning of container on an inter-terminal network connected with a hinterland rail network

Transport demand for containers has been increasing for decades, which places pressure on road transport. As a result, rail transport is stimulated to provide better intermodal freight transport services. This paper investigates mathematical models for the planning of container movements in a port area, integrating the inter-terminal transport of containers (ITT, within the port area) with the rail freight formation and transport process (towards the hinterland). An integer linear programming model is used to formulate the container transport across operations at container terminals, the network interconnecting them, railway yards and the railway networks towards the hinterland. A tabu search algorithm is proposed to solve the problem. The practical applicability of the algorithm is tested in a realistic infrastructure case and different demand scenarios. Our results show the degree by which internal (ITT) and external (hinterland) transport processes interact, and the potential for improvement of overall operations when the integrated optimization proposed is used. Instead, if the planning of containers in the ITT system is optimized as a stand-alone problem, the railway terminals may suffer from longer delay times or additional train cancellations. When planning the transport of 4060 TEU containers within one day, the benefits of the ITT planning without considering railway operations account for 17% ITT cost reduction but 93% railway operational cost growth, while the benefits of integrating ITT and railway account for a reduction of 20% in ITT cost and 44% in railway operational costs.     

A joint optimization model for liner container cargo assignment problem using state-augmented shipping network framework

This paper proposes a state-augmented shipping (SAS) network framework to integrate various activities in liner container shipping chain, including container loading/unloading, transshipment, dwelling at visited ports, in-transit waiting and in-sea transport process. Based on the SAS network framework, we develop a chance-constrained optimization model for a joint cargo assignment problem. The model attempts to maximize the carrier’s profit by simultaneously determining optimal ship fleet capacity setting, ship route schedules and cargo allocation scheme. With a few disparities from previous studies, we take into account two differentiated container demands: deterministic contracted basis demand received from large manufacturers and uncertain spot demand collected from the spot market. The economies of scale of ship size are incorporated to examine the scaling effect of ship capacity setting in the cargo assignment problem. Meanwhile, the schedule coordination strategy is introduced to measure the in-transit waiting time and resultant storage cost. Through two numerical studies, it is demonstrated that the proposed chance-constrained joint optimization model can characterize the impact of carrier’s risk preference on decisions of the container cargo assignment. Moreover, considering the scaling effect of large ships can alleviate the concern of cargo overload rejection and consequently help carriers make more promising ship deployment schemes.     

Bi-objective optimization for the container terminal integrated planning

In this paper, we study the joint optimization of the tactical berth allocation and the tactical yard allocation in container terminals, which typically consist of berth side and yard side operations. The studied two objectives are: (i) the minimization of the violation of the vessels’ expected turnaround time windows with the purpose of meeting the timetables published by shipping liners, and (ii) the minimization of the total yard transportation distance with the aim to lower terminal operational cost. We propose a bi-objective integer program which can comprehensively address the import, export and transshipment tasks in port daily practice. Traditionally, a container transshipment task is performed as a couple of import and export tasks, called indirect-transshipment mode, in which the transit container are needed to be temporally stored in the yard. As the way of transferring containers directly from the incoming vessel to the outgoing vessel, called direct-transshipment mode, has potential to save yard storage resources, the proposed model also incorporates both indirect- and direct-transshipment modes. To produce Pareto solutions efficiently, we devise heuristic approaches. Numerical experiments have been conducted to demonstrate the efficiency of the approaches.     

Liner container seasonal shipping revenue management

This paper proposes a liner container seasonal shipping revenue management problem for a container shipping company. For a given weekly multi-type shipment demand pattern in a particular season, the proposed problem aims to maximize the total seasonal shipping profit by determining the number of multi-type containers to be transported and assigned on each container route, the number of containerships deployed on each ship route, and the sailing speed of containerships on each shipping leg subject to both the volume and capacity constraints of each containership. By adopting the realistic bunker consumption rate of a containership as a function of its sailing speed and payload (displacement), we develop a mixed-integer nonlinear programing with a nonconvex objective function for the proposed liner container seasonal shipping revenue management problem. A tailored branch and bound (B&B) method is designed to obtain the global ε-optimal solution of the model. Numerical experiments are finally conducted to assess the efficiency of the solution algorithm and to show the applicability of the developed model.     

Shipping log data based container ship fuel efficiency modeling

Container shipping lines have been initiating various ship fuel efficiency management programs because bunker fuel costs always dominate the daily operating costs of a container ship. As the basis of these kinds of programs, we develop a viable research methodology for modeling the relationship between the fuel consumption rate of a particular container ship and its determinants, including sailing speed, displacement, sea conditions and weather conditions, by using the shipping log data available in practice. The developed methodology consists of an outlier-score-based data preprocessing procedure to tackle the fuzziness, inaccuracy and limited information of shipping logs, and two regression models for container ship fuel efficiency. Real shipping logs from four container ships (two with 13000 TEUs and two with 5000 TEUs) over a six-month sailing period are used to exhibit the applicability and effectiveness of the proposed methodology. The empirical studies demonstrate the performance of three models for fitting the fuel consumption rate of a ship and the industrial merits of ship fuel efficiency management. In addition, we highlight the potential impacts of the models developed in this study on liner shipping network analysis, as these models can serve as base models for additionally considering the influence of displacement and weather conditions on ship fuel efficiency and exhaust emissions.     

Storage space allocation in container terminals

Container terminals are essential intermodal interfaces in the global transportation network. Efficient container handling at terminals is important in reducing transportation costs and keeping shipping schedules. In this paper, we study the storage space allocation problem in the storage yards of terminals. This problem is related to all the resources in terminal operations, including quay cranes, yard cranes, storage space, and internal trucks. We solve the problem using a rolling-horizon approach. For each planning horizon, the problem is decomposed into two levels and each level is formulated as a mathematical programming model. At the first level, the total number of containers to be placed in each storage block in each time period of the planning horizon is set to balance two types of workloads among blocks. The second level determines the number of containers associated with each vessel that constitutes the total number of containers in each block in each period, in order to minimize the total distance to transport the containers between their storage blocks and the vessel berthing locations. Numerical runs show that with short computation time the method significantly reduces the workload imbalance in the yard, avoiding possible bottlenecks in terminal operations.     

Truck backhauling on two terminal networks

Truck backhauling reduces empty truck-miles by having drivers haul loads on trips back to their home terminal. This paper 1) examines the impact on backhauling opportunities of terminal locations and directional imbalances in the flow of freight from the terminals, and 2) develops a method for determining which truckloads should be backhauled. Backhauling is studied for two terminals sending full truckloads to many customers under steady-state conditions. This research develops two backhauling models. The first is a continuous model that makes simplifying assumptions about customer locations and travel distances. It results in formulae showing that 1) savings from backhauling increase at a decreasing rate as the directional flow of freight between two terminals becomes more balanced and 2) backhauling is an important, but often ignored, factor in terminal (e.g. trucking terminal, warehouse, or plant) location and supplier selection decisions. The second model is a more general discrete model that determines which loads should be backhauled to minimize empty truck-miles.     

The container retrieval problem with respect to relocation

The demand for container terminal yards is growing significantly faster than the supply of available land; therefore, containers are typically stacked high to better utilize the land space in container yards. However, in the process of container retrieval, non-productive reshuffling may be required to relocate the containers that are stacked on top of the target container. Container retrieval is directly related to the operational efficiency of terminals. Because the industry has become increasingly competitive, it has become critical to introduce a systematic approach to retrieving containers. In this study, we develop a heuristic that can generate feasible working plans for rail-mounted gantry cranes (RMGC) in container yards to minimize the number of container movements while taking the RMGC working time into consideration. The methodology takes into consideration the case that containers are grouped in terms of their retrieval order. Multi-lift RMGC models also are studied. Comprehensive numerical experiments reveal that the method runs faster than other methods published in the literature by several orders of magnitude; additionally, our method is able to solve instances larger than practical use. The number of movements approaches a theoretical lower bound, and the numerical results clearly demonstrate the tradeoff between the number of movements and the working time, and provide useful insights for yard planning.     

Intermodal freight transport planning – A receding horizon control approach

This paper investigates intermodal freight transport planning problems among deep-sea terminals and inland terminals in hinterland haulage for a horizontally fully integrated intermodal freight transport operator at the tactical container flow level. An intermodal freight transport network (IFTN) model is first developed to capture the key characteristics of intermodal freight transport such as the modality change phenomena at intermodal terminals, physical capacity constraints of the network, time-dependent transport times on freeways, and time schedules for trains and barges. After that, the intermodal freight transport planning problem is formulated as an optimal intermodal container flow control problem from a system and control perspective with the use of the proposed IFTN model. To deal with the dynamic transport demands and dynamic traffic conditions in the IFTN, a receding horizon intermodal container flow control (RIFC) approach is proposed to control and to reassign intermodal container flows in a receding horizon way. This container flow control approach involves solving linear programming problems and is suited for transport planning on large-sized networks. Both an all-or-nothing approach and the proposed RIFC approach are evaluated through simulation studies. Simulation results show the potential of the proposed RIFC approach.     

Profit-based maritime container assignment models for liner shipping networks

We propose the problem of profit-based container assignment (P-CA), in which the container shipment demand is dependent on the freight rate, similar to the “elastic demand” in the literature on urban transportation networks. The problem involves determining the optimal freight rates, the number of containers to transport and how to transport the containers in a liner shipping network to maximize the total profit. We first consider a tactical-level P-CA with known demand functions that are estimated based on historical data and formulate it as a nonlinear optimization model. The tactical-level P-CA can be used for evaluating and improving the container liner shipping network. We then address the operational-level P-CA with unknown demand functions, which aims to design a mechanism that adjusts the freight rates to maximize the profit. A theoretically convergent trial-and-error approach, and a practical trial-and-error approach, are developed. A numerical example is reported to illustrate the application of the models and approaches.