Advertisement

The integrated berth allocation, quay crane assignment and scheduling problem: mathematical formulations and a case study

  • Omar Abou Kasm
  • Ali DiabatEmail author
  • T. C. E. Cheng
S.I.: RealCaseOR
  • 32 Downloads

Abstract

This paper considers the integration of three essential seaport terminal operations: the berth allocation problem, the quay crane assignment problem (QCAP), and the quay crane scheduling problem (QCSP). The paper presents a new mathematical formulation that captures all associated operations and constraints. Different quay crane operational policies are considered, namely permitting versus not permitting bay task preemption in QCSP and static versus dynamic crane allocations in QCAP. Thus, variants of the mathematical formulation are introduced to capture the different combinations of these scenarios. Due to the preemption consideration, the models include disaggregated quay crane (QC) tasks. Specifically, QC tasks are identified by single container movements as opposed to bay or stack task allocations that are commonly used in the literature. A case study based on Abu Dhabi’s container terminal is presented where the use of the proposed mathematical models are compared against the current existing operational approach. Results show that the service times can be significantly decreased by the use of the proposed models. Moreover, the policy choice effect on the total schedule is compared through simulated examples and Abu Dhabi’s container terminal case study. The results show that the policy improvements can depend on the problem’s attributes and thus a better policy cannot be generalized.

Keywords

Berth allocation problem Quay crane scheduling Quay crane assignment Maritime logistics Seaport operations Optimization modeling 

Notes

Acknowledgements

The first two authors were supported by Abu Dhabi Ports and Maqta Gateway in Abu Dhabi, United Arab Emirates. The authors would like to acknowledge their invaluable contributions and extend their warm appreciation to the CEO of Abu Dhabi Ports, Capt. Mohamed Al Shamisi, and the CEO of Maqta Gateway, Dr. Noura Al Dhaheri. Professor Cheng was supported in part by the NSF of China under Grant Number NSF#71390334.

