The Berth Allocation Problem with a Cut-and-Run Option

Frank Meisel () and Christian Bierwirth ()
Additional contact information
Frank Meisel: Martin-Luther-University
Christian Bierwirth: Martin-Luther-University

Chapter 46 in Operations Research Proceedings 2008, 2009, pp 283-288 from Springer

Abstract: 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.

Keywords: Tabu Search; Priority List; Container Terminal; Quay Crane; Container Vessel (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-00142-0_46

Ordering information: This item can be ordered from
http://www.springer.com/9783642001420

DOI: 10.1007/978-3-642-00142-0_46

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().