scholarly journals Integrated internal truck, yard crane and quay crane scheduling in a container terminal considering energy consumption

2015 ◽  
Vol 42 (5) ◽  
pp. 2464-2487 ◽  
Author(s):  
Junliang He ◽  
Youfang Huang ◽  
Wei Yan ◽  
Shuaian Wang
2005 ◽  
Vol 53 (1) ◽  
pp. 45-59 ◽  
Author(s):  
Luigi Moccia ◽  
Jean-François Cordeau ◽  
Manlio Gaudioso ◽  
Gilbert Laporte

2014 ◽  
Vol 587-589 ◽  
pp. 1789-1792
Author(s):  
Yong Liang Zhou ◽  
Ri Dong Wang ◽  
Qing Yu Zhao ◽  
Jin Xin Cao

In recent decade, containers become an important part of the world's economy. With the growth in offshore trade, problems about container and port are attention by research scholars in many countries. In the study on the problem in container ports, Berth Allocation and Quay Crane Scheduling problem are very important; optimization of the two problems can improve the efficient of container ports. In this paper, we describe and classify the main Berth Allocation Processes and Quay Crane Scheduling and present a survey of methods for their single optimization and integrate optimization.


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.


Author(s):  
D. Souravlias ◽  
M. B. Duinkerken ◽  
S. Morshuis ◽  
D. L. Schott ◽  
R. R. Negenborn

The scheduling of quay cranes is a core logistics challenge that affects significantly the loading and unloading time of a vessel berthed at a container terminal. In this paper, we study the Stochastic Floating Quay Crane Scheduling Problem involving cranes situated on the quay of an offshore modular platform. Specifically, we consider the case in which each crane is situated on a different module of the platform, thereby confining its operation range. Additionally, we assume stochastic crane productivity rates due to the effect of the offshore wind. To tackle the problem, we propose a simheuristic framework, which combines Iterated Local Search with Monte Carlo Sampling into a joint collaborative scheme. The main objective is to minimize the expected completion time of the loading and unloading process taking into account precedence, nonsimultaneity, non-crossing, and spatial constraints of the problem at hand. The performance of the proposed simheuristic is investigated on a set of established problem instances across different configuration parameters and under various real-world environmental scenarios offering insightful conclusions.


2021 ◽  
Vol 119 ◽  
pp. 07005
Author(s):  
Sanaa Aidi ◽  
Imane Torbi ◽  
Mohamed Mazouzi ◽  
Imad Belassiria

The quay crane scheduling problem plays an essential role in the port container terminal management paradigm, as it is closely related to the berthing time of ships. In this article, we focus on the quay crane scheduling problem based on a special strategy, which forces the quay crane to move in one direction during the process of unloading and loading the containers. The scheduling problem that arises when this strategy is applied is called the one-way scheduling problem of quay cranes in the literature. In this article, we seek a mathematical formula for the unidirectional scheduling problem of quay cranes that can be easily solved by genetic algorithms. This algorithm provides us with the best combination of containers to unload and load at the optimal time.


Sign in / Sign up

Export Citation Format

Share Document