Eine Plattform für die Wissenschaft: Bauingenieurwesen, Architektur und Urbanistik
Two-Stage Robust Programming Modeling for Continuous Berth Allocation with Uncertain Vessel Arrival Time
In order to mitigate the environmental pollution caused by sea freight, we focused on optimizing carbon emissions in container terminal operations. This paper establishes a mixed integer programming (MIP) model for a continuous berth allocation problem (CBAP) considering the tide time window. We aimed to minimize the total carbon emissions caused by the waiting time, consumption time and deviation to berth preference. In order to overcome the influence of an uncertain arrival time, the proposed MIP model was extended to mixed integer robust programming (MIRP) models, which applied a two-stage robust optimization (TSRO) approach to the optimal solution. We introduced an uncertainty set and scenarios to describe the uncertain arrival time. Due to the complexity of the resulting models, we proposed three particle swarm optimization (PSO) algorithms and made two novelties. The numerical experiment revealed that the robust models yielded a smaller variation in the objective function values, and the improved algorithms demonstrated a shorter solution time in solving the optimization problem. The results show the robustness of the constructed models and the efficiency of the proposed algorithms.
Two-Stage Robust Programming Modeling for Continuous Berth Allocation with Uncertain Vessel Arrival Time
In order to mitigate the environmental pollution caused by sea freight, we focused on optimizing carbon emissions in container terminal operations. This paper establishes a mixed integer programming (MIP) model for a continuous berth allocation problem (CBAP) considering the tide time window. We aimed to minimize the total carbon emissions caused by the waiting time, consumption time and deviation to berth preference. In order to overcome the influence of an uncertain arrival time, the proposed MIP model was extended to mixed integer robust programming (MIRP) models, which applied a two-stage robust optimization (TSRO) approach to the optimal solution. We introduced an uncertainty set and scenarios to describe the uncertain arrival time. Due to the complexity of the resulting models, we proposed three particle swarm optimization (PSO) algorithms and made two novelties. The numerical experiment revealed that the robust models yielded a smaller variation in the objective function values, and the improved algorithms demonstrated a shorter solution time in solving the optimization problem. The results show the robustness of the constructed models and the efficiency of the proposed algorithms.
Two-Stage Robust Programming Modeling for Continuous Berth Allocation with Uncertain Vessel Arrival Time
Shaojian Qu (Autor:in) / Xinqi Li (Autor:in) / Chang Liu (Autor:in) / Xufeng Tang (Autor:in) / Zhisheng Peng (Autor:in) / Ying Ji (Autor:in)
2023
Aufsatz (Zeitschrift)
Elektronische Ressource
Unbekannt
Metadata by DOAJ is licensed under CC BY-SA 1.0
Optimal berth allocation under regular and emergent vessel arrivals
SAGE Publications | 2021
|A New Genetic Algorithm for Continuous Berth and Quay Crane Allocation Problem
British Library Conference Proceedings | 2011
|GPA: First Vessel to Berth at Contaienr Wharf
British Library Online Contents | 1999
Long wave effects on a vessel at berth
Elsevier | 2014
|