Journal
ANNALS OF OPERATIONS RESEARCH
Volume -, Issue -, Pages -Publisher
SPRINGER
DOI: 10.1007/s10479-020-03891-3
Keywords
Berth allocation; Quay crane assignment; Stochastic programming; Two-stage meta-heuristic; Uncertainty; Proactive strategy and reactive strategy
Categories
Funding
- National Natural Science Foundation of China [72072112, 72002125, 71602114]
- Shanghai Rising-Star Program [19QA1404200]
- Shanghai Sailing Program [19YF1418800]
Ask authors/readers for more resources
This paper addresses the optimization of berth allocation and quay crane assignment problem (BACAP) under uncertainties in port operations planning. A proactive strategy is proposed to minimize recovery cost under uncertainty, with a stochastic programming model formulated to achieve this goal. A two-stage meta-heuristic framework based on GA is developed to solve the problem effectively.
The berth allocation and quay crane assignment problem (BACAP) is a complex port operation planning problem susceptible to uncertainties, such as vessel arrival time fluctuation to its estimated time of arrival and maritime markets. For promoting reliability and sustainability of container terminals, this paper addresses the optimization of BACAP under the uncertain vessels' arrival times and fluctuation of loading and unloading volumes. We propose a proactive BACAP strategy considering minimum recovery cost under uncertainty using a reactive strategy. A stochastic programming model is formulated to minimize the basic cost in the baseline schedule, and the recovery cost in real uncertain scenarios. A two-stage meta-heuristic framework based on GA is developed for solving this problem. Numerical experiments and scenario analysis are conducted to validate the effectiveness of the proposed model and the proposed solution approaches.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available