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.     

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.     

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.     

Control of interacting machines in automated container terminals using a sequential planning approach for collision avoidance

The control of automated container terminals is complex since Quay Cranes (QCs), Automated Guided Vehicles (AGVs) and Automated Stacking Cranes (ASCs) interact intensively for transporting containers, while collision avoidance of equipment must be ensured. This paper proposes a methodology to generate collision-free trajectories of free-ranging AGVs in automated container terminals, while minimizing the makespan of the whole container handling system. A hierarchical control architecture is proposed to integrate the scheduling of interacting machines and trajectory planning of AGVs. Following a so-called overall graph sequence by a scheduler, the collision-free trajectories of AGVs are determined by solving a collection of mixed integer linear programming problems sequentially. Simulation results illustrate the potential of the proposed methodology.     

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.     

Scheduling freight trains traveling on complex networks

In the US, freight railways are one of the major means to transport goods from ports to inland destinations. According to the Association of American Railroad’s study, rail companies move more than 40% of the nation’s total freight. Given the fact that the freight railway industry is already running without much excess capacity, better planning and scheduling tools are needed to effectively manage the scarce resources, in order to cope with the rapidly increasing demand for railway transportation. This research develops optimization-based approaches for scheduling of freight trains. Two mathematical formulations of the scheduling problem are first introduced. One assumes the path of each train, which is the track segments each train uses, is given and the other one relaxes this assumption. Several heuristics based on mixtures of the two formulations are proposed. The proposed algorithms are able to outperform two existing heuristics, namely a simple look-ahead greedy heuristic and a global neighborhood search algorithm, in terms of railway total train delay. For large networks, two algorithms based on the idea of decomposition are developed and are shown to significantly outperform two existing algorithms.     

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.     

Assessing the cost and CO2e impacts of rerouteing UK import containers

Among the most important trade-related issues currently confronting the UK are the environmental implications of very large volumes of containerised freight being handled at a small number of ports while there appears to be significant potential for using other ports and water-rail intermodal connections. Six UK ports are selected for the analysis: Hull/Immingham, Liverpool, Felixstowe, Southampton, Dover and Bristol. Through an origin-destination analysis, the cost and CO₂e impacts of UK port trade patterns are compared using the actual situation against three proposed Scenarios: (1) the re-direction of containers by a combined expansion of Hull and Immingham; Liverpool; and Bristol, (2) moving containers by rail facilitated via expanded capacity at Southampton, and (3) moving containers by rail through expanded capacity at Felixstowe. The research found that transporting containers from Felixstowe and Southampton to the northern regions by rail has the lowest CO₂e impact, and is the most feasible option, although constraints exist in terms of infrastructure provision, water depth and rail network capacity.     

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.     

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.     

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.     

Techniques for inserting additional trains into existing timetables

In this paper techniques for scheduling additional train services (SATS) are considered as is train scheduling involving general time window constraints, fixed operations, maintenance activities and periods of section unavailability. The SATS problem is important because additional services must often be given access to the railway and subsequently integrated into current timetables. The SATS problem therefore considers the competition for railway infrastructure between new services and existing services belonging to the same or different operators. The SATS problem is characterised as a hybrid job shop scheduling problem with time window constraints. To solve this problem constructive algorithm and meta-heuristic scheduling techniques that operate upon a disjunctive graph model of train operations are utilised. From numerical investigations the proposed framework and associated techniques are tested and shown to be effective.     

Metaheuristics for efficient aircraft scheduling and re-routing at busy terminal control areas

Intelligent decision support systems for the real-time management of landing and take-off operations can be very effective in helping air traffic controllers to limit airport congestion at busy terminal control areas. The key optimization problem to be solved regards the assignment of airport resources to take-off and landing aircraft and the aircraft sequencing on them. The problem can be formulated as a mixed integer linear program. However, since this problem is strongly NP-hard, heuristic algorithms are typically adopted in practice to compute good quality solutions in a short computation time. This paper presents a number of algorithmic improvements implemented in the AGLIBRARY solver (a state-of-the-art optimization solver to deal with complex routing and scheduling problems) in order to improve the possibility of finding good quality solutions quickly. The proposed framework starts from a good initial solution for the aircraft scheduling problem with fixed routes (given the resources to be traversed by each aircraft), computed via a truncated branch-and-bound algorithm. A metaheuristic is then applied to improve the solution by re-routing some aircraft in the terminal control area. New metaheuristics, based on variable neighbourhood search, tabu search and hybrid schemes, are introduced. Computational experiments are performed on an Italian terminal control area under various types of disturbances, including multiple aircraft delays and a temporarily disrupted runway. The metaheuristics achieve solutions of remarkable quality, within a small computation time, compared with a commercial solver and with the previous versions of AGLIBRARY.     

