Publication

Models and Heuristics for the Tactical Berth Allocation Problem with Quay-Crane Assignment and Transshipment Quadratic Costs

Matteo Salani, Ilaria Vacca
2009
Poster talk
Abstract

In this work, we focus on the integration of two problems arising in the management of transshipment container terminals: the problem of assigning and scheduling incoming ships to berthing positions (berth allocation problem), and the problem of assigning quay cranes to incoming ships (quay crane assignment problem). In particular, motivated by the practice in the negotiation process between the terminal management and the shipping liner, the model is based on the concept of quay-crane assignment profile, i.e., the sequence of the number of cranes assigned to the ship along each operating work shift. Two mixed integer formulations are considered with a quadratic and a linearized objective function, respectively. Both models have been validated on instances based on real data. Computation confirms that the problem is hardly solvable via exact methods, hence we introduce heuristic methods for finding good feasible solutions in a reasonable amount of time and present computational results obtained on the same set of instances.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.