A sample average approximation approach to the berth allocation problem with uncertain tides

被引:18
|
作者
Sheikholeslami, Abdorreza [1 ]
Ilati, Reza [1 ]
机构
[1] Iran Univ Sci & Technol, Civil Engn Fac, Transportat Planning Dept, Tehran, Iran
关键词
Berth allocation; container terminal; sample average approximation; random arrival; tides; CRANE SCHEDULING PROBLEM; GENETIC ALGORITHM; ARRIVAL; MODEL;
D O I
10.1080/0305215X.2017.1411483
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
The remarkable increases in containerized trade over the past few years have resulted in increased congestion and operational costs of container terminals, indicating the importance of the effective management of port resources under uncertainty. In this article, a novel berth allocation model is suggested for seaports, taking into consideration the disruptive effects of tides on the berthing schedule as well as the uncertainty in the arrival time of vessels. A rigorous mathematical model is presented along with a sample average approximation method to generate an efficient berth allocation plan. In addition, statistical analysis of real data gathered from a real case is presented. Numerical analysis has been conducted to verify the practical applications of the model proposed for the berth allocation problem under uncertainty. Computational results based on a real-world data set provided by Rajaee port, Iran, demonstrate the effectiveness of the proposed solution method.
引用
收藏
页码:1772 / 1788
页数:17
相关论文
共 50 条
  • [1] An expanded robust optimisation approach for the berth allocation problem considering uncertain operation time
    Xiang, Xi
    Liu, Changchun
    OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2021, 103
  • [2] Optimal Budget Allocation for Sample Average Approximation
    Royset, Johannes O.
    Szechtman, Roberto
    OPERATIONS RESEARCH, 2013, 61 (03) : 762 - 776
  • [3] ON THE BERTH ALLOCATION PROBLEM
    Alzaabi, Shaikha Ahmed Jumaa
    Diabat, Ali
    RAIRO-OPERATIONS RESEARCH, 2016, 50 (03) : 491 - 501
  • [4] A hybrid column generation approach for the Berth Allocation Problem
    Mauri, Geraldo R.
    Oliveira, Alexandre C. M.
    Lorena, Luiz A. N.
    EVOLUTIONARY COMPUTATION IN COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 2008, 4972 : 110 - 122
  • [5] Berth allocation problem with uncertain vessel handling times considering weather conditions
    Guo, Liming
    Wang, Jun
    Zheng, Jianfeng
    COMPUTERS & INDUSTRIAL ENGINEERING, 2021, 158
  • [6] An inexact sample average approximation approach for the stochastic connected facility location problem
    Bardossy, M. Gisela
    Raghavan, S.
    NETWORKS, 2017, 70 (01) : 19 - 33
  • [7] The berth allocation problem: A strong formulation solved by a Lagrangean approach
    Monaco, M. Flavia
    Sammarra, Marcello
    TRANSPORTATION SCIENCE, 2007, 41 (02) : 265 - 280
  • [8] Modeling the Impacts of Tides and the Virtual Arrival Policy in Berth Allocation
    Du, Yuquan
    Chen, Qiushuang
    Lam, Jasmine Siu Lee
    Xu, Ya
    Cao, Jin Xin
    TRANSPORTATION SCIENCE, 2015, 49 (04) : 939 - 956
  • [9] SAMPLE AVERAGE APPROXIMATION APPROACH TO MULTI-LOCATION TRANSSHIPMENT PROBLEM WITH CAPACITATED PRODUCTION
    Oezdemir, Deniz
    Yuecesan, Enver
    Herer, Yale T.
    PROCEEDINGS OF THE 2009 WINTER SIMULATION CONFERENCE (WSC 2009 ), VOL 1-4, 2009, : 2285 - +
  • [10] A quay crane assignment approach for berth allocation problem in container terminal
    Hu, Zhi-Hua
    2010 THIRD INTERNATIONAL SYMPOSIUM ON INTELLIGENT INFORMATION TECHNOLOGY AND SECURITY INFORMATICS (IITSI 2010), 2010, : 17 - 21