Integrating berth allocation and quay crane assignments

被引:159
作者
Chang, Daofang [1 ,2 ]
Jiang, Zuhua [2 ]
Yan, Wei [1 ]
He, Junliang [1 ]
机构
[1] Shanghai Maritime Univ, Minist Educ, Container Supply Chain Technol Engn Res Ctr, Shanghai 200135, Peoples R China
[2] Shanghai Jiao Tong Univ, Sch Mech Engn, Shanghai 200240, Peoples R China
关键词
Berth allocation; Quay crane assignments; Objective programming; Rolling-horizon technique; Heuristic algorithm; Parallel genetic algorithm; CONTAINER; OPTIMIZATION; HEURISTICS; ALGORITHM;
D O I
10.1016/j.tre.2010.05.008
中图分类号
F [经济];
学科分类号
02 ;
摘要
In this study, a dynamic allocation model using objective programming for berth allocation and quay crane assignments was preliminarily developed based on rolling-horizon approach. Afterwards, a hybrid parallel genetic algorithm (HPGA), which combined parallel genetic algorithm (PGA) and heuristic algorithm, was employed to resolve the proposed model. Furthermore, a simulation was conducted to evaluate the HPGA and to execute relevant gene repair techniques. Eventually, the numerical experiments on a specific container terminal were applied to illustrate the proposed models and algorithms. In so doing, the effectiveness of the proposed approach was verified. Crown Copyright (C) 2010 Published by Elsevier Ltd. All rights reserved.
引用
收藏
页码:975 / 990
页数:16
相关论文
共 21 条
[1]  
[Anonymous], 2006, P 85 ANN M TRANSP RE
[2]   berth allocation strategy using heuristics algorithm and simulation optimisation [J].
Chang, Daofang ;
Yan, Wei ;
Chen, Chun-Hisen ;
Jiang, Zuhua .
INTERNATIONAL JOURNAL OF COMPUTER APPLICATIONS IN TECHNOLOGY, 2008, 32 (04) :272-281
[3]  
DAI J, 2007, SUPPLY CHAIN ANAL HD, P9
[4]   A multiprocessor task scheduling model for berth allocation: heuristic and worst-case analysis [J].
Guan, YP ;
Xiao, WQ ;
Cheung, RK ;
Li, CL .
OPERATIONS RESEARCH LETTERS, 2002, 30 (05) :343-350
[5]   A hybrid parallel genetic algorithm for yard crane scheduling [J].
He, Junliang ;
Chang, Daofang ;
Mi, Weijian ;
Yan, Wei .
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2010, 46 (01) :136-155
[6]   Berth allocation in a container port: using a continuous location space approach [J].
Imai, A ;
Sun, X ;
Nishimura, E ;
Papadimitriou, S .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2005, 39 (03) :199-221
[7]   The dynamic berth allocation problem for a container port [J].
Imai, A ;
Nishimura, E ;
Papadimitriou, S .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2001, 35 (04) :401-417
[8]   Berthing ships at a multi-user container terminal with a limited quay capacity [J].
Imai, Akio ;
Nishimura, Etsuko ;
Papadimitriou, Stratos .
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2008, 44 (01) :136-151
[9]   Berth allocation at indented berths for mega-containerships [J].
Imai, Akio ;
Nishimura, Etsuko ;
Hattori, Masahiro ;
Papadimitriou, Stratos .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 179 (02) :579-593
[10]   Berth scheduling by simulated annealing [J].
Kim, KH ;
Moon, KC .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2003, 37 (06) :541-560