Skip to main content

Satisfying Constraints for Locating Export Containers in Port Container Terminals

  • Conference paper
Computational Science and Its Applications - ICCSA 2006 (ICCSA 2006)

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

Included in the following conference series:

Abstract

To allocate spaces to outbound containers, the constraint satisfaction technique was applied. Space allocation is pre-assigning spaces for arriving ships so that loading operations can be performed efficiently. The constraints, which are used to maximize the efficiency of yard trucks and transfer cranes, were collected from a real container terminal and formulated in the form of constraint. Numerical experiments were conducted to evaluate the performance of the developed algorithm.

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 139.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. Taleb-Ibrahimi, M., Castilho, B., Daganzo, C.F.: Storage Space vs Handling Work in Container Terminals. Transportation Research I27B(1), 13–32 (1993)

    Google Scholar 

  2. Kim, K.H., Kim, D.Y.: Group Storage Methods at Container Port Terminals. The Material Handling Engineering Division 75th Anniversary Commemorative Volume ASMEMH- 2, 15–20 (1994)

    Google Scholar 

  3. Kim, K.H., Kim, H.B.: Segregating Space Allocation Models for Container Inventories in Port Container Terminals. International Journal of Production Economics 59, 415–423 (1999)

    Article  Google Scholar 

  4. Kim, K.H., Kim, K.Y.: An Optimal Routing Algorithm for a Transfer Crane in Port Container Terminals. Transportation Science 33(1), 17–33 (1999)

    Article  MATH  Google Scholar 

  5. Kim, K.H., Park, Y.M., Ryu, K.R.: Deriving Decision Rules to Locate Export Containers in Container Yard. European Journal of Operational Research 124, 89–101 (2000)

    Article  MATH  Google Scholar 

  6. Cao, B., Uebe, G.: Solving Transportation Problems with Nonlinear Side Constraints with Tabu Search. Computers Ops. Res. 22(6), 593–603 (1995)

    Article  MATH  Google Scholar 

  7. Kozan, E.: Optimizing Container Transfers at Multimodal Terminals. Mathematical and Computer Modelling 31, 235–243 (2000)

    Article  Google Scholar 

  8. Roll, Y., Rosenblatt, M.J.: Random versus Grouped Storage Policies and Their Effect on Warehouse Capacity. Material Flow 1, 199–205 (1983)

    Google Scholar 

  9. Tsang, E.: Foundations of Constraint Satisfaction. Academic Press Limited, UK (1993)

    Google Scholar 

  10. Zhang, C., Liu, J., Wan, Y.-W., Murty, K.G., Linn, R.J.: Storage Space Allocation in Container Terminals. Transportation Research 37B, 883–903 (2003)

    Google Scholar 

  11. Kim, K.H., Park, K.T.: Dynamic Space Allocation for Temporary Storage. International Journal of Systems Science 34, 11–20 (2003)

    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

Kim, K.H., Lee, JS. (2006). Satisfying Constraints for Locating Export Containers in Port Container Terminals. In: Gavrilova, M., et al. Computational Science and Its Applications - ICCSA 2006. ICCSA 2006. Lecture Notes in Computer Science, vol 3982. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11751595_60

Download citation

  • DOI: https://doi.org/10.1007/11751595_60

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34075-1

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics