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.     

Energy-aware control for automated container terminals using integrated flow shop scheduling and optimal control

The performance of container terminals needs to be improved to handle the growth of transported containers and maintain port sustainability. This paper provides a methodology for improving the handling capacity of an automated container terminal in an energy-efficient way. The behavior of a container terminal is considered as consisting of a higher level and a lower level represented by discrete-event dynamics and continuous-time dynamics, respectively. These dynamics represent the behavior of a large number of terminal equipment. The dynamics need to be controlled. For controlling the higher level dynamics, a minimal makespan problem is solved. For this, the minimal time required by equipment for performing an operation at the lower level is needed. The minimal time for performing an operation at the lower level is obtained using Pontryagin’s Minimum Principle. The actual operation time allowed by the higher level for processing an operation at the lower level is subsequently determined by a scheduling algorithm at the higher level. Given an actual operation time, the lower level dynamics are controlled using optimal control to achieve minimal energy consumption while respecting the time constraint. Simulation studies illustrate how energy-efficient management of equipment for the minimal makespan could be obtained using the proposed methodology.     

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.     

Predictive path following with arrival time awareness for waterborne AGVs

Large ports are seeking innovative logistical ways to improve their competitiveness world-wide. This article proposes waterborne AGVs, inspired by conventional automated guided vehicles and autonomous surface vessels, for transport over water. A predictive path following with arrival time awareness controller is proposed for such waterborne AGVs. The controller is able to achieve smooth tracking and energy efficiency with arrival time awareness for transport oriented applications. Tracking errors are conveniently formulated with vessel dynamics modeled in connected reference path coordinate systems and a coordinate transformation at switching coordinate systems. Binary decision variables and logic constraints based on an along-track state are proposed for modeling switches in the framework of Model Predictive Control (MPC) so that overshoots are avoided. Moreover, timing-aware along-track references are generated by a two-level double integrator scheme. The lower level is embedded in online MPC optimizations for smooth tracking. The higher level solves a mixed-integer quadratic programming problem considering distance-to-go and time-to-go before each MPC optimization. References over the next prediction horizon are generated being aware of the requirements on arrival time. Furthermore, successive linearizations of nonlinear vessel dynamics about a shifted previous optimal system trajectory are implemented to maintain a trade-off between computational complexity and optimality. Simulation results of two industrially relevant Inter Terminal Transport case studies illustrate the effectiveness of the proposed modeling and control design for waterborne AGVs.     

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.     

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.     

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.     

Foreign participation and competition: A way to improve the container port efficiency in China?

This paper investigates how the involvement of foreign and local ownerships, intra- and inter-port competition and hinterland affect the container terminal efficiency in China and its neighboring countries. The operational efficiency of sample container terminals is estimated by data envelopment analysis, which is followed by regression analysis to examine factors affecting container terminal efficiency. We find that having some Chinese ownership may make a container terminal more efficient, while a container terminal is less efficient with Chinese as the major shareholder. It is also found that intra- and inter-port competition may enhance container terminal efficiency. Finally, the efficiency growth of terminals is examined, and implications for the regional economic disparity in China are discussed.     

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 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.     

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.     

Optimal vehicle trajectory planning in the context of cooperative merging on highways

One of the main triggers of traffic congestion on highways is vehicle merging at on-ramps. The development of automated procedures for cooperative vehicle merging is aimed to ensure safety and alleviate congestion problems. In this work, a longitudinal trajectory planning methodology is presented, developed to assist the merging of vehicles on highways; it achieves safe and traffic-efficient merging, while minimizing the engine effort and passenger discomfort through the minimization of acceleration and its first and second derivatives during the merging maneuver. The problem is formulated as a finite-horizon optimal control problem and is solved analytically. This enables the solution to be stored on-board, saving computational time and rendering the methodology suitable for practical applications. The tunable weights, used for taking into account the different optimization criteria, may serve as parameters to match the individual driver’s preferences. The proposed methodology is first developed for a pair of cooperating vehicles, a merging one and its putative leader. Moreover, an alternative solution procedure via a time-variant Linear-Quadratic Regulator approach is also presented. A Model Predictive Control (MPC) scheme is utilized to compensate possible disturbances in the trajectories of the cooperating vehicles, whereby the analytical optimal solution is applied repeatedly in real time, using updated measurements, until the merging procedure is actually finalized. Subsequently, the methodology is generalized for a set of vehicles inside the merging area. Various numerical simulations illustrate the validity and applicability of the method.     

