An Optimization Approach to Berth Allocation Problems
Shu-Chuan Chang, Ming-Hua Lin, Jung-Fa Tsai
Source abstract
The berth allocation problem determining the berthing time and position for incoming vessels in port operations has garnered increased attention within the global transportation network. This study focuses on the berth allocation problem with a continuous quay and dynamic vessel arrivals. With the overarching goal of enhancing service quality and optimizing berth utilization rates, this article proposes a mathematical programming model that minimizes the total waiting time of vessels and the overall completion time of vessel service. The formulated model is a mixed-integer linear programming problem that deterministic optimization techniques can globally solve. For large-scale problems, this study develops a genetic algorithm optimization approach to improve computational efficiency in reaching a near-optimal solution. Several numerical experiments are conducted to demonstrate the effectiveness and efficiency of the proposed approach.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.