Skip to main content
SpringerLink
Log in

A Lagrangian relaxation-based algorithm for the allocation of yard cranes for yard activities with different priorities

  • Published:
Journal of Systems Science and Systems Engineering Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

This paper proposes a mixed integer programming model for the allocation of rail mounted gantry cranes for four basic yard activities with different priorities. The model pays special attention to the typical features of this kind of gantry cranes, such as a restricted traveling range and a limited number of adjustments during loading and discharging operations. In contrast to most of the literature dealing with these four yard activities individually, this paper models them into an integrated problem, whose computational complexity is proved to be NP-hard. We are therefore motivated to develop a Lagrangian relaxation-based heuristic to solve the problem. We compare the proposed heuristic with the branch-and-bound method that uses commercial software packages. Extensive computational results show that the proposed heuristic achieves competitive solution qualities for solving the tested problems.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

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

    Article  MATH  Google Scholar 

  2. Cheung, R.K., Li, C. & Lin, W. (2002). Interblock crane deployment in container terminals. Transportation Science, 36(1): 79–93

    Article  Google Scholar 

  3. Cormen, T.H., Leiserson, C.E., Rivest, R.L. & Stein, C. (2001). Introduction to Algorithms, Second Edition. The MIT Press, Boston

    MATH  Google Scholar 

  4. Dorndorf, U. & Schneider, F. (2010). Scheduling automated triple cross-over stacking cranes in a container yard. OR Spectrum, 32(3): 617–632

    Article  MATH  Google Scholar 

  5. Geoffrion, A.M. (1974). Lagrangean relaxation for integer programming. Mathematical Programming Study, 2: 82–114

    Article  MathSciNet  Google Scholar 

  6. Han, Y., Lee, L., Chew, E. & Tan, K. (2008). A yard storage strategy for minimizing traffic congestion in a marine container transshipment hub. OR Spectrum, 30(4): 697–720

    Article  MathSciNet  MATH  Google Scholar 

  7. Kim, K.H. & Kim, H.B. (2002). The optimal sizing of the storage space and handling facilities for import containers. Transportation Research Part B, 36(9): 821–835

    Article  Google Scholar 

  8. Kim, K.H. & Kim, K.Y. (1999). An optimal routing algorithm for a transfer crane in port container terminals. Transportation Science, 33(1): 17–33

    Article  MATH  Google Scholar 

  9. Kim, K.Y. & Kim, K.H. (1997). A routing algorithm for a single transfer crane to load export containers onto a containership. Computers & Industrial Engineering, 33(3–4): 673–676

    Article  Google Scholar 

  10. Kim, K.Y. & Kim, K.H. (1999a). A routing algorithm for a single straddle carrier to load export containers onto a containership. International Journal of Production Economics, 59(1–3): 425–433

    Google Scholar 

  11. Ku, L.P., Lee, L.H., Chew, E.P. & Tan, K.C. (2010). An optimisation framework for yard planning in a container terminal: case with automated rail-mounted gantry cranes. OR Spectrum, 32(3): 519–541

    Article  MATH  Google Scholar 

  12. Lee, D., Cao, Z. & Meng, Q. (2007). Scheduling of two-transtainer systems for loading outbound containers in port container terminals with simulated annealing algorithm. International Journal of Production Economics, 107(1): 115–124

    Article  Google Scholar 

  13. Lee, L., Chew, E., Tan, K. & Han, Y. (2006). An optimization model for storage yard management in transshipment hubs. OR Spectrum, 28(4): 539–561

    Article  MathSciNet  MATH  Google Scholar 

  14. Linn, R.J. & Zhang, C. (2003). A heuristic for dynamic yard crane deployment in a container terminal. IIE Transactions, 35(2): 161–174

    Article  Google Scholar 

  15. Murty, K.G., Liu, J., Wan, Y. & Linn, R. (2005). A decision support system for operations in a container terminal. Decision Support Systems, 39(3): 309–332

    Article  Google Scholar 

  16. Murty, K.G., Wan, Y., Liu, J., Tseng, M.M., Leung, E., Lai, K. & Chiu, H.W.C. (2005a). Hongkong international terminals gains elastic capacity using a data-intensive decision-support system. Interfaces, 35(1): 61–75

    Article  Google Scholar 

  17. Ng, W.C. (2005). Crane scheduling in container yards with inter-crane interference. European Journal of Operational Research, 164(1): 64–78

    Article  MathSciNet  MATH  Google Scholar 

  18. Stahlbock, R. & VoB, S. (2008). Operations research at container terminals: a literature update. OR Spectrum, 30(1): 1–52

    Article  MATH  Google Scholar 

  19. Steenken, D., VoB, S. & Stahlbock, R. (2004). Container terminal operation and operations research — a classiffication and literature review. OR Spectrum, 26(1): 3–49

    Article  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Article  Google Scholar 

  22. Zhang, C., Zhang, Z., Zheng, L. & Miao, L. (2011). A decision support system for the allocation of yard cranes and blocks in container terminals. Asia-Pacificc Journal of Operational Research, 28(6): 803–829

    Article  Google Scholar 

  23. Zhou, W. & Wu, X. (2009). An efficient optimal solution of a two-crane scheduling problem. Asia-Pacific Journal of Operational Research, 26(1): 31–58

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Logistics Engineering and Simulation Laboratory, Graduate School at Shenzhen, Tsinghua University, Shenzhen, 518055, China

    Canrong Zhang & Lixin Miao

  2. Business Analytics and Optimization, University of Phoenix, Apollo Group, Inc., Phoenix, AZ, 85040, USA

    Tao Wu

  3. Department of Industrial Engineering, Tsinghua University, Beijing, 10084, China

    Canrong Zhang & Li Zheng