Trajectory data reconstruction and simulation-based validation against macroscopic traffic patterns

This paper shows that the behavior of driver models, either individually or entangled in stochastic traffic simulation, is affected by the accuracy of empirical vehicle trajectories. To this aim, a “traffic-informed” methodology is proposed to restore physical and platoon integrity of trajectories in a finite time–space domain, and it is applied to one NGSIM I80 dataset. However, as the actual trajectories are unknown, it is not possible to verify directly whether the reconstructed trajectories are really “nearer” to the actual unknowns than the original measurements. Therefore, a simulation-based validation framework is proposed, that is also able to verify indirectly the efficacy of the reconstruction methodology. The framework exploits the main feature of NGSIM-like data that is the concurrent view of individual driving behaviors and emerging macroscopic traffic patterns. It allows showing that, at the scale of individual models, the accuracy of trajectories affects the distribution and the correlation structure of lane-changing model parameters (i.e. drivers heterogeneity), while it has very little impact on car-following calibration. At the scale of traffic simulation, when models interact in trace-driven simulation of the I80 scenario (multi-lane heterogeneous traffic), their ability to reproduce the observed macroscopic congested patterns is sensibly higher when model parameters from reconstructed trajectories are applied. These results are mainly due to lane changing, and are also the sought indirect validation of the proposed data reconstruction methodology.     

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.     

Eco approaching at an isolated signalized intersection under partially connected and automated vehicles environment

This research proposed an eco-driving system for an isolated signalized intersection under partially Connected and Automated Vehicles (CAV) environment. This system prioritizes mobility before improving fuel efficiency and optimizes the entire traffic flow by optimizing speed profiles of the connected and automated vehicles. The optimal control problem was solved using Pontryagin’s Minimum Principle. Simulation-based before and after evaluation of the proposed design was conducted. Fuel consumption benefits range from 2.02% to 58.01%. The CO₂ emissions benefits range from 1.97% to 33.26%. Throughput benefits are up to 10.80%. The variations are caused by the market penetration rate of connected and automated vehicles and v/c ratio. No adverse effect is observed. Detailed investigation reveals that benefits are significant as long as there is CAV and they grow with CAV’s market penetration rate (MPR) until they level off at about 40% MPR. This indicates that the proposed eco-driving system can be implemented with a low market penetration rate of connected and automated vehicles and could be implemented in a near future. The investigation also reveals that the proposed eco-driving system is able to smooth out the shock wave caused by signal controls and is robust over the impedance from conventional vehicles and randomness of traffic. The proposed system is fast in computation and has great potential for real-time implementation.     

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.     

Automated classification based on video data at intersections with heavy pedestrian and bicycle traffic: Methodology and application

Pedestrians and cyclists are amongst the most vulnerable road users. Pedestrian and cyclist collisions involving motor-vehicles result in high injury and fatality rates for these two modes. Data for pedestrian and cyclist activity at intersections such as volumes, speeds, and space–time trajectories are essential in the field of transportation in general, and road safety in particular. However, automated data collection for these two road user types remains a challenge. Due to the constant change of orientation and appearance of pedestrians and cyclists, detecting and tracking them using video sensors is a difficult task. This is perhaps one of the main reasons why automated data collection methods are more advanced for motorized traffic. This paper presents a method based on Histogram of Oriented Gradients to extract features of an image box containing the tracked object and Support Vector Machine to classify moving objects in crowded traffic scenes. Moving objects are classified into three categories: pedestrians, cyclists, and motor vehicles. The proposed methodology is composed of three steps: (i) detecting and tracking each moving object in video data, (ii) classifying each object according to its appearance in each frame, and (iii) computing the probability of belonging to each class based on both object appearance and speed. For the last step, Bayes’ rule is used to fuse appearance and speed in order to predict the object class. Using video datasets collected in different intersections, the methodology was built and tested. The developed methodology achieved an overall classification accuracy of greater than 88%. However, the classification accuracy varies across modes and is highest for vehicles and lower for pedestrians and cyclists. The applicability of the proposed methodology is illustrated using a simple case study to analyze cyclist–vehicle conflicts at intersections with and without bicycle facilities.     

Automated shunting of rail container wagons in ports and terminal areas

The development of intermodal container transport is hampered in part by the cost associated with the shunting of trains in marshalling yards, inland and port railway terminals. Many new technologies have been developed in the past decade, but have still not been applied because of high capital investment costs, lack of sufficient market demand and uncertain rates of return. The key for increasing the competitiveness of intermodal container transport by rail is the operation of heavy haul container trains between port and inland railway terminals more frequently with fast, flexible and automatic transhipment, shunting and coupling of container wagons. The operation of self-driven railcars equipped with automatic centre coupling on terminal tracks, which can also be train-hauled on conventional hinterland railway lines, would enable a reduction of shunting and transhipment time and costs in intermodal container terminals by more than 30%.     

Optimal competitive freight network design as hierarchical variational inequalities programming problems

Freight networks are a case of systems that multiple participants are composing interrelations along the complete supply chain. Their interrelations correspond to alternative behavior, namely, cooperation, non-cooperation and competition, while they are large-scale spatially distributed systems combining multiple means of transportation and the infrastructure and equipment typically utilized for servicing demand, results to a complex system integration. In this paper, the case of the optimal design of freight networks is investigated, aiming to highlight the particularities emerging in this case of transportation facilities strategic and/or operational planning and the multiple game-theoretic and equilibrium problems that are structured in cascade and in hierarchies. The application that is investigated here focuses in the design of a significant ‘player’ of the freight supply chain, namely container terminals, while the proposed framework will aim on analyzing investment strategies built on integrated demand–supply models and the optimal network design format. The approach will build on the multilevel Mathematical Programming with Equilibrium Constraints (MPECs) formulation, but is further extended to cope with the properties introduced by the ‘designers’ (infrastructure authorities), shippers and carriers competition in all levels of MPECs. Since container terminals are typically competing each other, the nomenclature used here for formulating appropriate MPECs problems are based on hierarchies of Variational Inequalities (VI) problems, able to capture the alternative relationships emerging in realistic freight supply chains. The proposed formulations of the competitive network design case is addressed by a novel approach of co-evolutionary agents, which can be regarded as new in equilibrium estimation. Finally, the results are compared with alternative network design cases, namely the centralized cooperative and exchanging design. Under this analysis it is able to highlight the differences among alternative design cases, but moreover an estimation of the ‘price of anarchy’ in transportation systems design is offered, an element of both theoretical as well as practical relevance.     

Conflict‐free time‐based trajectory planning for aircraft taxi automation with refined taxiway modeling

To mitigate airport congestion caused by increasing air traffic demand, the trajectory‐based surface operations concept has been proposed to improve surface movement efficiency while maintaining safety. It utilizes decision support tools to provide optimized time‐based trajectories for each aircraft and uses automation systems to guide surface movements and monitor their conformance with assigned trajectories. Whether the time‐based trajectories can be effectively followed so that the expected benefits can be guaranteed depends firstly on whether these trajectories are realistic. So, this paper first deals with the modeling biases of the network model typically used for taxi trajectory planning via refined taxiway modeling. Then it presents a zone control‐based dynamic routing and timing algorithm upon the refined taxiway model to find the shortest time taxi route and timings for an aircraft. Finally, the presented algorithm is integrated with a sequential planning framework to continuously decide taxi routes and timings. Experimental results demonstrate that the solution time for an aircraft can be steadily around a few milliseconds with timely cleaning of expired time windows, showing potential for real‐time decision support applications. The results also show the advantages of the proposed methodology over existing approaches. Copyright © 2015 John Wiley & Sons, Ltd.