A container terminal simulation model with animation capabilities

The objective of this paper is to introduce a computer simulation model with on-screen animation graphics, which can simulate the operations of a container terminal equipped with straddle carriers. The movements of the equipment are simulated as realistically as possible, to include time losses due to the mismatch in the sequence of equipment movements and to traffic congestion. Trucks are normally served in a specified area, but in some cases, straddle carrier drivers can call the truck to be served directly in the container storage areas. The experience of operators is incorporated in the model, in the form of a knowledge base, that is used to simulate the above process and determine the service discipline. The model was designed to evaluate different configurations (changes in yard layout, equipment number and productivity, truck arrival pattern and service discipline) of the simulated system. The proposed model was used to examine the differences between “the observed” operations strategy and the strategy dictated by the operational rules of the port of Piraeus. The results indicate that “the observed” strategy leads to shorter truck service time but increase the traffic conflicts in the terminal's internal transport networks.     

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.     

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.     

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.     

Green vehicle technology to enhance the performance of a European port: A simulation model with a cost-benefit approach

In this paper, we study the impact of using a new intelligent vehicle technology on the performance and total cost of a European port, in comparison with existing vehicle systems like trucks. Intelligent autonomous vehicles (IAVs) are a new type of automated guided vehicles (AGVs) with better maneuverability and a special ability to pick up/drop off containers by themselves. To identify the most economical fleet size for each type of vehicle to satisfy the port’s performance target, and also to compare their impact on the performance/cost of container terminals, we developed a discrete-event simulation model to simulate all port activities in micro-level (low-level) details. We also developed a cost model to investigate the present values of using two types of vehicle, given the identified fleet size. Results of using the different types of vehicles are then compared based on the given performance measures such as the quay crane net moves per hour and average total discharging/loading time at berth. Besides successfully identifying the optimal fleet size for each type of vehicle, simulation results reveal two findings: first, even when not utilising their ability to pick up/drop off containers, the IAVs still have similar efficacy to regular trucks thanks to their better maneuverability. Second, enabling IAVs’ ability to pick up/drop off containers significantly improves the port performance. Given the best configuration and fleet size as identified by the simulation, we use the developed cost model to estimate the total cost needed for each type of vehicle to meet the performance target. Finally, we study the performance of the case study port with advanced real-time vehicle dispatching/scheduling and container placement strategies. This study reveals that the case study port can greatly benefit from upgrading its current vehicle dispatching/scheduling strategy to a more advanced one.     

Centralized versus distributed feeder ship service: The case of the Maasvlakte harbour area of Rotterdam

Coastal and inland feeder shipping is a critical factor for intercontinental container transport. The question is whether each intercontinental terminal should be equipped with its own service stations for feeder shipping, or whether pooling of the facilities would be more effective. For this paper, the service station examined for the service of feeder ships is equipped with two quay cranes operating in parallel supported by a small active quay stack. The centre for this feeder service consists of several of these stations. Simulation shows that a crane productivity of 96% is feasible with an average vehicle waiting time of 1 min, that a central service requires fewer service stations than a distributed service and that the quay transport for central and distributed transport requires the same number of terminal vehicles. The analysis shows that a centralized service is preferable, attracting 70% of the market potential.     

Collaborative truck scheduling and appointments for trucking companies and container terminals

Appointment systems for truck arrivals at container terminals have been applied in many ports to reduce truck congestion. This study suggests a new appointment process by which trucking companies and terminals collaboratively determine truck operation schedules and truck arrival appointments. This study formulates a mathematical model involving a sub-problem for each trucking company to determine the optimal dispatching schedules for trucks and the other sub-problem for the terminal to estimate the expected truck system time in each time interval. An iterative collaboration process is proposed based on a decomposed mathematical formulation. Numerical experiments are conducted to investigate the performance of the decision process and the robustness of the process in practical operation conditions.     

A simulation-based vessel-truck coordination strategy for lighterage terminals

