3080. The Strategic Berth Template Problem with Uncertain Arrival Times
Invited abstract in session MB-32: Seaside Planning-2, stream Maritime and Port Logistics.
Monday, 10:30-12:00Room: Maurice Keyworth 1.09
Authors (first author is the speaker)
| 1. | Manuel Munoz-Marquez
|
| Statistics and Operations Research, Cadiz University |
Abstract
The Berth Allocation Problem (BAP) involves assigning berthing positions and service times to ships arriving at container terminals. Various BAP models exist, considering berth types and ship arrival uncertainties. Ship calls may exceed port service capacity, making it unfeasible to serve all requests. The Strategic Berth Template Problem (SBTP) addresses this by determining which ships should be served and when/where, applying a cyclic template for recurring arrivals. Additionally, service decisions may link certain ships, requiring them to be served or rejected as a group.
A major challenge in berth allocation is uncertainty in ship arrival times, often unknown at the planning stage. This study extends SBTP by incorporating stochastic elements, creating the Stochastic Berth Template Problem (SSBTP). Initially, a worst-case analysis approach is applied, yielding highly conservative solutions. To improve flexibility, budget uncertainty analysis is introduced, limiting total uncertainty without losing the feasibility, resulting in a worst-case scenario.
To refine the model, a customized budget uncertainty approach is developed. It introduces valid inequalities and an embedded subproblem, which is integrated using dualization techniques. Extensive numerical experiments demonstrate the model's effectiveness. The impact of uncertainty inclusion is analyzed, particularly the relationship between the budget uncertainty parameter and waiting times.
Keywords
- Logistics
- Maritime applications
- Optimization Modeling
Status: accepted
Back to the list of papers