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 条
  • [41] A berth allocation planning problem with direct transshipment consideration
    Chengji Liang
    Hark Hwang
    Mitsuo Gen
    Journal of Intelligent Manufacturing, 2012, 23 : 2207 - 2214
  • [42] A MEMETIC ALGORITHM FOR A CONTINUOUS CASE OF THE BERTH ALLOCATION PROBLEM
    Mauri, Geraldo Regis
    de Andrade, Larice Nogueira
    Nogueira Lorena, Luiz Antonio
    ECTA 2011/FCTA 2011: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION THEORY AND APPLICATIONS AND INTERNATIONAL CONFERENCE ON FUZZY COMPUTATION THEORY AND APPLICATIONS, 2011, : 105 - 113
  • [43] Berth Allocation and Quay Crane Assignment Considering the Uncertain Maintenance Requirements
    Li, Siwei
    Song, Liying
    APPLIED SCIENCES-BASEL, 2025, 15 (02):
  • [44] The berth allocation problem with stochastic vessel handling times
    Jeffery Karafa
    Mihalis M. Golias
    Stephanie Ivey
    Georgios K. D. Saharidis
    Nikolaos Leonardos
    The International Journal of Advanced Manufacturing Technology, 2013, 65 : 473 - 484
  • [45] The berth allocation problem with stochastic vessel handling times
    Karafa, Jeffery
    Golias, Mihalis M.
    Ivey, Stephanie
    Saharidis, Georgios K. D.
    Leonardos, Nikolaos
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2013, 65 (1-4) : 473 - 484
  • [46] Priority control of berth allocation problem in container terminals
    Evrim Ursavas
    Annals of Operations Research, 2022, 317 : 805 - 824
  • [47] Berth allocation problem: Formulation and a Tunisian case study
    Kallel L.
    Benaissa E.
    Kamoun H.
    Benaissa M.
    Archives of Transport, 2019, 51 (03) : 85 - 100
  • [48] A sample average approximation-based heuristic for the stochastic production routing problem
    Geiger, Andreas
    CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH, 2025, 33 (01) : 121 - 144
  • [49] Sample average approximation of CVaR-based Wardrop equilibrium in routing under uncertain costs
    Cherukuri, Ashish
    2019 IEEE 58TH CONFERENCE ON DECISION AND CONTROL (CDC), 2019, : 3164 - 3169
  • [50] A Dynamic and Discrete Berth Allocation Problem in Container Terminals Considering Tide Effects
    Abdolreza Sheikholeslami
    Mehdi Mardani
    Ehsan Ayazi
    Hesam Arefkhani
    Iranian Journal of Science and Technology, Transactions of Civil Engineering, 2020, 44 : 369 - 376