Lighterage contributes significantly to the maritime industry since thousand tons of necessary supplies have to be delivered to mother vessels anchored near sea every day. A single lighter waits to receive cargoes from multiple suppliers at the berth, while the trucks wait for their turns to enter the terminal. Due to the limited space, the terminal operation becomes vulnerable to the lack of coordination of their arrivals. In this study, despite a traditional industry, we are interested in applying the emerging technologies to improve the operation efficiency. We develop a simulation-based coordination strategy to construct coordinated schedules for both the lighters and suppliers to reduce congestions in the lighterage terminal The discrete event simulation model is developed based on understanding the real-world terminal in Singapore, and the controlled arrival method, determining coordinated arrival schedules of trucks, is introduced and embedded to the simulation model. The simulation model is tuned up with a benchmark setting of 6-month historical data. To find the optimal strategy, an advanced bi-objective simulation optimization algorithm is employed. According to our findings, the proposed strategy could significantly improve the efficiency of both lighters and trucks in various indicators. At the end, a mobile application prototype is proposed to deliver the coordinated schedules to different parties, and improve the communication between parties.     

A study of economic efficiency in port security inspection

The purpose of this paper is to study an economic efficiency for the prediction of additional truck turnaround time and for determining the number of the port security inspection equipment required at a terminal inspection station. The economic efficiency with six base models was developed to assist terminal operators' decision‐making. In addition, this study developed an optimal procedure that terminal operators could use to optimally run in terms of various statistics processes including exponential, deterministic, and others, seeking a solution that was beneficial for both terminal operators and truckers. As a result of this research of the additional cargo turnaround time for port security delay, the following conclusion can be drawn and made. The average additional delay time in the inspection station is very dependent on the inspection rate of the lower stage. The higher weighted inspection time based on raising security level allows less number of trucks to be inspected, which will derive high delay in the inspection station. Increase of rate of Green Lane usage will allow a decrease in the arrival rate, which may derive improvement of inspection equipment efficiency and average delay time at the inspection station. In multiple stage model, total number of trucks and delay time very closely follow those of low inspection stage rate and number of inspection units. Free Lane is to be followed by Customs‐Trade Partnership Against Terrorism and standardization of customs, packing, loading and unloading, documents, procedure, and exchange working in each country. Copyright © 2012 John Wiley & Sons, Ltd.     

A study of container berth allocation

This study is based on a major container terminal operator in Hong Kong. Container terminals form a link in the transport chain for transhipment and temporary storage of containers. The service time for vessels including waiting time for berthing must be minimal in order to reduce costs for shipping lines. The use of heuristics and computer simulation to measure different allocation strategies is demonstrated. The existing performance measures of allocation are evaluated and prioritized. Three sets of allocation policies are developed to tackle the day-to-day allocation problems with a view to increasing operational efficiency and enhancing customer service levels. Results show that all three proposed allocation policies have substantial improvements over the existing policy.     

Queue-dependent vehicle dispatching with options and optimal fleet size

A queue-dependent vehicle dispatching rule, with options to use special vehicles (rented, reserve, shared etc.) for relieving long waiting lines, is considered. The transportation system under consideration has one source terminal and a fleet of N regular vehicles. Passengers are assumed to arrive individually at the source terminal according to a Poisson process. An efficient recursive algorithm is derived to analyse the performance of the system. An average cost criterion is used to determine the firm's fleet size and dispatching strategy for a simpler system. This is a variant of a “Random vehicle dispatching with options” rule proposed by Zuckerman and Tapiero (1980).     

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.     

Liner container assignment model with transit-time-sensitive container shipment demand and its applications

