Comparative evaluation of resource cycle strategies on operating and environmental impact in container terminals

This paper examines the use of single and dual cycle operations for three types of resources, namely, quay cranes, vehicles, and yard cranes to improve the operating efficiency and reduce the energy consumption in a container terminal. Various cycle strategies are proposed and their corresponding estimation models, describing the stowage distributions of outbound and inbound containers on a ship and the storage sharing level of blocks in the yard, are formulated to estimate the total number of cycles for the resources. Statistical analyses are conducted to evaluate and compare the effect of different cycle strategies on the cycle reductions. From the experiment results, it was found that collaboration between resources with the single cycle operation always outperforms that under the dual cycle operation without collaboration.     

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.     

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.     

Automated guided vehicle system for two container yard layouts

The explosive growth in the freight volumes has put a lot of pressure on seaport authorities to find better ways of doing daily operations in order to improve the performance and to cope with avalanches of containers processing at container terminals. Advanced technologies, and in particular automated guided vehicle systems (AGVS), have been recently proposed as possible candidates for improving the terminal’s efficiency not only due to their abilities of significantly improving the performance but also to the repetitive nature of operations in container terminals. The deployment of AGVS may not be as effective as expected if the container terminal suffers from a poor layout. In this paper, simulation models are developed and used to demonstrate the impact of automation and terminal layout on terminal performance. In particular, two terminals with different but commonly used yard configurations are considered for automation using AGVS. A multi attribute decision making (MADM) method is used to assess the performance of the two terminals and determine the optimal number of deployed automated guided vehicles (AGVs) in each terminal. The simulation results demonstrate that substantial performance can be gained using AGVS. Furthermore, the yard layout has an effect on the number of AGVs used and on performance.     

Sequencing twin automated stacking cranes in a block at automated container terminal

In the considered automated container terminal (ACT) that is designed for Shanghai Yangsha Terminal, two automated stacking cranes (ASCs) are configured for each block and they interact with automated lifting vehicles (ALVs) at the two ends of a block individually. To increase the capacity, container yards with multiple rows of blocks perpendicular to the terminal’s shoreline are considered. To utilize the yard spaces, the twin ASCs are devised to share the same tracks installed at the two sides of a block, while interferences between the ASCs challenge the routing and sequencing operations. To isolate the control and simplify the coordination of the two ASCs, the interference between ASCs is formulated by analyzing the minimal temporal intervals between any two tasks. Three models are then established to sequence the container handling tasks under the minimization of the makespan. An exact algorithm and a genetic algorithm are designed to solve the problem. Numerical experiments show that the algorithms are competitive comparing to on-the-shelf solvers. Practical implications are investigated based on the formulations and experimental results. The managerial implications and technological aspects of applying the formulations and algorithms to practical situations to real-world ACTs are discussed.     

Multi-period yard template planning in container terminals

This paper is about yard management in container ports. As a tactical level decision-making tool in a port, a yard template determines the assignment of spaces (subblocks) in a yard for arriving vessels, which visit the port periodically. The objective of yard template planning is to minimize the transportation cost of moving containers around the yard. To handle yard template planning, a mixed integer programming model is proposed that also takes into account traffic congestion in the yard. A further complication is that the cycle time of the vessels' periodicities is not uniform and varies among them, perhaps being one week, ten days, or two weeks, etc. However, this multiple cycle time of the periodicities of vessel arrival patterns, which complicates the yard template decision, is also considered in the model. Moreover, a local branching based solution method and a Particle Swarm Optimization based solution method are developed for solving the model. Numerical experiments are also conducted to validate the effectiveness of the proposed model, which can save around 24% of the transportation costs of yard trucks when compared with the commonly used First-Come-First-Served decision rule. Moreover, the proposed solution methods can not only solve the proposed model within a reasonable time, but also obtain near-optimal results with about 0.1–2% relative gap.     

Gantry crane operations to transfer containers between trains: A simulation study of a Spanish terminal

Freight transfer operations are critical in combined transport networks. In this paper a simulation model and modelling approach to the transfer of cargo between trains at rail terminals is presented. The model is used to study the Port-Bou terminal, the main intermodal terminal at the Spanish-French frontier. Four different gantry crane operation modes to interchange containers between trains are evaluated. These operation rules are tested in several scenarios to examine the critical factors of the system and the best operation rule for each situation. Latest generation software is used to develop the model that incorporates modular programming and enhanced graphic systems for output representation. It allows a dynamic display of the simulated system and, likewise, the possibility of developing modules that can be reused in other studies. The research shows how simulation can be a useful planning tool in the rail transportation context.     

A comparison of different container sorting systems in modern rail-rail transshipment yards

Rail-rail transshipment yards act as central hub nodes within a railway network and enable a rapid consolidation of containers between different freight trains. To avoid an excessive movement of gantry cranes when transferring a container from one train to another, modern yards apply sorting systems where shuttle cars move containers horizontally along the spread of the yard. This paper compares four elementary sorting systems. Specifically, we compare rubber-tired and rail-mounted shuttles and differentiate whether a pure shuttle system or a lift & shuttle system is applied. In pure shuttle systems, a shuttle receives a container from a crane and transports it towards the destination crane, where it serves as a storage device until being unloaded. A lift & shuttle system applies shuttles with an integrated lifting platform, so that they are able to autonomously store and receive containers from a separate storage rack. Both alternatives exist in rubber-tired and rail-mounted versions. As the shuttles are the main driver of the investment costs, we compare the required fleet size for timely supplying given gantry crane schedules within all four systems. For this purpose, we derive suited scheduling procedures. This way, decision support for yard managers having to identify a suited sorting system and to layout a new terminal is provided.     

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.     

Scheduling of Intelligent and Autonomous Vehicles under pairing/unpairing collaboration strategy in container terminals

