Skip to main content

A Quay Crane Scheduling Model in Container Terminals

  • Conference paper
Advances in Swarm Intelligence (ICSI 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6146))

Included in the following conference series:

  • 2257 Accesses

Abstract

This paper discusses the problem of scheduling quay cranes, the most important equipment in port terminals. A simulation model is developed for evaluating time of quay cranes. Then a dynamic scheduling model using objective programming for quay cranes is developed based on genetic algorithm approach. Finally, numerical experiments on a specific container terminal are made for propose approach. Computational results suggest that the proposed method is able to solve the problem efficiently.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Steenken, D., Vo, S., Stahlbock, R.: Container terminal operation and operations research – a classification and literature review. OR Spectrum 26, 3–49 (2004)

    Article  MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  3. Peterkofsky, R.I., Daganzo, C.F.: A branch and bound solution method for the crane scheduling problem. Transportation Research Part B 24(3), 159–172 (1990)

    Article  Google Scholar 

  4. Lim, A., Rodrigues, B., Xiao, F., Zhu, Y.: Crane scheduling with spatial constraints. Naval Research Logistics 51, 386–406 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  5. Kim, K.H., Kang, J.S., Ryu, K.R.: A beam search algorithm for the loadi (2004)

    Google Scholar 

  6. Kim, K.H., Park, Y.M.: A crane scheduling method for port container terminals. European Journal of Operation Research 156, 752–768 (2004)

    Article  MATH  Google Scholar 

  7. Pinedo, M.: Scheduling – Theory Algorithms and Systems, 2nd edn. PrenticeHall, Englewood Cliffs (2002)

    MATH  Google Scholar 

  8. Bierwirth, C., Meisel, F.: A survey of berth allocation and quay crane scheduling problems in container terminals. European Journal of Operational Research 202, 615–627 (2010)

    Article  MATH  Google Scholar 

  9. Goldberg, D.A.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley Publishing Company, Inc., Reading (1989)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tang, Q. (2010). A Quay Crane Scheduling Model in Container Terminals. In: Tan, Y., Shi, Y., Tan, K.C. (eds) Advances in Swarm Intelligence. ICSI 2010. Lecture Notes in Computer Science, vol 6146. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13498-2_37

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13498-2_37

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13497-5

  • Online ISBN: 978-3-642-13498-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics