Container loading and unloading scheduling for a Mobile Harbor system: a global and local search method

被引:11
作者
Shin, Kyuhyeon [1 ]
Lee, Taesik [1 ]
机构
[1] Korea Adv Inst Sci & Technol, Dept Ind & Syst Engn, Taejon 305701, South Korea
关键词
Genetic Algorithm; Local search method; Mobile Harbor; Loading and unloading sequence; ALGORITHM; TERMINALS;
D O I
10.1007/s10696-012-9134-7
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Mobile Harbor (MH) is a type of mobile floating port system with an on-board crane for off-shore container handling capability. Due to its unique operational features, it creates a new type of operational scheduling problem. Container loading and unloading sequence schedule for the MH on-board crane is one such problem. An optimal schedule should minimize the on-board crane's moves in a stem-to-stern direction while satisfying MH's stability constraint. This paper presents a mathematical programming model to formally define the problem, and two heuristic methods, Genetic Algorithm (GA) method and local search method, are developed. Experimental results show that both GA and the local search method generate solutions of similar quality when the stability constraint is loose and that the local search method is not effective in finding a feasible solution for problems with a tight stability constraint.
引用
收藏
页码:557 / 575
页数:19
相关论文
共 14 条
[1]  
[Anonymous], 1999, Genetic Algorithms + Data Structures = Evolution Programs
[2]   A survey of berth allocation and quay crane scheduling problems in container terminals [J].
Bierwirth, Christian ;
Meisel, Frank .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 202 (03) :615-627
[3]  
Goldberg DE., 1989, GENETIC ALGORITHMS S, V13
[4]   A crane scheduling method for port container terminals [J].
Kim, KH ;
Park, YM .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2004, 156 (03) :752-768
[5]   Heuristic algorithms for routing yard-side equipment for minimizing loading times in container terminals [J].
Kim, KY ;
Kim, KH .
NAVAL RESEARCH LOGISTICS, 2003, 50 (05) :498-514
[6]  
Lee T, 2010, C SOC CAD CAM ENG
[7]   Container sequencing for quay cranes with internal reshuffles [J].
Meisel, Frank ;
Wichmann, Matthias .
OR SPECTRUM, 2010, 32 (03) :569-591
[8]   A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal [J].
Moccia, L ;
Cordeau, JF ;
Gaudioso, M ;
Laporte, G .
NAVAL RESEARCH LOGISTICS, 2006, 53 (01) :45-59
[9]   A tabu search heuristic for the quay crane scheduling problem [J].
Sammarra, Marcello ;
Cordeau, Jean-Francois ;
Laporte, Gilbert ;
Monaco, M. Flavia .
JOURNAL OF SCHEDULING, 2007, 10 (4-5) :327-336
[10]  
Shin K, 2010, P SPRING JOINT C KOR