Robust optimization of vessel scheduling under dual uncertainties

Due to adverse weather conditions and other meteorological factors, the arrival and departure times (ADTs) of vessels, as well as sailing times in port (STPs), exhibit significant variability during actual port operations. Scheduling schemes based on deterministic ADTs and STPs often fail to meet port production demands. This paper addresses the vessel scheduling problem under uncertain arrival and departure times (UADTs) and uncertain sailing times in port (USTPs), employing a robust optimization approach. We construct two uncertainty budget sets, one to describe the ADTs and the other to describe the STPs, and establish a robust optimization model for vessel scheduling (VS) aimed to minimizing overall times occupy by vessels in port. Leveraging model features, we propose a knowledge-driven memetic algorithm (KDMA) for solving the problem. Computational experiments are conducted at the Comprehensive port in Huanghua using various instance sizes. The results demonstrate the superiority of the proposed algorithm over others.

Authors

Institutions

Publication Details

Published
2024-12-20
DOI
https://doi.org/10.1117/12.3054819
Primary Topic
Maritime Ports and Logistics
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Robust optimization of vessel scheduling under dual uncertainties

Runfo Li, Wenquan Cao, Xinyu Zhang
Maritime Ports and Logistics
article

Robust optimization of vessel scheduling under dual uncertainties

Runfo Li, Wenquan Cao, Xinyu Zhang
article en

Abstract

Due to adverse weather conditions and other meteorological factors, the arrival and departure times (ADTs) of vessels, as well as sailing times in port (STPs), exhibit significant variability during actual port operations. Scheduling schemes based on deterministic ADTs and STPs often fail to meet port production demands. This paper addresses the vessel scheduling problem under uncertain arrival and departure times (UADTs) and uncertain sailing times in port (USTPs), employing a robust optimization approach. We construct two uncertainty budget sets, one to describe the ADTs and the other to describe the STPs, and establish a robust optimization model for vessel scheduling (VS) aimed to minimizing overall times occupy by vessels in port. Leveraging model features, we propose a knowledge-driven memetic algorithm (KDMA) for solving the problem. Computational experiments are conducted at the Comprehensive port in Huanghua using various instance sizes. The results demonstrate the superiority of the proposed algorithm over others.

Dalian Maritime University (CN)
Openalex Percentile: Top 65%
Maritime Ports and Logistics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.