Adaptive particle swarm optimization for integrated quay crane and yard truck scheduling problem

被引:48
作者
Dang Cong Hop [1 ]
Nguyen Van Hop [1 ]
Truong Tran Mai Anh [1 ]
机构
[1] Int Univ, VNU HCMC, Sch Ind Engn & Management, Quarter 6, Ho Chi Minh City, Vietnam
关键词
Quay crane; Yard truck; Scheduling; Particle Swarm Optimization (PSO); DISPATCHING METHOD; ALGORITHM; ASSIGNMENT; VEHICLES; BRANCH; BERTH;
D O I
10.1016/j.cie.2020.107075
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
This study takes into account the integrated quay crane and yard truck scheduling problem in which the yard truck picks containers at quay crane and then transports required containers to the container yard then return to the quay crane without carrying exported containers. A new mixed - integer programming model is formulated to capture two more conditions on the number of containers to be handled by quay crane and yard truck at a time. The objective is to minimize total time to complete the unloading and transporting operations for all required containers. Moreover, an Adaptive Particle Swarm Optimization (APSO) algorithm with all automatically adjusted parameters of inertia weight, cognitive coefficient and social coefficient is developed to search for better solutions. The proposed APSO gives closed optimal solutions obtained from the mixed - integer program. It also gives better performance than similar metaheuristic approaches such as Fixed Particle Swarm Optimization (FPSO) and Grey Wolf Optimization (GWO) for large sized problems in reasonable time.
引用
收藏
页数:12
相关论文
共 32 条
[1]   The quay crane scheduling problem with nonzero crane repositioning time and vessel stability constraints [J].
Al-Dhaheri, Noura ;
Jebali, Aida ;
Diabat, Ali .
COMPUTERS & INDUSTRIAL ENGINEERING, 2016, 94 :230-244
[2]   A Mathematical Model and Grouping Imperialist Competitive Algorithm for Integrated Quay Crane and Yard Truck Scheduling Problem with Non-crossing Constraint [J].
Behjat, S. ;
Nahavandi, N. .
INTERNATIONAL JOURNAL OF ENGINEERING, 2019, 32 (10) :1464-1479
[3]   A fast heuristic for quay crane scheduling with interference constraints [J].
Bierwirth, Christian ;
Meisel, Frank .
JOURNAL OF SCHEDULING, 2009, 12 (04) :345-360
[4]   Integrated scheduling of crane handling and truck transportation in a maritime container terminal [J].
Chen, Lu ;
Langevin, Andre ;
Lu, Zhiqiang .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2013, 225 (01) :142-152
[5]   The berth allocation problem in terminals with irregular layouts [J].
Correcher, Juan Francisco ;
Van den Bossche, Thomas ;
Alvarez-Valdes, Ramon ;
Vanden Berghe, Greet .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 272 (03) :1096-1108
[6]   THE CRANE SCHEDULING PROBLEM [J].
DAGANZO, CF .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 1989, 23 (03) :159-175
[7]   A multi-vessel quay crane assignment and scheduling problem: Formulation and heuristic solution approach [J].
Fu, Yi-Min ;
Diabat, Ali ;
Tsai, I-Tsung .
EXPERT SYSTEMS WITH APPLICATIONS, 2014, 41 (15) :6959-6965
[8]   Integrated internal truck, yard crane and quay crane scheduling in a container terminal considering energy consumption [J].
He, Junliang ;
Huan, Youfang ;
Yan, Wei ;
Wang, Shuaian .
EXPERT SYSTEMS WITH APPLICATIONS, 2015, 42 (05) :2464-2487
[9]   Recoverable robustness in weekly berth and quay crane planning [J].
Iris, Cagatay ;
Lam, Jasmine Siu Lee .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2019, 122 :365-389
[10]   Self Adaptive Acceleration Factor in Particle Swarm Optimization [J].
Jadon, Shimpi Singh ;
Sharma, Harish ;
Bansal, Jagdish Chand ;
Tiwari, Ritu .
PROCEEDINGS OF SEVENTH INTERNATIONAL CONFERENCE ON BIO-INSPIRED COMPUTING: THEORIES AND APPLICATIONS (BIC-TA 2012), VOL 1, 2013, 201 :325-340