A new continuous berth allocation and quay crane assignment model in container terminal

被引:24
作者
Han XiaoLong [1 ]
Gong, Xing [1 ]
Jo, Jungbok [2 ]
机构
[1] Shanghai Maritime Univ, Logist Res Ctr, Shanghai, Peoples R China
[2] Dongseo Univ, Div Comp Engn, Busan, South Korea
关键词
Berth allocation; Quay crane assignment; Mathematical programming; PSO; SEARCH; ALGORITHM;
D O I
10.1016/j.cie.2015.04.033
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Over the past decades, Chinese ports throughput grew rapidly, and more and more concerns were shown on the operational efficiency and effectiveness. Many studies have been made for scheduling berth and quay cranes, which are the critical resources in container terminals. In this paper, a two-phase model for berth allocation and quay crane assignment is proposed. In the first phase, according to the relationships of time and space between vessels, a new continuous berth allocation model is established, in which not only the common restricts but the coverage area of quay crane are considered. Then in the quay crane assignment phase, a multi-objective programming model is proposed, in which the first objective is to minimize the range of maximum and minimum quay cranes used for resources saving, and the second one is to minimize the movements of quay cranes so as to improve the efficiency. A particle swarm optimization algorithm for BAP was developed. The results of numerical experiments show that the proposed approach can improve the essential operations in container terminal. (C) 2015 Elsevier Ltd. All rights reserved.
引用
收藏
页码:15 / 22
页数:8
相关论文
共 20 条
  • [1] A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery
    Ai, The Jin
    Kachitvichyanukul, Voratas
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (05) : 1693 - 1702
  • [2] Model and heuristic for berth allocation in tidal bulk ports with stock level constraints
    Barros, Victor Hugo
    Costa, Tarcisio Souza
    Oliveira, Alexandre C. M.
    Lorena, Luiz A. N.
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2011, 60 (04) : 606 - 613
  • [3] A survey of berth allocation and quay crane scheduling problems in container terminals
    Bierwirth, Christian
    Meisel, Frank
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 202 (03) : 615 - 627
  • [4] Models for the discrete berth allocation problem: A computational comparison
    Buhrkal, Katja
    Zuglian, Sara
    Ropke, Stefan
    Larsen, Jesper
    Lusby, Richard
    [J]. TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2011, 47 (04) : 461 - 473
  • [5] Models and tabu search heuristics for the Berth-allocation problem
    Cordeau, JF
    Laporte, G
    Legato, P
    Moccia, L
    [J]. TRANSPORTATION SCIENCE, 2005, 39 (04) : 526 - 538
  • [6] Clustering Search for the Berth Allocation Problem
    de Oliveira, Rudinei Martins
    Mauri, Geraldo Regis
    Nogueira Lorena, Luiz Antonio
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2012, 39 (05) : 5499 - 5505
  • [7] A multiprocessor task scheduling model for berth allocation: heuristic and worst-case analysis
    Guan, YP
    Xiao, WQ
    Cheung, RK
    Li, CL
    [J]. OPERATIONS RESEARCH LETTERS, 2002, 30 (05) : 343 - 350
  • [8] Berth allocation in a container port: using a continuous location space approach
    Imai, A
    Sun, X
    Nishimura, E
    Papadimitriou, S
    [J]. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2005, 39 (03) : 199 - 221
  • [9] The dynamic berth allocation problem for a container port
    Imai, A
    Nishimura, E
    Papadimitriou, S
    [J]. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2001, 35 (04) : 401 - 417
  • [10] The simultaneous berth and quay crane allocation problem
    Imai, Akio
    Chen, Hsieh Chia
    Nishimura, Etsuko
    Papadimitriou, Stratos
    [J]. TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2008, 44 (05) : 900 - 920