C. Jiménez Piqueras, D. Pacino, C. Parreño Torres, R. Álvarez Valdés

Solving the container premarshalling problem helps to speed up the loading and unloading of vessels, increasing the efficiency of port terminals. It has been widely studied in the literature, but considering several assumptions that limit its implementation in practice. The classical version neglects crane availability constraints which terminal operators cannot avoid. We study a novel premarshalling variant dealing with these crane limitations. The original problem looks for the minimum number of crane movements to rearrange a set of container stacks so that afterwards the crane can retrieve the containers in the required order without additional relocations. The version we propose measures the crane time, providing a partial premarshalling solution when the period the crane is available is not enough for completing a total rearrangement of the bay. Assessing the quality of partial solutions is a challenging task. We tackle this question and explore several exact solution methods.

Keywords: Logistics; premarshalling problem; container terminal optimization; combinatorial optimization


Integer and Combinatorial Optimization
November 7, 2023  3:30 PM
HC1: Canónigos Room 1

Other papers in the same session

Optimal Area Polygonization Problems

H. Hernández Pérez, J. Riera Ledesma, I. Rodríguez Martín, J. J. Salazar Gonzalez

A multiobjective SHARP holistic model

F. Martos-Barrachina, L. Delgado-Antequera, M. Hernández, R. Caballero

Cookie policy

We use cookies in order to be able to identify and authenticate you on the website. They are necessary for the correct functioning of it, and therefore they can not be disabled. If you continue browsing the website, you are agreeing with their acceptance, as well as our Privacy Policy.

Additionally, we use Google Analytics in order to analyze the website traffic. They also use cookies and you can accept or refuse them with the buttons below.

You can read more details about our Cookie Policy and our Privacy Policy.