EURO 2024 Copenhagen
Abstract Submission

EURO-Online login

213. Stochastic Quay Partitioning Problem

Invited abstract in session WB-26: Combinatorial Optimization in Scheduling, stream Combinatorial Optimization.

Wednesday, 10:30-12:00
Room: 012 (building: 208)

Authors (first author is the speaker)

1. Maciej Drozdowski
Institute of Computing Science, Poznan University of Technology
2. Jakub Wawrzyniak
Institute of Computing Science, Poznan University of Technology
3. Eric Sanlaville
UFR Sciences et Techniques, LITIS
4. Frédéric Guinand
Université du Havre
5. Yoann Pigné
LITIS, Université Le Havre Normandie

Abstract

In this presentation we consider dividing a quay of container terminal into berth segments so that quality of service for future ship arrivals is as good as possible. This problem will be referred to as a stochastic quay partitioning problem (SQPP). SQPP is defined by a ship traffic model (STM), arrival intensity, quay length and a set of admissible berth lengths. Alternative solutions are evaluated on various arrival scenarios generated for certain arrival intensity from a stochastic traffic model (the STM). Evaluation of an SQPP solution on one scenario is a problem of scheduling the arriving vessels on the berths, which is a classic berth allocation problem (BAP). In SQPP the sizes of BAP instances which must be solved by far exceed capabilities of the methods presented in the existing literature. Therefore, tailored portfolios of algorithms capable of solving very large BAP instances under limited runtime are used. Features of SQPP solutions are studied experimentally. We demonstrate, that partitioning a quay into equal length berths is not always the best approach. A set of algorithms to partition a quay is proposed and evaluated.

Keywords

Status: accepted

Back to the list of papers