Open AccessContainer Terminal Berth-Quay Crane Capacity Planning Based on Markov Chain
Author(s) -
Meixian Jiang,
Guoxing Wu,
Jiayin Zheng,
Guanghua Wu
Publication year - 2021
Publication title -
promet
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.315
H-Index - 19
eISSN - 1848-4069
pISSN - 0353-5320
DOI - 10.7307/ptt.v33i2.3578
Subject(s) - container (type theory) , terminal (telecommunication) , markov chain , computer science , operations research , markov process , queueing theory , markov model , capacity planning , engineering , mathematics , statistics , mechanical engineering , telecommunications , computer network , machine learning , operating system
This paper constructs a berth-quay crane capacity planning model with the lowest average daily cost in the container terminal, and analyzes the influence of the number of berths and quay cranes on the terminal operation. The object of berth-quay crane capacity planning is to optimize the number of berths and quay cranes to maximize the benefits of the container terminal. A steady state probability transfer model based on Markov chain for container terminal is constructed by the historical time series of the queuing process. The current minimum time operation principle (MTOP) strategy is proposed to correct the state transition probability of the Markov chain due to the characteristics of the quay crane movement to change the service capacity of a single berth. The solution error is reduced from 7.03% to 0.65% compared to the queuing theory without considering the quay crane movement, which provides a basis for the accurate solution of the berth-quay crane capacity planning model. The proposed berth-quay crane capacity planning model is validated by two container terminal examples, and the results show that the model can greatly guide the container terminal berth-quay crane planning.