Patterns of urbanization and energy requirements: recent regulation changes and simulation studies concerning American urban areas

In recent years, the world economy has become more integrated internationally and container transportation has become increasingly more important as the proportion of all trade using containers is continuously growing. In order to adapt to the increasing containerization trend, it is essential to plan and construct adequate ports and facilities to cope with this development.

Based on the analysis of factors influencing container movements, this paper illustrates the logical relationships for a distribution model, which has been used to predict the distribution of containers among the three main Seaports near Shenzhen and Hong Kong. A fuzzy number‐based distribution model is outlined in the paper. The paper illustrates the main influencing factors and their logical relationships and proposes a primary distribution model where the attractiveness of each port has been calibrated. The results show that the Port of Hong Kong is significantly more attractive than the other two ports modelled and is likely to continue to be so in the future.     

Measuring reliability of transportation networks using snapshots of movements in the network – An analytical and empirical study

In this paper we introduce an analytical framework based on discrete Likelihood Maximization techniques that provides estimates of operational level data of Queuing models and Transportation networks based on snapshots of data on movements of commodities in a network. We apply our methodology to detailed data on movements of containers imported from S.E. Asian ports to marine ports on the west coast of Canada, unloaded at these ports, moved to rail cars, and transported by rail to destinations in U.S. and Canada. We show how one can estimate operational level parameters such as the number of servers at the ports, schedules of departure and capacity of trains, and even speed of trains based on only snapshots of container movements in the network. Subsequently, we were able to calibrate the entire inter-continental transportation network, were able to identify the sources of variability in the network and were able to measure the reliability of the network to shocks.     

Traffic consolidation in East Asian container ports: A network flow analysis

The proliferation of hub-and-spoke operations in maritime container transportation has resulted in the widespread consolidation of traffic flows. Utilising liner shipping network configurations, this paper assesses the impact of freight traffic consolidation in the container port industry by exploring the spatial pattern of traffic flow movements and identifying the variety of roles that container ports play within this context. On the basis of the network concept, the spatial inequality of freight traffic consolidation is determined by the density and direction of all meaningful connections (i.e. significant flows) identified by applying Multiple Linkage Analysis (MLA) to an initial traffic flow matrix.The effectiveness of the chosen methodology is tested empirically using a sample comprising the 18 major container ports in East Asia, together with another 21 important container ports located on the East–West trading route. Based on this sample network, the spatial structure of traffic flow consolidation reveals the nature and structure of hub-and-spoke operations within a port system, the relative hub-dependence of ports, the variety of roles which individual ports play within the overall structure of inter-port interactions and the hierarchical configuration of the port industry structure. The paper concludes that MLA offers new insights into the distributional inequality of traffic flows, the spatial and economic interactions between ports and the extent to which hinterlands overlap. Furthermore, the analysis clearly shows that inter-port relationships can no longer be evaluated as isolated phenomena; any change in a specific port’s competitiveness will directly impact upon the structure of the whole maritime transportation system. Port authorities and terminal operators will need, therefore, to carefully analyse and disentangle specific inter-port relationships in order to provide the most appropriate basis for their decision making.     

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.     

A private matter: the implications of privacy regulations for intelligent transportation systems

The rapid development and deployment of Intelligent Transportation Systems (ITS) that utilize data on the movement of vehicles can greatly benefit transportation network operations and safety, but may test the limits of personal privacy. In this paper we survey the current state of legal and industry-led privacy protections related to ITS and find that the lack of existing standards, rules, and laws governing the collection, storage, and use of such information could both raise troubling privacy questions and potentially hinder implementation of useful ITS technologies. We then offer practical recommendations for addressing ITS-related privacy concerns though both privacy-by-design solutions (that build privacy protections into data collection systems), and privacy-by-policy solutions (that provide guidelines for data collection and treatment) including limiting the scope of data collection and use, assuring confidentially of data storage, and other ways to build trust and foster consumer consent.     

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.     

Estimation of the perceived value of transit time for containerized cargoes

This paper proposes a novel method for estimating the perceived value of transit time of containers by shipping lines. The key idea is that a shipping line’s published schedule is the optimal decision that minimizes the sum of fuel cost and time-associated costs of the containers adopted by the shipping line. Using the proposed method, we find that the adopted values of transit time for nine trans-Pacific services operated by Orient Overseas Container Line and five trans-Pacific services operated by Maersk Line are between US$5/TEU/day and US$30/TEU/day. We further demonstrate how the adopted value can be used for designing the optimal transit times between ports, analyzing the viability of slow-steaming, checking whether ships should speed up to catch up to connecting ships on other services, and helping to predict the market share of less polluting fuels in view of rules on air emission.