Application of Evolutionary Computation for Berth Scheduling at Marine Container Terminals: Parameter Tuning Versus Parameter Control

被引:64
作者
Dulebenets, Maxim A. [1 ]
机构
[1] Florida State Univ, Florida A&M Univ, Dept Civil & Environm Engn, Tallahassee, FL 32310 USA
关键词
Marine transportation; marine container terminals; berth scheduling; evolutionary computation; parameter control; ALLOCATION;
D O I
10.1109/TITS.2017.2688132
中图分类号
TU [建筑科学];
学科分类号
0813 ;
摘要
Considering a substantial increase in the international seaborne containerized trade volumes, marine container terminal operators have to improve efficiency of the processes inside their terminals in order to meet the growing demand. An efficient berth scheduling is of a high importance for the terminal's performance, as it significantly influences the turnaround time of vessels. This paper proposes a novel Evolutionary Algorithm to assist with berth scheduling at marine container terminals that, unlike published to date studies on berth scheduling, applies a parameter control strategy. Specifically, an adaptive mechanism is developed for the mutation operator, in which the mutation rate is altered based on feedback from the search. The objective of the proposed mixed integer model aims to minimize the total weighted vessel service cost. A set of numerical experiments are conducted to assess performance of the developed algorithm based on a comparison against a typical Evolutionary Algorithm that applies a constant mutation rate value, determined from the parameter tuning analysis. Results indicate that the optimality gap does not exceed 0.80% for both algorithms. Furthermore, deployment of the adaptive mechanism for the mutation operator yields an average of 5.4% and 8.5% savings in terms of the total weighted vessel service cost for medium and large size problem instances, respectively, without a significant increase in the computational time.
引用
收藏
页码:25 / 37
页数:13
相关论文
共 30 条
[21]   Berth scheduling by customer service differentiation: A multi-objective approach [J].
Golias, Mihalis M. ;
Boile, Maria ;
Theofanis, Sotirios .
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2009, 45 (06) :878-892
[22]   Berth allocation with service priority [J].
Imai, A ;
Nishimura, E ;
Papadimitriou, S .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2003, 37 (05) :437-457
[23]   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
[24]   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
[25]   Marine container terminal configurations for efficient handling of mega-containerships [J].
Imai, Akio ;
Nishimura, Etsuko ;
Papadimitriou, Stratos .
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2013, 49 (01) :141-158
[26]  
Mathworks, 2014, REL 2014A
[27]  
Pinedo M.L., 2008, Scheduling: Theory, algorithms, and systems
[28]   A Simulation Study on the Design of a Novel Automated Container Terminal [J].
Yang, Xiaoming ;
Mi, Weijian ;
Li, Xun ;
An, Guoli ;
Zhao, Ning ;
Mi, Chao .
IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2015, 16 (05) :2889-2899
[29]  
Zampelli S, 2013, LECT NOTES COMPUT SC, V8124, P880, DOI 10.1007/978-3-642-40627-0_64
[30]   A Comparative Study on Two Types of Automated Container Terminal Systems [J].
Zhen, Lu ;
Lee, Loo Hay ;
Chew, Ek Peng ;
Chang, Dao-Fang ;
Xu, Zhi-Xiang .
IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, 2012, 9 (01) :56-69