EURO 2024 Copenhagen
Abstract Submission

EURO-Online login

1731. Partial container premarshalling approaches using constraint programming

Invited abstract in session MB-62: Container Stacking and Yard Planning I, stream OR in Port Operations.

Monday, 10:30-12:00
Room: S12 (building: 101)

Authors (first author is the speaker)

1. Celia Jiménez-Piqueras
Danmarks Tekniske Universitet
2. Dario Pacino
Department of Management, Technology and Economics, Technical University of Denmark

Abstract

The premarshalling problem aims to rearrange the containers in a port yard bay, comprising a set of adjacent stacks, to prevent containers from being placed above others that must be retrieved earlier. This arrangement streamlines retrieval from the bay for transfers to inland or maritime transport, as additional relocations are avoided at the time of retrieval. Premarshalling is only performed during crane idle times, and the original formulation of the problem assumes these times are unlimited. However, constraints in practice may limit the time available, hindering full bay arrangement. In such cases, partial premarshalling can still enhance retrieval efficiency within time constraints, but existing formulations for complete premarshalling lack adaptation for partial solutions, yielding suboptimal outcomes. Furthermore, while the goal of premarshalling is clear, to achieve a fully arranged bay, various objectives for partial premarshalling can be pursued. This study explores different criteria for partial premarshalling and investigates several constraint programming-based solution approaches.

Keywords

Status: accepted

Back to the list of papers