An Investigation of Complex Network-Based Heuristic Rules for Integrated Scheduling of Automatic Container Terminals

2021 ◽  
Author(s):  
Zhanluo Zhang ◽  
Zilong Zhuang ◽  
Ruizhi Tan ◽  
Wei Qin ◽  
Huaijin Fang
2017 ◽  
Vol 11 (7) ◽  
pp. 402-412 ◽  
Author(s):  
Yimei Chang ◽  
Xiaoning Zhu ◽  
Baicheng Yan ◽  
Li Wang

2013 ◽  
Vol 446-447 ◽  
pp. 1334-1339 ◽  
Author(s):  
Seyed Hamidreza Sadeghian ◽  
Mohd Khairol Anuar Bin Mohd Ariffin ◽  
Say Hong Tang ◽  
Napsiah Binti Ismail

Automation of the processes at the quays of the world's large container ports is one of the answers to the required ever-increasing transshipment volumes within the same timeframe. For such purpose, using new generation of vehicles is unavoidable. One of the automatic vehicles that can be used in container terminals is Automated Lifting Vehicle (ALV). Integrated scheduling of handling equipments with quay cranes can increase the efficiency of automated transport systems in container. In this paper, an integrated scheduling of quay cranes and automated lifting vehicles with limited buffer space is formulated as a mixed integer linear programming model. This model minimizes the makespan of all the loading and unloading tasks for a pre-defined set of cranes in a scheduling problem.


2018 ◽  
Vol 126 ◽  
pp. 482-493 ◽  
Author(s):  
Yongsheng Yang ◽  
Meisu Zhong ◽  
Yasser Dessouky ◽  
Octavian Postolache

Author(s):  
Baicheng Yan ◽  
Xiaoning Zhu ◽  
Li Wang ◽  
Yimei Chang

In this paper, the integrated scheduling of handling equipment at the railway handling area in container terminals is studied, where rail-mounted gantry cranes, internal trucks, and reach stackers are deployed. In the course of the handling operation, loading and unloading containers are handled simultaneously. The handling process is first studied and some scheduling schemes are put forward. Based on the analysis, the problem is formulated as a mixed-integer programming model, with the objectives of minimizing the makespan and the total waiting time of all equipment. Then, to solve the problem, a genetic algorithm is employed, where the first available machine rule is applied in the selection of trucks and reach stackers. Sets of numerical experiments are conducted to verify the effect of the proposed algorithm. Based on the results of experiments, some key indicators are calculated and the effects of different equipment configuration schemes are studied.


PLoS ONE ◽  
2021 ◽  
Vol 16 (6) ◽  
pp. e0251875
Author(s):  
Di Luan ◽  
Mingjing Zhao ◽  
Qianru Zhao ◽  
Nan Wang

The coordination of different container-handling equipment is an important method for improving the overall efficiency of automated container terminals. In the real terminal, we should consider many real-life issues, such as the equipment capacity, the equipment collision, changing lanes in the multi-lane road, and choosing one of container-handling lanes for each container. This paper proposes the integrated scheduling problem of three container-handling equipment with the capacity constraint and the dual-cycle strategy, for simultaneously solving the equipment scheduling problem, the assignment problem of the container-handling lane and the conflict-free route planning problem of automated guided vehicles (AGVs). With the objective of minimizing the ship’s berth time, we propose a mixed-integer programming model based on the space-time network representation method and two bilevel optimization algorithms based on conflict resolution rules. Finally, numerical experiments are conducted to verify the effectiveness of the proposed model and two bilevel optimization algorithms.


Sign in / Sign up

Export Citation Format

Share Document