IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-540-32539-0_17.html
   My bibliography  Save this book chapter

Integration of Berth Allocation and Crane Assignment to Improve the Resource Utilization at a Seaport Container Terminal

In: Operations Research Proceedings 2005

Author

Listed:
  • Frank Meisel

    (Martin-Luther-University Halle-Wittenberg)

  • Christian Bierwirth

    (Martin-Luther-University Halle-Wittenberg)

Abstract

This talk deals with the combination of two decision problems, which occur consecutively while planning the charge and discharge operations of container ships in container terminals. The Berth Allocation Problem (BAP) considers the allocation of ships to berths in the course of time. The Crane Assignment Problem (CAP) addresses the assignment of quay cranes to ships. We provide a heuristic approach for the integrated solution of these problems and present computational results based on real world data.

Suggested Citation

  • Frank Meisel & Christian Bierwirth, 2006. "Integration of Berth Allocation and Crane Assignment to Improve the Resource Utilization at a Seaport Container Terminal," Operations Research Proceedings, in: Hans-Dietrich Haasis & Herbert Kopfer & Jörn Schönberger (ed.), Operations Research Proceedings 2005, pages 105-110, Springer.
    • Handle: RePEc:spr:oprchp:978-3-540-32539-0_17
    DOI: 10.1007/3-540-32539-5_17
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Lalla-Ruiz, Eduardo & Expósito-Izquierdo, Christopher & Melián-Batista, Belén & Moreno-Vega, J. Marcos, 2016. "A Set-Partitioning-based model for the Berth Allocation Problem under Time-Dependent Limitations," European Journal of Operational Research, Elsevier, vol. 250(3), pages 1001-1012.
    2. Guo, Liming & Zheng, Jianfeng & Du, Haoming & Du, Jian & Zhu, Zhihong, 2022. "The berth assignment and allocation problem considering cooperative liner carriers," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    3. Robenek, Tomáš & Umang, Nitish & Bierlaire, Michel & Ropke, Stefan, 2014. "A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports," European Journal of Operational Research, Elsevier, vol. 235(2), pages 399-411.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:oprchp:978-3-540-32539-0_17. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.