A Multi-objective Genetic Algorithm for Berth Allocation and Quay Crane Assignment Problem

被引:0
|
作者
Ji Xiaotao [1 ]
Du Yuquan [1 ]
Chen Qiushuang [1 ]
机构
[1] Nankai Univ, Coll Informat Sci & Technol, Dept Automat, Tianjin 300071, Peoples R China
关键词
berth allocation; quay crane assignment; behavioral operation research; multi-objective optimization; genetic algorithm;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We consider a berth allocation and quay crane assignment problem (BACAP) to concurrently optimize the two objectives: operation cost and customer satisfaction. We formulate the multi-objective BACAP as a mixed-integer nonlinear programming model. The latter objective is based on vessel departure tardiness which is measured from the perspective of behavioral operations research. A multi-objective genetic algorithm with a novel decoding scheme is proposed. Several efficient solutions can be obtained to facilitate the decision making in the terminal to trade-off the terminal cost and customer satisfaction.
引用
收藏
页码:891 / 896
页数:6
相关论文
共 7 条
  • [1] 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
  • [2] A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planning
    Liang, Chengji
    Huang, Youfang
    Yang, Yang
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2009, 56 (03) : 1021 - 1028
  • [3] Loch C., 2007, FDN TRENDS TECHNOL I, V1, P121
  • [4] Meisel F, 2009, CONTRIB MANAG SCI, P1, DOI 10.1007/978-3-7908-2191-8
  • [5] Heuristics for the integration of crane productivity in the berth allocation problem
    Meisel, Frank
    Bierwirth, Christian
    [J]. TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2009, 45 (01) : 196 - 209
  • [6] A scheduling method for Berth and Quay cranes
    Young-Man Park
    Kap Hwan Kim
    [J]. OR Spectrum, 2003, 25 (1) : 1 - 23
  • [7] Su X, 2009, INT WORKSH BOR BOM T