Space planning considering congestion in container terminal yards

被引:20
作者
Feng, Xuehao [1 ]
He, Yucheng [2 ]
Kim, Kap-Hwan [1 ]
机构
[1] Zhejiang Univ, Ocean Coll, Zhoushan 316021, Peoples R China
[2] IQIVA China, Shanghai 200001, Peoples R China
基金
中国国家自然科学基金;
关键词
Space planning; Container terminal; Congestion; Priority queue; Heuristic algorithm; STORAGE SPACE; ALLOCATION PROBLEM; CRANE DEPLOYMENT; TRUCK ARRIVALS; APPOINTMENTS; STRATEGY; MODEL;
D O I
10.1016/j.trb.2022.02.012
中图分类号
F [经济];
学科分类号
02 ;
摘要
This paper proposes a nonlinear mathematical model for solving the problem of allocating storage space to future container arrivals in container terminal yards by considering the waiting times of trucks in the yard, called stochastic space allocation model (SSAM). Three heuristic procedures based on the Frank-Wolfe algorithm and the subgradient optimization method are proposed to efficiently solve the problem. From the numerical experiment, it is found that the proposed al-gorithms for SSAM provide solutions with the gaps between the objective values and the optimal values are no greater than 0.69%. It was also found that the best algorithm among three proposed algorithms (FWMP-S) obtained the average 7.89% improvement in the objective value compared with a previous model with a handling capacity constraint instead of considering waiting time (DSAM). It is found that the SSAM reduces the average system time of transporters for ship operation and that of road trucks by 17.39 and 7.14%, respectively, compared with the DSAM. This study proposes the most appropriate heuristic algorithm depending on the problem char-acteristics of the SSAM.
引用
收藏
页码:52 / 77
页数:26
相关论文
共 50 条
  • [1] [Anonymous], SUSTAINABILITY-BASEL, V13, P1181
  • [2] Boyd S., 2009, COVEX OPTIMIZATION 7, V7th, P84
  • [3] SOLVING TRANSPORTATION PROBLEMS WITH NONLINEAR SIDE CONSTRAINTS WITH TABU SEARCH
    CAO, BY
    UEBE, G
    [J]. COMPUTERS & OPERATIONS RESEARCH, 1995, 22 (06) : 593 - 603
  • [4] A Novel Two-Stage Heuristic for Solving Storage Space Allocation Problems in Rail-Water Intermodal Container Terminals
    Chang, Yimei
    Zhu, Xiaoning
    [J]. SYMMETRY-BASEL, 2019, 11 (10):
  • [5] Optimizing time windows for managing export container arrivals at Chinese container terminals
    Chen, Gang
    Yang, Zhongzhen
    [J]. MARITIME ECONOMICS & LOGISTICS, 2010, 12 (01) : 111 - 126
  • [6] Chen P, 2002, EIGHTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI-02)/FOURTEENTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE (IAAI-02), PROCEEDINGS, P3
  • [7] Using time-varying tolls to optimize truck arrivals at ports
    Chen, Xiaoming
    Zhou, Xuesong
    List, George F.
    [J]. TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2011, 47 (06) : 965 - 982
  • [8] Solving semi-open queuing networks with time-varying arrivals: An application in container terminal landside operations
    Dhingra, Vibhuti
    Kumawat, Govind Lal
    Roy, Debjit
    de Koster, Rene
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 267 (03) : 855 - 876
  • [9] THE LAGRANGIAN-RELAXATION METHOD FOR SOLVING INTEGER PROGRAMMING-PROBLEMS
    FISHER, ML
    [J]. MANAGEMENT SCIENCE, 1981, 27 (01) : 1 - 18
  • [10] Geoffrion A. M., 1974, Approaches to Integer Programming, P82