This paper proposes a practical tactical-level liner container assignment model for liner shipping companies, in which the container shipment demand is a non-increasing function of the transit time. Given the transit-time-sensitive demand, the model aims to determine which proportion of the demand to fulfill and how to transport these containers in a liner shipping network to maximize the total profit. Although the proposed model is similar to multi-commodity network-flow (MCNF) with side constraints, unlike the MCNF with time delay constraints or reliability constraints that is NP-hard, we show that the liner container assignment model is polynomially solvable due to its weekly schedule characteristics by developing two link-based linear programing formulations. A number of practical extensions and applications are analyzed and managerial insights are discussed. The polynomially solvable liner container assignment model is then applied to address several important decision problems proposed by a global liner shipping company.     

The impact of terminal handling charges on overall shipping charges: an empirical study

Before the introduction of terminal handling charges (THCs), traditional freight rates included both ocean freight charges and terminal charges at ports. Since the introduction of THCs in 1991, the freight rate has become a “port-to-port” charge that covers only the sea leg, while the on-shore costs of using the container terminals are charged separately as THCs. Although both THCs and freight rates are collectively set by conferences, in this study we argue that the former are easier to enforce because they are invariant to other attributes such as haulage distance, inland transport services and types of commodity being shipped. This argument is consistent with the empirical findings from this study that suggest the separation of ocean freight rates from terminal charges has increased the overall shipping charges. In addition, we find that THCs affect the Hong Kong container handling industry by lowering its throughput.     

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.     

Optimization of refuelling truck fleets at an airport

This paper considers the process of aircraft refuelling using refuelling trucks at an airport. The problem which arises is to determine the minimum number of refuelling trucks and their routes for the given demand (schedule and fuel quantities). The constraint is that there is no aircraft departure delay due to the refuelling process. The optimum solution is found here using the branch-and-bound technique. This solution is compared with results obtained on the basis of random assignment and a few conclusions are made. The paper also presents a model application example based on real life data from a medium-sized airport.     

Estimating the environmental costs of port related emissions: The case of Kaohsiung

This study estimates the emission costs of ships and trucks in the Port of Kaohsiung, Taiwan, focusing mainly on particular matter and volatile organic compounds. By calculating annual ship and truck emissions we find that the major contributors are tankers, container ships and bulk ships and trucks. Using a bottom-up methodology, the combined environmental costs of ships and trucks are estimated to be over $123 million per year.     

Modeling the cost sensitivity of intermodal inland waterway terminals: A scenario based approach

Cost characteristics of differently sized inland waterway terminals (IWTs) have not received much scientific attention. This observation is remarkable given the importance of costs in transportation decision-making. Classification of differently sized IWTs and their cost structure will lead to more insight into the container cost per terminal. Therefore, the goal of our research was to determine both the characteristics of the cost structure associated with different inland waterway (IWW) container terminal types and the sensitivity of the system to cost/TEU changes in input and operational conditions. We show that terminals with a higher container throughput encounter fewer costs, and can therefore charge a lower price. Assumed delays of 2 h per day on the waterside cause a 4.7–6.6% cost increase per container, mainly caused by extra labor costs. It is also assumed that the changing climate will influence terminal operations and results in extreme water levels (lasting two weeks occurring four times a year) causing a cost increase of 1.0–3.4%. Subsidies can cause cost reductions of 0.3–10.4% depending on the exact form, with the smaller terminals benefiting more because their investment costs are higher relative to operational costs. A subsidy can lower costs by up to 10.4%, but it is questionable whether small and medium terminals will have a lower cost price than the market price, showing that it is important for small and medium terminals to quickly grow in size.     

Dynamic threshold policy for delaying and breaking commitments in transportation auctions

In this paper we consider a transportation procurement auction consisting of shippers and carriers. Shippers offer time sensitive pickup and delivery jobs and carriers bid on these jobs. We focus on revenue maximizing strategies for the shippers in sequential auctions. For this purpose we propose two strategies, namely delaying and breaking commitments. The idea of delaying commitments is that a shipper will not agree with the best bid whenever it is above a certain reserve price. The idea of breaking commitments is that the shipper allows the carriers to break commitments against certain penalties. We evaluate the benefits of both strategies with simulation. In addition, we provide insight into the distribution of the lowest bid which is estimated by the shippers.