The berth allocation problem with mobile quay walls: problem definition, solution procedures, and extensions

The berth allocation problem with mobile quay walls: problem definition, solution procedures, and extensions

0.00 Avg rating0 Votes
Article ID: iaor2014733
Volume: 17
Issue: 3
Start Page Number: 289
End Page Number: 303
Publication Date: Jun 2014
Journal: Journal of Scheduling
Authors: , ,
Keywords: vehicle routing & scheduling, allocation: resources
Abstract:

The berth allocation problem (BAP), which defines a processing interval and a berth at the quay wall for each ship to be (un‐)loaded, is an essential decision problem for efficiently operating a container port. In this paper, we integrate mobile quay walls into the BAP. Mobile quay walls are huge propelled floating platforms, which encase ships moored at the immobile quay and provide additional quay cranes for accelerating container processing. Furthermore, additional ships can be processed at the seaside of the platform, so that scarce berthing space at a terminal is enlarged. We formalize the BAP with mobile quay walls and provide suitable solution procedures.

Reviews

Required fields are marked *. Your email address will not be published.