Quay crane scheduling in automated container terminal for the trade-off between operation efficiency and energy consumption

2021 ◽  
Vol 48 ◽  
pp. 101285
Author(s):  
Caimao Tan ◽  
Wei Yan ◽  
Jiantao Yue
2019 ◽  
Vol 120 (2) ◽  
pp. 253-264 ◽  
Author(s):  
Junliang He ◽  
Hang Yu ◽  
Caimao Tan ◽  
Wei Yan ◽  
Chao Jiang

Purpose The development of mega container ships and operational pressures puts forward higher requirements on the operational ability of the container terminal. Accordingly, the purpose of this paper is to propose an effective method for quay crane (QC) scheduling of multiple hatches vessel considering double-cycling strategy to improve the operation efficiency and reduce the risk of delay. Design/methodology/approach A mixed integer programming model, which covers the main operational constraints in a container terminal, is formulated to solve the quay crane scheduling problem (QCSP) with a novel objective. Findings A case study is presented and a number of numerical experiments are conducted to validate the effectiveness of the proposed model. Meanwhile, management insights are proposed. The results demonstrate that the proposed method can efficiently solve QCSP in a container terminal, and an interesting finding is that reducing the stack layers on the vessel can improve the operation efficiency of QC. Originality/value A new mathematical model is proposed for QC scheduling at the operational level, which considers the constraints of double-cycling strategy, multiple hatches and hatch covers. The proposed model also provides methods to research the QC double-cycling problem considering the balance between energy cost and operation efficiency.


2005 ◽  
Vol 53 (1) ◽  
pp. 45-59 ◽  
Author(s):  
Luigi Moccia ◽  
Jean-François Cordeau ◽  
Manlio Gaudioso ◽  
Gilbert Laporte

2014 ◽  
Vol 587-589 ◽  
pp. 1793-1796
Author(s):  
Chun Ji Wu ◽  
Li Hua Chen ◽  
Qing Yu Zhao ◽  
Jin Xin Cao

With the current development of the berth and quay crane in China, minimizing the total time of all ships stopping at the port, and maximizing the utilization rate of quay cranes to reduce the waiting time in the queue at the anchorage are the key to success in the field of container terminals. The objective of this paper is to minimize the total time of all stopped ships at the port and to maximize the operation efficiency of quay cranes. Compared with single berth and quay crane allocation, this paper analyzes the berth-quay crane as a whole, and an integer programming model with some constraints is built for this problem. Then the heuristic algorithm is used in this paper to optimize the problem and gain the solution. This paper provides a guide for practical operation.


2020 ◽  
Vol 37 (02) ◽  
pp. 2050007
Author(s):  
Xiao-Ming Yang ◽  
Xin-Jia Jiang

The yard crane (YC) scheduling problem is studied for a new terminal design, known as the Ground Trolley-based Automated Container Terminal (GT-ACT). At the operational level, the YC scheduling problem considering GT could be formalized as job sequencing. The cooperative operation of the twin YCs, GT and the transport vehicles is complicated, a small change in the operation sequence may cause a chain reaction, which could overthrow the partial sequence preferred previously. A hybrid algorithm based on the nested partition (NP) framework is proposed. The ant colony (AC) algorithm is combined in the method for solution construction, while genetic algorithm (GA) is used for the perturbation and backtrack purposes. Experiments show the hybrid method is effective for practical problems under different scales. The AC and GA algorithms play an important role in improving the optimization.


Sign in / Sign up

Export Citation Format

Share Document