A new class of Intelligent and Autonomous Vehicles (IAVs) has been designed in the framework of Intelligent Transportation for Dynamic Environment (InTraDE) project funded by European Union. This type of vehicles is technologically superior to the existing Automated Guided Vehicles (AGVs), in many respects. They offer more flexibility and intelligence in maneuvering within confined spaces where the logistic operations take place. This includes the ability of pairing/unpairing enabling a pair of 1-TEU (20-foot Equivalent Unit) IAVs dynamically to join, transport containers of any size between 1-TEU and 1-FFE (40-foot Equivalent) and disjoin again. Deploying IAVs helps port operators to remain efficient in coping with the ever increasing volume of container traffic at ports and eliminate the need for deploying more 40-ft transporters in the very confined area of ports. In order to accommodate this new feature of IAVs, we review and extend one of the existing mixed integer programming models of AGV scheduling in order to minimize the makespan of operations for transporting a set of containers of different sizes between quay cranes and yard cranes. In particular, we study the case of Dublin Ferryport Terminal. In order to deal with the complexity of the scheduling model, we develop a Lagrangian relaxation-based decomposition approach equipped with a variable fixing procedure and a primal heuristics to obtain high-quality solution of instances of the problem.     

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.     

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.     

Measuring the performance of intermodal freight terminals

As the interface point between road and rail, intermodal freight terminals (IFTs) are critical elements in the total freight distribution chain. This paper addresses the twin objectives of reducing freight transport costs and improving customer service by putting forward a number of indicators designed to measure the performance of IFTs. Each of the three major performance areas, namely customer service, operational efficiency and terminal productivity are discussed in detail.

A methodology is put forward which enables operating strategies to be evaluated. Computer simulation is used in order to arrive at strategies which reduce operating and capital costs and satisfy customer service requirements. The simulation model outputs include performance measures related to customer service such as mean waiting times required for loading and unloading of containers, as well as productivity measures of terminal operations such as lifting equipment utilisation.     

An agent-based framework for cooperative planning of intermodal freight transport chains

The recent development of Intelligent Transportation Systems offers the possibility of cooperative planning of multi-actor systems in a distributed framework, by enabling prompt exchange of information among actors. This paper proposes a modeling framework for cooperation in intermodal freight transport chains as multi-actor systems. In this framework, the problem of optimizing freight transportation is decomposed into a suitable set of sub-problems, each representing the operations of an actor which are connected using a negotiation scheme. A Discrete Event model is developed which optimizes the system on a rolling horizon basis to account for the dynamics of intermodal freight transport operations. This framework allows for an event driven short/medium term planning of intermodal freight transport chains. The proposed methodology is evaluated using a realistic case study, and the results are compared against the First-Come-First-Served strategy, highlighting the significance of cooperation in systems operating close to capacity.     

Simulation-based assessment methodology to improve ground service operations at a hub airport

ABSTRACT

Airport terminals are dynamic environments and security/passport services generally constitute costly bottlenecks in terminals. Increases in the number of airline passengers compels airport terminals to provide more efficient services to its customers under space and resource limitations. This study examines the level of service of passenger processes at Istanbul Atatürk Airport by constructing a comprehensive simulation model. It focuses mainly on passport control services and passenger transfer security services because of the airport's hub status and the strategy of Turkish Airlines. The increasing number of transfer passengers may cause disruptions in departure flight schedules due to slow passenger processes. After validating the model, we investigate the consequences of three main alternative solutions, including 17 sub-scenarios, to capture target quality levels. Finally, we provide the results for each scenario to investigate the optimum allocation of resources to terminal operations.     

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.     

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.     

Cranes scheduling in frame bridges based automated container terminals

This paper investigates crane scheduling problems for a new type of automated container terminal system, which is based on multi-storey frame bridges. For the new design concept, this paper studies how to schedule two types of cranes, i.e., quay cranes and bridge cranes that transfer containers between different storeys. The schedules of these two types of cranes impact the operation efficiency of the terminal system. Mathematical models are proposed for the two scheduling problems. Meta-heuristics are developed to solve them. Numerical experiments are conducted to validate the effectiveness of the proposed models and the efficiency of the proposed solution method.     

Optimal planning of liquefied natural gas deliveries

We investigate the problem of designing an optimal annual delivery plan for Liquefied Natural Gas (LNG). This problem requires determining the long-term cargo delivery dates and the assignment of vessels to the cargoes while accommodating several constraints, including berth availability, liquefaction terminal inventory, planned maintenance, and bunkering requirements. We describe a novel mixed-integer programming formulation that captures important industry requirements and constraints with the objective of minimizing the vessel fleet size. A peculiar property of the proposed formulation is that it includes a polynomial number of variables and constraints and is, in our experience, computationally tractable for large problem instances using a commercial solver. Extensive computational runs demonstrate the efficacy of the proposed model for real instances provided by a major energy company that involve up to 118 cargoes and a 373-day planning horizon.     

Stochastic freight flow patterns: implications for fleet optimization

Trucking, rail and other types of transportation networks share the common feature of moving equipment and crews between spatially separated terminals to accommodate the transportation of goods or people. This paper develops measures for temporal and spatial imbalances in freight flows, and applies these measures to a major trucking network. Fundamentally, the randomness inherent to a system of terminals is mitigated by pooling freight flows among terminal groups, and by pooling freight flows over many time periods. In the terminal network that we examined, long-run freight imbalances ensure that empty equipment movements must equal or exceed 13.3% of loaded movements at individual terminals and 8.2% of loaded movements at terminal groups. Due to short-run freight imbalances, the number of empty movements could increase by about 50% over the long-run average; greater increases would occur if equipment flows must be balanced on each travel lane. ©