zbMATH — the first resource for mathematics

The berth allocation problem with a cut-and-run option. (English) Zbl 1209.90024
Fleischmann, Bernhard (ed.) et al., Operations research proceedings 2008. Selected papers of the annual international conference of the German Operations Research Society (GOR), University of Augsburg, September 3–5, 2008. Berlin: Springer (ISBN 978-3-642-00141-3/pbk; 978-3-642-00142-0/ebook). 283-288 (2009).
Summary: The Berth Allocation Problem consists of assigning berthing times and berthing positions to container vessels calling at a seaport. We extend this problem by a so-called cut-and-run option, which is used in practice to ensure that vessels meet their liner schedules. A mathematical problem formulation, meta-heuristics, and computational tests are provided.
For the entire collection see [Zbl 1175.90010].

90B05 Inventory, storage, reservoirs
90B06 Transportation, logistics and supply chain management
90C59 Approximation methods and heuristics in mathematical programming
Full Text: DOI