Authors
  1. Canrong Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tao Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Li Zheng
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Lixin Miao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Lixin Miao.

Additional information

This research was supported by the National Nature Science Foundation of China under grant numbers 71102011 and 51105394, and Guangdong provincial department of science and technology (Number 2011B090400384).

Canrong Zhang is an assistant professor in the Graduate School at Shenzhen, Tsinghua University, China. He received his Ph.D. degree in Industrial engineering from Tsinghua University in 2010. His research interests include logistics system (especially the container terminal) optimization, manufacturing system optimization, and supply chain management. His work has appeared in European Journal of Operational Research, Computers & Industrial Engineering, International Journal of Production Research and Asia-Pacific Journal of Operational Research.

Tao Wu is an Operations Research Scientist at University of Phoenix, Apollo Group, Inc. in Arizona, USA. He received his undergraduate degree in mechanical engineering at Nanchang University in 2001, his master degrees in industrial engineering and computer sciences at University of Wisconsin-Madison in 2006 and 2009, respectively, and his Ph.D. degree in industrial and systems engineering at University of Wisconsin-Madison in 2010. His research interests are in the arena of building mathematical, analytical, and statistical models, and developing algorithms, methodologies, and theories for solving real industrial problems. His work has been applied in manufacturing systems, production planning, supply chain management, energy management and logistics. The work has appeared in Journal of Global Optimization, Annals of Operations Research, European Journal of Operational Research, Computers & Operations Research, International Journal of Production Research, and IEEE Transactions on Automation Science and Engineering. Dr. Wu is a member of INFORMS.

Li Zheng is a Professor at the Department of Industrial Engineering of Tsinghua University, China. He received his B.S. and Ph.D. degree in Manufacturing engineering from Tsinghua University. His research interests include the application of operation research, especially in transportation, such as railway and harbor. His work has appeared in European Journal of Operational Research, Computers & Operations Research, International Journal of Production Research and International Journal of Production Economics.

Lixin Miao is a professor in Tsinghua University of China. He received his Master degree in Tongji University of China in 1987. He is now the head of the Division of Logistics and Transportation of the Graduate School at Shenzhen, Tsinghua University, China. His research interests include information technologies in logistics, optimization in logistics system, intelligent transportation system, and traffic and logistics simulation. His work has appeared in Transportation Research Part E, Engineering Optimization and Journal of the Transportation Research Board.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhang, C., Wu, T., Zheng, L. et al. A Lagrangian relaxation-based algorithm for the allocation of yard cranes for yard activities with different priorities. J. Syst. Sci. Syst. Eng. 22, 227–252 (2013). https://doi.org/10.1007/s11518-013-5215-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11518-013-5215-8

Keywords

Search

Navigation