Skip to main content

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

  • Conference paper
Operations Research Proceedings 2005

Part of the book series: Operations Research Proceedings ((ORP,volume 2005))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Daganzo C F (1989) The crane scheduling problem, Transportation Research B 23/3: 159–175

    Article  MathSciNet  Google Scholar 

  2. Guan Y, Cheung R K (2004) The berth allocation problem: models and solution methods, OR Spectrum 26: 75–92

    Article  MATH  MathSciNet  Google Scholar 

  3. Imai A, Sun X, Nishimura E, Papadimitriou S (2005) Berth allocation in a container port: using a continuous location space approach, Transportation Research B 39: 199–221

    Article  Google Scholar 

  4. Kim K H, Moon K C (2003) Berth scheduling by simulated annealing, Transportation Research B 37: 541–560

    Article  Google Scholar 

  5. Neumann K, Zimmermann J (2000) Procedures for resource leveling and net present value problems in project scheduling with general temporal and resource constraints, European Journal of Operational Research 127: 425–443

    Article  MATH  Google Scholar 

  6. Park Y M, Kim K H (2003) A scheduling method for berth and quay cranes, OR Spectrum 25: 1–23

    Article  MATH  Google Scholar 

  7. Steenken D, Voß S, Stahlbock R (2004) Container terminal operation and operations research — a classification and literature review, OR Spectrum 26: 3–49

    Article  MATH  Google Scholar 

  8. Vis I F A, de Koster R (2003) Transshipment of containers at a container terminal: an overview, European Journal of Operational Research 147: 1–16

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Meisel, F., Bierwirth, C. (2006). Integration of Berth Allocation and Crane Assignment to Improve the Resource Utilization at a Seaport Container Terminal. In: Haasis, HD., Kopfer, H., Schönberger, J. (eds) Operations Research Proceedings 2005. Operations Research Proceedings, vol 2005. Springer, Berlin, Heidelberg . https://doi.org/10.1007/3-540-32539-5_17

Download citation

Publish with us

Policies and ethics