Modelling and solution approaches to the multi-load AGV dispatching problem in container terminals

2011 ◽  
Vol 13 (4) ◽  
pp. 371-386 ◽  
Author(s):  
Evelina Klerides ◽  
Eleni Hadjiconstantinou

2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Xiaoyang Ma ◽  
Yongming Bian ◽  
Fei Gao

Multiload AGVs, which can carry more than one container at a time, are widely used in automated container terminals. The dispatching decisions for multiload AGVs serving in automated container terminals on the target of minimum travel distance are significant in the process of container transportation in terms of improving operating efficiency. Previous work usually focused on AGVs working in a single-carrier mode, which was not only inconsistent with actual circumstances but also a waste of resources. In this paper, we establish a new mathematical model to describe multiload AGVs operating in automated container terminals, which is closer to the actual situation in real terminals. Based on this improved model, we propose a priority rule-based algorithm, termed as shuffled frog leaping algorithm with a mutant process (SFLAMUT), which can increase the diversity of the population and improve the convergence rate. Experiments were carried out based on data generated randomly according to the working properties of container terminals, and it is observed that the proposed SFLAMUT presents an effective and efficient exploration process and yields promising results in solving the proposed mathematical model.





2021 ◽  
Vol 15 ◽  
pp. 174830262199401
Author(s):  
Hammed Bisira ◽  
Abdellah Salhi

There are many ways to measure the efficiency of the storage area management in container terminals. These include minimising the need for container reshuffle especially at the yard level. In this paper, we consider the container reshuffle problem for stacking and retrieving containers. The problem was represented as a binary integer programming model and solved exactly. However, the exact method was not able to return results for large instances. We therefore considered a heuristic approach. A number of heuristics were implemented and compared on static and dynamic reshuffle problems including four new heuristics introduced here. Since heuristics are known to be instance dependent, we proposed a compatibility test to evaluate how well they work when combined to solve a reshuffle problem. Computational results of our methods on realistic instances are reported to be competitive and satisfactory.





Author(s):  
Cuong Truong Ngoc ◽  
Xiao Xu ◽  
Hwan-Seong Kim ◽  
Duy Anh Nguyen ◽  
Sam-Sang You

This paper deals with three-dimensional (3D) model of competitive Lotka-Volterra equation to investigate nonlinear dynamics and control strategy of container terminal throughput and capacity. Dynamical behaviors are intensely explored by using eigenvalue evaluation, bifurcation analysis, and time-series data. The dynamical analysis is to show the stability with bifurcation of the competition and collaboration of multiple container terminals in the maritime transportation. Based on the chaotic analysis, the sliding mode control theory has been utilized for optimization of port operations under disruptions. Extensive numerical simulations have been conducted to validate the efficacy and reliability of the presented control algorithms. Particularly, the closed-loop system has been assessed through chaotic suppression and synchronization strategies for port management. Finally, the presented fundamental techniques can be utilized to provide managerial insights and solutions on efficient seaport operations that allow more timely and cost-effective decision making for port authorities in such a highly competitive environment.



Sign in / Sign up

Export Citation Format

Share Document