Robust optimization for a class of ship traffic scheduling problem with uncertain arrival and departure times

被引:15
作者
Zhang, Xinyu [1 ]
Li, Runfo [1 ]
Wang, Chengbo [2 ]
Xue, Biao [3 ]
Guo, Wenqiang [1 ]
机构
[1] Dalian Maritime Univ, Nav Coll, Maritime Intelligent Transportat Res Team, Dalian 116026, Peoples R China
[2] Univ Sci & Technol China, Sch Informat Sci & Technol, Dept Automat, Hefei, Peoples R China
[3] Dalian Maritime Univ, Coll Maritime Econ & Management, Dalian, Peoples R China
关键词
Ship traffic scheduling; Uncertainty; Robust optimization; Budget uncertainty sets; Hybrid optimization method; VEHICLE-ROUTING PROBLEM; MEMETIC ALGORITHM; BERTH ALLOCATION; CHANNEL; MODEL; WATERWAY; SEARCH;
D O I
10.1016/j.engappai.2024.108257
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The scheduling of ship traffic in the port is an important operation that aims to improve the navigation efficiency of the port, which is greatly affected by a variety of unpredictable events. In line with this research direction, this paper explores the ship traffic scheduling problem (STSP) with uncertain arrival and departure times (STSP-UN). STSP-UN treats arrival and departure times as random variables, with the objective of generating a schedule plan that minimizes the total waiting time of ships in the port while accommodating all possible variations in arrival and departure times within predefined uncertainty sets. A robust counterpart of the deterministic STSP formulation is derived where the uncertain arrival and departure times are confined within budget uncertainty sets. To obtain solutions for the proposed model, a hybrid optimization method (MAVNS) is used, combining a memetic algorithm (MA) for global exploration with a variable neighborhood search algorithm (VNS) that utilizes problem-specific neighborhood operators for local search. Numerical experiments are carried out at the Comprehensive port in Huanghua based on various instance sizes. The results validate the rationality and effectiveness of both the proposed robust optimization model and the algorithm. Specifically, the solution produced by MAVNS is 44.40% and 27.65% superior to that of the genetic algorithm (GA) and MA, respectively, for small-scale instances. For large-scale instances, the improvement rate is 41.25% and 30.02% compared to GA and MA, respectively. The MAVNS algorithm is a superior approach compared to an adaptive heuristic algorithm based on reinforcement learning (GSAA-RL), with consistently better performance across all instances and an impressive average gap of 31.20%. Furthermore, compared to the First-Come-First-Served (FCFS) strategy, MAVNS consistently exhibits superior performance in all instances, highlighting a remarkable average gap of 98.67%. The research enables ports to better respond to unexpected situations and reduce the negative impacts caused by uncertainty.
引用
收藏
页数:16
相关论文
共 65 条
[41]   Transit Vessel Scheduling in the Strait of Istanbul [J].
Uluscu, Ozgecan S. ;
Ozbas, Birnur ;
Altiok, Tayfur ;
Or, Ilhan ;
Yilmaz, Tuba .
JOURNAL OF NAVIGATION, 2009, 62 (01) :59-77
[42]   Collision avoidance for autonomous ship using deep reinforcement learning and prior-knowledge-based approximate representation [J].
Wang, Chengbo ;
Zhang, Xinyu ;
Yang, Zaili ;
Bashir, Musa ;
Lee, Kwangil .
FRONTIERS IN MARINE SCIENCE, 2023, 9
[43]   A Hybrid Estimation of Distribution Algorithm for Unrelated Parallel Machine Scheduling with Sequence-Dependent Setup Times [J].
Wang, Ling ;
Wang, Shengyao ;
Zheng, Xiaolong .
IEEE-CAA JOURNAL OF AUTOMATICA SINICA, 2016, 3 (03) :235-246
[44]   Robust Optimization Model for Liner Ship Fleet Planning with Container Transshipment and Uncertain Demand [J].
Wang, Tingsong ;
Meng, Qiang ;
Wang, Shuaian .
TRANSPORTATION RESEARCH RECORD, 2012, (2273) :18-28
[45]   A new robust criterion for the vehicle routing problem with uncertain travel time [J].
Wu, Lei ;
Hifi, Mhand ;
Bederina, Hiba .
COMPUTERS & INDUSTRIAL ENGINEERING, 2017, 112 :607-615
[46]   An almost robust optimization model for integrated berth allocation and quay crane assignment problem [J].
Xiang, Xi ;
Liu, Changchun .
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2021, 104
[47]   An expanded robust optimisation approach for the berth allocation problem considering uncertain operation time [J].
Xiang, Xi ;
Liu, Changchun .
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2021, 103
[48]   Ship fire modelling and evacuation simulation in navigation tunnel [J].
Xie, Cheng ;
Huang, Liwen ;
Wang, Rui ;
Deng, Jian ;
Shu, Yaqing .
TUNNELLING AND UNDERGROUND SPACE TECHNOLOGY, 2022, 126
[49]   Adaptive neighborhood simulated annealing for the heterogeneous fleet vehicle routing problem with multiple cross-docks [J].
Yu, Vincent F. ;
Jewpanya, Parida ;
Redi, A. A. N. Perwira ;
Tsao, Yu-Chung .
COMPUTERS & OPERATIONS RESEARCH, 2021, 129
[50]   Model and algorithm for vessel scheduling optimisation through the compound channel with the consideration of tide height [J].
Zhang, Bin ;
Zheng, Zhongyi .
INTERNATIONAL JOURNAL OF SHIPPING AND TRANSPORT LOGISTICS, 2021, 13 (3-4) :445-461