A job grouping approach for planning container transfers at automated seaport container terminals

被引:23
作者
Yuan, S. [1 ]
Skinner, B. T. [1 ]
Huang, S. [1 ]
Liu, D. K. [1 ]
Dissanayake, G. [1 ]
Lau, H. [2 ]
Pagac, D. [2 ]
机构
[1] Univ Technol Sydney, ARC Ctr Excellence Autonomous Syst CAS, Sydney, NSW 2007, Australia
[2] Patrick Technol Syst, Botany, NSW 2019, Australia
基金
澳大利亚研究理事会;
关键词
Modelling; Scheduling; Autonomous straddle carrier; Automated seaport container terminals; VEHICLE-ROUTING PROBLEMS; COLUMN GENERATION APPROACH; OPERATIONS-RESEARCH; DELIVERY PROBLEM; TIME WINDOWS; PICKUP; ALGORITHM; SYSTEMS;
D O I
10.1016/j.aei.2011.01.004
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper proposes a practical job grouping approach, which aims to enhance the time related performance metrics of container transfers in the Patrick AutoStrad container terminal, located in Brisbane, Australia. It first formulates a mathematical model of the automated container transfers in a relatively complex environment. Apart from the consideration on collision avoidance of a fleet of large vehicles in a confined area, it also deals with many other difficult practical challenges such as the presence of multiple levels of container stacking and sequencing, variable container orientations, and vehicular dynamics that require finite acceleration and deceleration times. The proposed job grouping approach aims to improve the makespan of the schedule for yard jobs, while reducing straddle carrier waiting time by grouping jobs using a guiding function. The performance of the current sequential job allocation method and the proposed job grouping approach are evaluated and compared statistically using a pooled t-test for 30 randomly generated yard configurations. The experimental results show that the job grouping approach can effectively improve the schedule makespan and reduce the total straddle carrier waiting time. (C) 2011 Elsevier Ltd. All rights reserved.
引用
收藏
页码:413 / 426
页数:14
相关论文
共 28 条
[1]  
[Anonymous], 2006, PROBABILITY STAT ENG
[2]   A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows [J].
Bent, R ;
Van Hentenryck, P .
COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (04) :875-893
[3]   A column generation approach to the heterogeneous fleet vehicle routing problem [J].
Choi, Eunjeong ;
Tcha, Dong-Wan .
COMPUTERS & OPERATIONS RESEARCH, 2007, 34 (07) :2080-2095
[4]   A COLUMN GENERATION APPROACH TO JOB GROUPING FOR FLEXIBLE MANUFACTURING SYSTEMS [J].
CRAMA, Y ;
OERLEMANS, AG .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1994, 78 (01) :58-80
[5]  
Dijkstra E. W., 1959, NUMER MATH, V1, P269
[6]   A simulation model for evaluating advanced dial-a-ride paratransit systems [J].
Fu, LP .
TRANSPORTATION RESEARCH PART A-POLICY AND PRACTICE, 2002, 36 (04) :291-307
[7]   Container terminals and terminal operations [J].
Guenther, Hans-Otto ;
Kim, Kap-Hwan .
OR SPECTRUM, 2006, 28 (04) :437-445
[8]  
Halpern, 1977, MATH METHOD OPER RES, V21, P117, DOI DOI 10.1007/BF01919767
[9]  
HARTMANN S., 2004, A general framework for scheduling equipment and manpower at container terminals
[10]   An architectural design of control software for automated container terminals [J].
Kim, KH ;
Won, SH ;
Lim, JK ;
Takahashi, T .
COMPUTERS & INDUSTRIAL ENGINEERING, 2004, 46 (04) :741-754