Skip to main content
SpringerLink
Log in

A Lagrangian relaxation-based heuristic for the multi-ship quay crane scheduling problem with ship stability constraints

  • Original Paper
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

The quay crane scheduling problem is one of the major problems of quayside operational planning in container terminals. The operational efficiency of quay cranes is a large determinant of the overall container terminal efficiency; thus, in an effort to maximize throughput, more and more emphasis is placed on systematically addressing and improving quay crane operations. However, the resulting formulations are highly complex and thus not solvable using commercial software. In the first part of the present paper, we develop a formulation that overcomes this challenge. This allows for solving the model using CPLEX, even for large size instances, which other notable work from the literature fails to solve. The second part of this paper addresses a crucial point which has rarely been accounted for, which is ship stability. A heuristic is developed to solve the extended problem, as it is no longer solvable in CPLEX. The remaining objective of this work is to extend this problem to the multi-ship case. However, once again the problem is insolvable for large instances using CPLEX, even without accounting for stability constraints. We develop a Lagrangian relaxation based algorithm that decomposes the problem by ship, which is solved efficiently as a single ship case. The Lagrangian multipliers are updated using the cutting plane method and the solution of the Lagrangian master problem provides an upper bound on the optimal value of the Lagrangian lower bound. Upper bounds on the optimal value of the original problem are obtained using a constructive heuristic, and through computational experiments we demonstrate the performance of the Lagrangian relaxation-based procedures.

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

  • Alzaabi, S. A. J., & Diabat, A. (2016). On the berth allocation problem. RAIRO-Operations Research, 50(3), 491–501.

  • Al-Dhaheri, N., & Diabat, A. (2015). The quay crane scheduling problem. Journal of Manufacturing Systems, 36, 87–94.

    Article  Google Scholar 

  • Al-Dhaheri, N., Jebali, A., & Diabat, A. (2016a). A simulation based genetic algorithm approach for the quay crane scheduling under uncertainty. Simulation Modelling Practice and Theory, 66, 122–138.

    Article  Google Scholar 

  • Al-Dhaheri, N., Jebali, A., & Diabat, A. (2016b). The quay crane scheduling problem with nonzero crane repositioning time and vessel stability constraints. Computers and Industrial Engineering, 94, 230–244.

    Article  Google Scholar 

  • Bierwirth, C., & Meisel, F. (2015). A follow-up survey of berth allocation and quay crane scheduling problems in container terminals. European Journal of Operational Research, 244(3), 675–689.

    Article  Google Scholar 

  • Boysen, N., Emde, S., & Fliedner, M. (2012). Determining crane areas for balancing workload among interfering and noninterfering cranes. Naval Research Logistics (NRL), 59(8), 656–662.

    Article  Google Scholar 

  • Cao, J., Shi, Q., & Lee, D.-H. (2010). Integrated quay crane and yard truck schedule problem in container terminals. Tsinghua Science and Technology, 15(4), 467–474.

    Article  Google Scholar 

  • Chen, J. H., Lee, D.-H., & Cao, J. X. (2011). Heuristics for quay crane scheduling at indented berth. Transportation Research Part E: Logistics and Transportation Review, 47(6), 1005–1020.

    Article  Google Scholar 

  • Chen, J. H., Lee, D.-H., & Goh, M. (2014). An effective mathematical formulation for the unidirectional cluster-based quay crane scheduling problem. European Journal of Operational Research, 232(1), 198–208.

    Article  Google Scholar 

  • Choo, S., Klabjan, D., & Simchi-Levi, D. (2010). Multiship crane sequencing with yard congestion constraints. Transportation Science, 44(1), 98–115.

    Article  Google Scholar 

  • Chung, S. H., & Chan, F. T. S. (2013). A workload balancing genetic algorithm for the quay crane scheduling problem. International Journal of Production Research, 51(16), 4820–4834.

    Article  Google Scholar 

  • Chung, S. H., & Choy, K. L. (2012). A modified genetic algorithm for quay crane scheduling operations. Expert Systems with Applications, 39(4), 4213–4221.

    Article  Google Scholar 

  • Diabat, A., & Theodorou, E. (2014). An integrated quay crane assignment and scheduling problem. Computers and Industrial Engineering, 73, 115–123.

    Article  Google Scholar 

  • Ding, Y., GuoLong, L., & ChengJi, L. (2012). Model and heuristic algorithm for quay crane scheduling at container terminal. In 2012 9th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD) (pp. 1054–1061).

  • Expósito-Izquierdo, C., González-Velarde, J. L., Melián-Batista, B., & Marcos Moreno-Vega, J. (2013). Hybrid estimation of distribution algorithm for the quay crane scheduling problem. Applied Soft Computing, 13(10), 4063–4076.

    Article  Google Scholar 

  • Fisher, M. L. (1981). The Lagrangian relaxation method for solving integer programming problems. Management Science, 27(1), 1–18.

    Article  Google Scholar 

  • Fu, Y.-M., & Diabat, A. (2015). A Lagrangian relaxation approach for solving the integrated quay crane assignment and scheduling problem. Applied Mathematical Modelling, 39(3–4), 1194–1201.

    Article  Google Scholar 

  • Fu, Y.-M., Diabat, A., & Tsai, I.-T. (2014). A multi-vessel quay crane assignment and scheduling problem: Formulation and heuristic solution approach. Expert Systems with Applications, 41(15), 6959–6965.

    Article  Google Scholar 

  • Giallombardo, G., Moccia, L., Salani, M., & Vacca, I. (2010). Modeling and solving the tactical berth allocation problem. Transportation Research Part B: Methodological, 44(2), 232–245.

    Article  Google Scholar 

  • Guan, Y., Yang, K.-H., & Zhou, Z. (2013). The crane scheduling problem: Models and solution approaches. Annals of Operations Research, 203(1), 119–139.

    Article  Google Scholar 

  • Guo, P., Cheng, W., & Wang, Y. (2014). A modified generalized extremal optimization algorithm for the quay crane scheduling problem with interference constraints. Engineering Optimization, 46(10), 1411–1429.

    Article  Google Scholar 

  • Hakam, M. H., Solvang, W. D., & Hammervoll, T. (2012). A genetic algorithm approach for quay crane scheduling with non-interference constraints at Narvik container terminal. International Journal of Logistics Research and Applications, 15(4), 269–281.

    Article  Google Scholar 

  • Kaveshgar, N., Huynh, N., & Rahimian, S. K. (2012). An efficient genetic algorithm for solving the quay crane scheduling problem. Expert Systems with Applications, 39(18), 13108–13117.

    Article  Google Scholar 

  • Kim, K. H., & Park, Y.-M. (2004). A crane scheduling method for port container terminals. European Journal of Operational Research, 156(3), 752–768.

    Article  Google Scholar 

  • Ku, D., & Arthanari, T. S. (2014). On double cycling for container port productivity improvement. Annals of Operations Research, 1–16. doi:10.1007/s10479-014-1645-z.

  • Lee, C.-Y., Liu, M., & Chu, C. (2014). Optimal algorithm for the general quay crane double-cycling problem. Transportation Science, 49(4), 957–967.

    Article  Google Scholar 

  • Lee, D.-H., & Wang, H. Q. (2010a). Integrated discrete berth allocation and quay crane scheduling in port container terminals. Engineering Optimization, 42(8), 747–761.

    Article  Google Scholar 

  • Lee, D.-H., & Wang, H. Q. (2010b). An approximation algorithm for quay crane scheduling with handling priority in port container terminals. Engineering Optimization, 42(12), 1151–1161.

    Article  Google Scholar 

  • Legato, P., Mazza, R. M., & Trunfio, R. (2010). Simulation-based optimization for discharge/loading operations at a maritime container terminal. OR Spectrum, 32(3), 543–567.

    Article  Google Scholar 

  • Legato, P., & Trunfio, R. (2014). A local branching-based algorithm for the quay crane scheduling problem under unidirectional schedules. 4OR, 12(2), 123–156.

    Article  Google Scholar 

  • Legato, P., Trunfio, R., & Meisel, F. (2012). Modeling and solving rich quay crane scheduling problems. Computers and Operations Research, 39(9), 2063–2078.

    Article  Google Scholar 

  • Liu, M., Zheng, F., & Li, J. (2015). Scheduling small number of quay cranes with non-interference constraint. Optimization Letters, 9(2), 403–412.

    Article  Google Scholar 

  • Lu, Z., Han, X., & Xi, L. (2011). Simultaneous berth and quay crane allocation problem in container terminal. Advanced Science Letters, 4(6–7), 2113–2118.

    Article  Google Scholar 

  • Lu, Z., Han, X., Xi, L., & Erera, A. L. (2012). A heuristic for the quay crane scheduling problem based on contiguous bay crane operations. Computers and Operations Research, 39(12), 2915–2928.

    Article  Google Scholar 

  • Meisel, F. (2011). The quay crane scheduling problem with time windows. Naval Research Logistics (NRL), 53(1), 45–59.

    Google Scholar 

  • Meisel, F., & Bierwirth, C. (2011). A unified approach for the evaluation of quay crane scheduling models and algorithms. Computers and Operations Research, 38(3), 683–693.

    Article  Google Scholar 

  • Meisel, F., & Bierwirth, C. (2013). A framework for integrated berth allocation and crane operations planning in seaport container terminals. Transportation Science, 47(2), 131–147.

    Article  Google Scholar 

  • Meisel, F., & Wichmann, M. (2010). Container sequencing for quay cranes with internal reshuffles. OR Spectrum, 32(3), 569–591.

    Article  Google Scholar 

  • Monaco, M. F., & Sammarra, M. (2011). Quay crane scheduling with time windows, one-way and spatial constraints. International Journal of Shipping and Transport Logistics, 3(4), 454–474.

    Article  Google Scholar 

  • Nam, H., & Lee, T. (2013). A scheduling problem for a novel container transport system: A case of mobile harbor operation schedule. Flexible Services and Manufacturing Journal, 25(4), 576–608.

    Article  Google Scholar 

  • Nguyen, S., Zhang, M., Johnston, M., & Chen Tan, K. (2013). Hybrid evolutionary computation methods for quay crane scheduling problems. Computers and Operations Research, 40(8), 2083–2093.

    Article  Google Scholar 

  • Rodriguez-Molins, M., Ingolotti, L., Barber, F., Salido, M. A., Sierra, M. R., & Puente, J. (2014). A genetic algorithm for robust berth allocation and quay crane assignment. Progress in Artificial Intelligence, 2(4), 177–192.

    Article  Google Scholar 

  • Schoonenberg, W., Hols, J., & Diabat, A. (2015). A cost based approach for a crane assignment and scheduling problem. In International Conference on Industrial Engineering and Systems Management (IESM), Seville, Spain, October 21–23.

  • Shin, K., & Lee, T. (2013). Container loading and unloading scheduling for a Mobile Harbor system: A global and local search method. Flexible Services and Manufacturing Journal, 25(4), 557–575.

    Article  Google Scholar 

  • Simrin, A., & Diabat, A. (2015). The dynamic berth allocation problem: A linearized formulation. RAIRO Operations Research, 49(3), 473–494.

    Article  Google Scholar 

  • Song, L., Cherrett, T., & Guan, W. (2012). Study on berth planning problem in a container seaport: Using an integrated programming approach. Computers and Industrial Engineering, 62(1), 119–128.

    Article  Google Scholar 

  • Tamburri, M. N., Wasson, K., & Matsuda, M. (2002). Ballast water deoxygenation can prevent aquatic introductions while reducing ship corrosion. Biological Conservation, 103(3), 331–341.

    Article  Google Scholar 

  • Tang, L., Zhao, J., & Liu, J. (2014). Modeling and solution of the joint quay crane and truck scheduling problem. European Journal of Operational Research, 236(3), 978–990.

    Article  Google Scholar 

  • Theodorou, E., & Diabat, A. (2015). A joint quay crane assignment and scheduling problem: Formulation, solution algorithm and computational results. Optimization Letters, 9, 799–817.

    Article  Google Scholar 

  • Unsal, O., & Oguz, C. (2013). Constraint programming approach to quay crane scheduling problem. Transportation Research Part E: Logistics and Transportation Review, 59, 108–122.

    Article  Google Scholar 

  • Vacca, I., Salani, M., & Bierlaire, M. (2013). An exact algorithm for the integrated planning of berth allocation and quay crane assignment. Transportation Science, 47(2), 148–161.

    Article  Google Scholar 

  • Vis, I. F. A., & van Anholt, R. G. (2010). Performance analysis of berth configurations at container terminals. OR Spectrum, 32(3), 453–476.

    Article  Google Scholar 

  • Wang, J., Hu, H., & Song, Y. (2013). Optimization of quay crane scheduling constrained by stability of vessels. Transportation Research Record: Journal of the Transportation Research Board, 2330(1), 47–54.

    Article  Google Scholar 

  • Wang, Y., & Kim, K. H. (2011). A quay crane scheduling algorithm considering the workload of yard cranes in a container yard. Journal of Intelligent Manufacturing, 22(3), 459–470.

    Article  Google Scholar 

  • Wang, S., Zheng, J., Zheng, K., Guo, J., & Liu, X. (2012). Multi resource scheduling problem based on an improved discrete particle swarm optimization. Physics Procedia, 25, 576–582.

    Article  Google Scholar 

  • Zhang, L., Khammuang, K., & Wirth, A. (2008). On-line scheduling with non-crossing constraints. Operations Research Letters, 36(5), 579–583.

    Article  Google Scholar 

Download references

Acknowledgments

This work was supported by Grant Number EX2014-000003 provided by Abu Dhabi Ports, Abu Dhabi, United Arab Emirates. Thereon, we would like to acknowledge their invaluable contribution and extend our warm appreciation to the CEO of Abu Dhabi Ports, Capt. Mohamed Al Shamisi, and the Chairman, H.E. Minister of State Dr. Sultan Al Jaber.

Author information

Authors and Affiliations

  1. Department of Engineering Systems and Management, Masdar Institute of Science and Technology, Abu Dhabi, United Arab Emirates

    Noura Al-Dhaheri & Ali Diabat

Authors
  1. Noura Al-Dhaheri
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ali Diabat
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ali Diabat.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Al-Dhaheri, N., Diabat, A. A Lagrangian relaxation-based heuristic for the multi-ship quay crane scheduling problem with ship stability constraints. Ann Oper Res 248, 1–24 (2017). https://doi.org/10.1007/s10479-016-2239-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-016-2239-8

Keywords

Search

Navigation