References

  1. Abou Kasm, O. & Diabat, A. (2019). The quay crane scheduling problem with non-crossing and safety clearance constraints: An exact solution approach. Computers & Operations Research (in press).Google Scholar
  2. Abu Dhabi Ports. (2018). Abu Dhabi terminal. Retrieved October 4, 2018, from https://www.adports.ae/gallery_posts/abu-dhabi-terminal/.
  3. Agra, A., & Oliveira, M. (2018). MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem. European Journal of Operational Research, 264(1), 138–148.CrossRefGoogle Scholar
  4. Aras, N., Trkoullar, Y., Takn, Z. C., & Altnel, K. (2014). Simultaneous optimization of berth allocation, quay crane assignment and quay crane scheduling problems in container terminals. In Operations Research Proceedings 2012 (pp. 101–107). Springer, Cham.Google Scholar
  5. Al-Dhaheri, N., & Diabat, A. (2017). A Lagrangian relaxation-based heuristic for the multi-ship quay crane scheduling problem with ship stability constraints. Annals of Operations Research, 248(1–2), 1–24.CrossRefGoogle Scholar
  6. 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.CrossRefGoogle Scholar
  7. 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.CrossRefGoogle Scholar
  8. Chang, D., Jiang, Z., Yan, W., & He, J. (2010). Integrating berth allocation and quay crane assignments. Transportation Research Part E: Logistics and Transportation Review, 46(6), 975–990.CrossRefGoogle Scholar
  9. Choo, S., Klabjan, D., & Simchi-Levi, D. (2010). Multiship crane sequencing with yard congestion constraints. Transportation Science, 44(1), 98–115.CrossRefGoogle Scholar
  10. He, J., Mi, W., Chang, D., & Yan, W. (2009). An investigation into berth allocation and quay crane assignment based on hybrid parallel genetic algorithm. In International Conference on Artificial intelligence and computational intelligence, 2009. AICI’09 (Vol. 2, pp. 48–53). IEEE.Google Scholar
  11. Imai, A., Chen, H. C., Nishimura, E., & Papadimitriou, S. (2008). The simultaneous berth and quay crane allocation problem. Transportation Research Part E: Logistics and Transportation Review, 44(5), 900–920.CrossRefGoogle Scholar
  12. Knowler, G. (2016, February 22). Terminal costs rising and profits harder to find, Drewry says. Retrieved October 4, 2018, from https://www.joc.com/port-news/terminal-costs-rising-and-profits-harder-find-drewry-says_20160222.html.
  13. Lee, D. H., & Wang, Q. H. (2010). Integrated discrete berth allocation and quay crane scheduling in port container terminals. Engineering Optimization, 42(8), 747–761.CrossRefGoogle Scholar
  14. Liang, C., Huang, Y., & Yang, Y. (2009). A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planning. Computers & Industrial Engineering, 56(3), 1021–1028.CrossRefGoogle Scholar
  15. Lu, Z. Q., & Xi, L. F. (2010). A proactive approach for simultaneous berth and quay crane scheduling problem with stochastic arrival and handling time. European Journal of Operational Research, 207(3), 1327–1340.CrossRefGoogle Scholar
  16. 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.CrossRefGoogle Scholar
  17. Meisel, F., & Bierwirth, C. (2011). A unified approach for the evaluation of quay crane scheduling models and algorithms. Computers & Operations Research, 38(3), 683–693.CrossRefGoogle Scholar
  18. 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.CrossRefGoogle Scholar
  19. Msakni, M. K., Al-Salem, M., Diabat, A., Rabadi, G., & Kotachi, M. (2016). An integrated quay crane assignment and scheduling problem using branch-and-price. In 2016 International conference on computational science and computational intelligence (CSCI) (pp. 1286–1291). IEEE.Google Scholar
  20. Msakni, M. K., Diabat, A., Rabadi, G., Al-Salem, M., & Kotachi, M. (2018). Exact methods for the quay crane scheduling problem when tasks are modeled at the single container level. Computers & Operations Research, 99, 218–233.CrossRefGoogle Scholar
  21. Park, Y. M., & Kim, K. H. (2005). A scheduling method for berth and quay cranes. In Container terminals and automated transport systems (pp. 159–181). Berlin: Springer.Google Scholar
  22. Raa, B., Dullaert, W., & Van Schaeren, R. (2011). An enriched model for the integrated berth allocation and quay crane assignment problem. Expert Systems with Applications, 38(11), 14136–14147.Google Scholar
  23. Rodriguez-Molins, M., Salido, M. A., & Barber, F. (2014). A GRASP-based metaheuristic for the berth allocation problem and the quay crane assignment problem by managing vessel cargo holds. Applied Intelligence, 40(2), 273–290.CrossRefGoogle Scholar
  24. Theodorou, E., & Diabat, A. (2015). A joint quay crane assignment and scheduling problem: Formulation, solution algorithm and computational results. Optimization Letters, 9(4), 799–817.CrossRefGoogle Scholar
  25. Trkoullar, Y. B., Takn, Z. C., Aras, N., & Altnel, K. (2014). Optimal berth allocation and time-invariant quay crane assignment in container terminals. European Journal of Operational Research, 235(1), 88–101.CrossRefGoogle Scholar
  26. United Nations Conference on Trade and Development. (2018). Review of maritime transport. Retrieved October 22, 2018, from https://unctad.org/en/PublicationsLibrary/rmt2018_en.pdf.
  27. Unsal, O., & Oguz, C. (2013). Constraint programming approach to quay crane scheduling problem. Transportation Research Part E: Logistics and Transportation Review, 59, 108–122.CrossRefGoogle Scholar
  28. 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.CrossRefGoogle Scholar
  29. Yang, C., Wang, X., & Li, Z. (2012). An optimization approach for coupling problem of berth allocation and quay crane assignment in container terminal. Computers & Industrial Engineering, 63(1), 243–253.CrossRefGoogle Scholar
  30. Zeng, Q., Hu, X., Wang, W., & Fang, Y. (2011). Disruption management model and its algorithms for berth allocation problem in container terminals. International Journal of Innovative Computing, Information and Control, 7(5), 2130–2142.Google Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2019

Authors and Affiliations

  1. 1.Department of Civil and Urban Engineering, Tandon School of EngineeringNew York UniversityBrooklynUSA
  2. 2.Division of EngineeringNew York University Abu DhabiSaadiyat Island, Abu DhabiUnited Arab Emirates
  3. 3.Department of Logistics and Maritime StudiesThe Hong Kong Polytechnic UniversityKowloonHong Kong

Personalised recommendations