Periodic and Collaborative Allocation of Berth-Yard-Gate Resources at Container Terminals

被引:0
|
作者
Han X. [1 ]
Ju L. [1 ]
Luan C. [1 ]
Lu Z. [1 ]
机构
[1] School of Mechanical Engineering, Tongji University, Shanghai
关键词
Container terminal; Gate; Genetic algorithm; Periodicity; Resource allocation;
D O I
10.3969/j.issn.0258-2724.20170924
中图分类号
学科分类号
摘要
In order to improve the efficiency of import/export container terminals in periodic environment, the periodical and collaborative allocation problem of key resources at container terminals, including berth, yard and gate is investigated. A mixed-integer linear programming model is first established for the integrated scheduling of three types of resources. This model takes into account the capacity restrictions, inter-relationships and periodicity requirements, and sets the objective of minimizing total dwelling time of all vessels. Furthermore, an adaptive genetic algorithm is proposed to find a solution. As for the algorithm, the upper level performs evolutionary search within the space consisting the encoded vessel priority lists, while the lower level decodes each vessel priority to generate a complete resource allocation plan by heuristics, and returns its evaluation for upper level iteration. Numeral experiments shows that with the collaborative allocation of berth-yard-gate resources, the dwelling time of vessels in the execution of periodic plan is shortened by 20% comparing to traditional two-stage method. © 2019, Editorial Department of Journal of Southwest Jiaotong University. All right reserved.
引用
收藏
页码:840 / 847
页数:7
相关论文
共 17 条
  • [1] Gui X., Lu Z., Han X., Integrating optimization method for continuous berth and quay crane scheduling in container terminals, Journal of Shanghai Jiaotong University, 47, 2, pp. 226-229, (2013)
  • [2] Qin J., Ni L., Wang C., Et al., Optimization model and algorithm for quay crane scheduling in container terminals, Journal of Southwest Jiaotong University, 48, 1, pp. 184-192, (2013)
  • [3] Li M., Yip T.L., Joint planning for yard storage space and home berths in container terminals, International Journal of Production Research, 51, 10, pp. 3143-3155, (2013)
  • [4] Ng W.C., Mak K.L., Li M., Yard planning for vessel services with a cyclical calling pattern, Engineering Optimization, 42, 11, pp. 1039-1054, (2010)
  • [5] Zhang C., Liu J., Wan Y.W., Et al., Storage space allocation in container terminals, Transportation Research Part B: Methodological, 37, 10, pp. 883-903, (2003)
  • [6] Chen L., Lu Z., The storage location assignment problem for outbound containers in a maritime terminal, International Journal of Production Economics, 135, 1, pp. 73-80, (2012)
  • [7] Moorthy R., Teo C.P., Berth management in container terminal: the template design problem, OR spectrum, 28, 4, pp. 495-518, (2006)
  • [8] Hendriks M.P.M., Lefeber E., Udding J.T., Simultaneous berth allocation and yard planning at tactical level, OR Spectrum, 35, 2, pp. 441-456, (2013)
  • [9] Cordeau J.F., Laporte G., Legato P., Et al., Models and tabu search heuristics for the berth-allocation problem, Transportation Science, 39, 4, pp. 526-538, (2005)
  • [10] Lu Z., Chew E.P., Lee L.H., An integrated model for berth template and yard template planning in transshipment hubs, Transportation Science, 45, 4, pp. 483-504, (2011)