Nothing Special   »   [go: up one dir, main page]

Skip to main content

Solving the Crane Scheduling Problem Using Intelligent Search Schemes

(Extended Abstract)

  • Conference paper
Principles and Practice of Constraint Programming – CP 2004 (CP 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3258))

Abstract

Cranes are central to port operations where cargo throughput and port efficiency is often determined by how well loading and unloading is performed. In ports, the effectiveness of any logistics management system which includes operating cranes is often impacted by pressures of limited port size, high cargo transshipment volumes and limited physical facilities and equipment [6]. It is therefore not surprising that emphasis has been placed on efficient crane scheduling in many ports, including the Port of Singapore [1], the Port of Hong Kong [8] and Australian ports [4].

Cranes are at the interface between land and sea, and because of operating space boundaries and crane structures cranes can only move in a limited areas, usually in one dimension along tracks. A typical operating scheme for quay cranes is illustrated as follows. Containers on vessels to be unloaded are usually partitioned into non-preemptive job parcels in some order on ship decks or holds and are moved to vehicles which transport them to stack yards for storage. In the reverse operation, cargo is loaded onto the ships from trucks out of yards. In this scenario, cranes and vehicles move through fixed channels or routes and bottlenecks occur when movement along these routes becomes congested [5].

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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.

Similar content being viewed by others

References

  1. Bish, E.K., Leong, T.-Y., Li, C.-L., Ng, J.W.C., Simchi-Levi, D.: Analysis of a new vehicle scheduling and location problem. Naval Research Logistics 48(5), 1002–2024 (2001)

    Article  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  3. Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell System Technical Journal 45, 1563–1581 (1966)

    Google Scholar 

  4. Kozan, E.: Increasing the operational efficiency of container terminals in australia. Journal of the Operational Research Society 48, 151–161 (1997)

    MATH  Google Scholar 

  5. Lim, A., Xiao, F., Rodrigues, B., Zhu, Y.: Crane scheduling using tabusearch. In: 14th IEEE International Conference on Tools with Artificial Intelligence, Washington DC, USA (2002)

    Google Scholar 

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

    Google Scholar 

  7. Rayward-Smith, V.J., Osman, I.H., Reeves, C.R., Smith, G.D. (eds.): Modern Heuristic Search Methods. John Wiley & Sons Ltd., Chichester (1996)

    MATH  Google Scholar 

  8. Zhang, C., wah Wan, Y., Liu, J., Linn, R.J.: Dynamic crane deployment in container storage yards. Transportation Resarch Part B 36, 537–555 (2002)

    Article  Google Scholar 

  9. Zhu, Y., Lim, A.: Crane scheduling with spatial constraints: Mathematical model and solving approaches. In: Proceedings of the Eighth International Symposium on Artificial Intelligence and Mathematics (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lim, A., Rodrigues, B., Xu, Z. (2004). Solving the Crane Scheduling Problem Using Intelligent Search Schemes. In: Wallace, M. (eds) Principles and Practice of Constraint Programming – CP 2004. CP 2004. Lecture Notes in Computer Science, vol 3258. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30201-8_59

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30201-8_59

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23241-4

  • Online ISBN: 978-3-540-30201-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics