Dispatching Vehicles Considering Uncertain Handling Times at Port Container Terminals

This paper considers the problem of vehicle dispatching at port container terminals in a dynamic environment. The problem deals with the assignment of delivery orders of containers to vehicles while taking into consideration the uncertainty in the travel times of the vehicles. Thus, a real-time vehicle dispatching algorithm is proposed for adaptation to the dynamic changes in the states of the container terminals. To evaluate the performance of the proposed algorithm, a simulation study was conducted by considering various values of decision parameters under the uncertainty in travel times. Further, the performance of the proposed algorithm was compared with those of heuristic algorithms from previous studies

Modelling of integrated vehicle scheduling and container storage problems in unloading process at an automated container terminal

Effectively scheduling vehicles and allocating storage locations for containers are two important problems in container terminal operations. Early research efforts, however, are devoted to study them separately. This paper investigates the integration of the two problems focusing on the unloading process in an automated container terminal, where all or part of the equipment are built in automation. We formulate the integrated problem as a mixed-integer programming (MIP) model to minimise ship’s berth time. We determine the detailed schedules for all vehicles to be used during the unloading process and the storage location to be assigned for all containers. A series of experiments are carried out for small-sized problems by using commercial software. A genetic algorithm (GA) is designed for solving large-sized problems. The solutions from the GA for the small-sized problems are compared with the optimal solutions obtained from the commercial software to verify the effectiveness of the GA. The computational results show that the model and solution methods proposed in this paper are efficient in solving the integrated unloading problem for the automated container terminal

Modelling of dual-cycle strategy for container storage and vehicle scheduling problems at automated container terminals

This study proposes a new approach to determine the dispatching rules of AGVs and container storage locations, considering both unloading and loading processes simultaneously. We formulate this problem as a mixed integer programming model, aiming to minimise the ship’s berth time. Optimal solutions can be obtained in small sizes, however, large-sized problems are hard to solve optimally in a reasonable time. Therefore, a heuristic method, i.e. genetic algorithm is designed to solve the problem in large sizes. A series of numerical experiments are carried out to evaluate the effectiveness of the integration approach and algorithm

Sustainable supply chain management in the digitalisation era: The impact of Automated Guided Vehicles

Internationalization of markets and climate change introduce multifaceted challenges for modern supply chain (SC) management in the today's digitalisation era. On the other hand, Automated Guided Vehicle (AGV) systems have reached an age of maturity that allows for their utilization towards tackling dynamic market conditions and aligning SC management focus with sustainability considerations. However, extant research only myopically tackles the sustainability potential of AGVs, focusing more on addressing network optimization problems and less on developing integrated and systematic methodological approaches for promoting economic, environmental and social sustainability. To that end, the present study provides a critical taxonomy of key decisions for facilitating the adoption of AGV systems into SC design and planning, as these are mapped on the relevant strategic, tactical and operational levels of the natural hierarchy. We then propose the Sustainable Supply Chain Cube (S2C2), a conceptual tool that integrates sustainable SC management with the proposed hierarchical decision-making framework for AGVs. Market opportunities and the potential of integrating AGVs into a SC context with the use of the S2C2 tool are further discussed

Control of free-ranging automated guided vehicles in container terminals

Container terminal automation has come to the fore during the last 20 years to improve their efficiency. Whereas a high level of automation has already been achieved in vertical handling operations (stacking cranes), horizontal container transport still has disincentives to the adoption of automated guided vehicles (AGVs) due to a high degree of operational complexity of vehicles. This feature has led to the employment of simple AGV control techniques while hindering the vehicles to utilise their maximum operational capability. In AGV dispatching, vehicles cannot amend ongoing delivery assignments although they have yet to receive the corresponding containers. Therefore, better AGV allocation plans would be discarded that can only be achieved by task reassignment. Also, because of the adoption of predetermined guide paths, AGVs are forced to deploy a highly limited range of their movement abilities while increasing required travel distances for handling container delivery jobs. To handle the two main issues, an AGV dispatching model and a fleet trajectory planning algorithm are proposed. The dispatcher achieves job assignment flexibility by allowing AGVs towards to container origins to abandon their current duty and receive new tasks. The trajectory planner advances Dubins curves to suggest diverse optional paths per origin-destination pair. It also amends vehicular acceleration rates for resolving conflicts between AGVs. In both of the models, the framework of simulated annealing was applied to resolve inherent time complexity. To test and evaluate the sophisticated AGV control models for vehicle dispatching and fleet trajectory planning, a bespoke simulation model is also proposed. A series of simulation tests were performed based on a real container terminal with several performance indicators, and it is identified that the presented dispatcher outperforms conventional vehicle dispatching heuristics in AGV arrival delay time and setup travel time, and the fleet trajectory planner can suggest shorter paths than the corresponding Manhattan distances, especially with fewer AGVs.Open Acces

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

Stochastic Modeling of Unloading and Loading Operations at a Container Terminal using Automated Lifting Vehicles

With growing worldwide trade, container terminals have grown in number and size. Many new terminals are now automated to increase operational efficiency. The key focus is on improving seaside processes, where a distinction can be made between single quay crane operations (all quay cranes are either loading or unloading containers) and overlapping quay crane operations (some quay cranes are loading while others are unloading containers). From existing studies, it is not clear if the design insights obtained from analyzing single operations, such as optimal stack layout, are consistent with the insights obtained from analyzing overlapping operations. In this paper, we develop new integrated stochastic models for analyzing the performance of overlapping loading and unloading operations that capture the complex stochastic interactions among quayside, vehicle, and stackside processes. Using these integrated models, we are able to show that that there are stack layout configurations that are robust for both single (either loading or unloading) and for overlapping (both loading and unloading) operations

DISPATCHING AND CONFLICT-FREE ROUTING OF VEHICLES IN NEW CONCEPTUAL AUTOMATED CONTAINER TERMINALS

Ph.DDOCTOR OF PHILOSOPH

Scheduling vehicles in automated transportation systems : algorithms and case study

One of the major planning issues in large scale automated transportation systems is so-called empty vehicle management, the timely supply of vehicles to terminals in order to reduce cargo waiting times. Motivated by a Dutch pilot project on an underground cargo transportation system using Automated Guided Vehicles CAGV s), we developed several rules and algorithms for empty vehicle management, varying from trivial First-Come, First-Served (FCFS) via look-ahead rules to integral planning. For our application, we focus on attaining customer service levels in the presence of varying order priorities, taking into account resource capacities and the relation to other planning decisions, such as terminal management We show how the various rules are embedded in a framework for logistics control of automated transportation networks. Using simulation, the planning options are evaluated on their performance in terms of customer service levels, AGV requirements and empty travel distances. Based on our experiments, we conclude that look-ahead rules have significant advantages above FCFS. A more advanced so-called serial scheduling method outperforms the look-ahead rules if the peak demand quickly moves amongst routes in the system