IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v273y2019i2p504-515.html
   My bibliography  Save this article

A Benders decomposition-based framework for solving quay crane scheduling problems

Author

Listed:
  • Sun, Defeng
  • Tang, Lixin
  • Baldacci, Roberto

Abstract

In this paper, we study the Quay Crane Scheduling Problem (QCSP) in container terminals. We describe a new mathematical formulation for the QCSP and by addressing the structure of workload assignments we develop an easier way to handle non-crossing constraints. The proposed mathematical formulation is used in an exact solution framework based on logic-based Benders decomposition. The proposed approach decomposes the problem into a workload-assignment master problem and operation-sequence slave subproblems. Logic-based cuts are proposed to ensure the convergence of the approach. Computational results show the effectiveness of the proposed solution approach.

Suggested Citation

  • Sun, Defeng & Tang, Lixin & Baldacci, Roberto, 2019. "A Benders decomposition-based framework for solving quay crane scheduling problems," European Journal of Operational Research, Elsevier, vol. 273(2), pages 504-515.
    • Handle: RePEc:eee:ejores:v:273:y:2019:i:2:p:504-515
    DOI: 10.1016/j.ejor.2018.08.009
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221718306866
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2018.08.009?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Jiyin Liu & Yat‐wah Wan & Lei Wang, 2006. "Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures," Naval Research Logistics (NRL), John Wiley & Sons, vol. 53(1), pages 60-74, February.
    2. Andrew Lim & Brian Rodrigues & Zhou Xu, 2007. "A m‐parallel crane scheduling problem with a non‐crossing constraint," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(2), pages 115-127, March.
    3. Bierwirth, Christian & Meisel, Frank, 2015. "A follow-up survey of berth allocation and quay crane scheduling problems in container terminals," European Journal of Operational Research, Elsevier, vol. 244(3), pages 675-689.
    4. Bierwirth, Christian & Meisel, Frank, 2010. "A survey of berth allocation and quay crane scheduling problems in container terminals," European Journal of Operational Research, Elsevier, vol. 202(3), pages 615-627, May.
    5. Daganzo, Carlos F., 1989. "The crane scheduling problem," Transportation Research Part B: Methodological, Elsevier, vol. 23(3), pages 159-175, June.
    6. Gianni Codato & Matteo Fischetti, 2006. "Combinatorial Benders' Cuts for Mixed-Integer Linear Programming," Operations Research, INFORMS, vol. 54(4), pages 756-766, August.
    7. Zhang, Chuqian & Liu, Jiyin & Wan, Yat-wah & Murty, Katta G. & Linn, Richard J., 2003. "Storage space allocation in container terminals," Transportation Research Part B: Methodological, Elsevier, vol. 37(10), pages 883-903, December.
    8. Kim, Kap Hwan & Park, Young-Man, 2004. "A crane scheduling method for port container terminals," European Journal of Operational Research, Elsevier, vol. 156(3), pages 752-768, August.
    9. Andrew Lim & Brian Rodrigues & Fei Xiao & Yi Zhu, 2004. "Crane scheduling with spatial constraints," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(3), pages 386-406, April.
    10. Yongpei Guan & Kang-Hung Yang & Zhili Zhou, 2013. "The crane scheduling problem: models and solution approaches," Annals of Operations Research, Springer, vol. 203(1), pages 119-139, March.
    11. J. N. Hooker, 2007. "Planning and Scheduling by Logic-Based Benders Decomposition," Operations Research, INFORMS, vol. 55(3), pages 588-602, June.
    12. Imai, Akio & Nishimura, Etsuko & Papadimitriou, Stratos, 2001. "The dynamic berth allocation problem for a container port," Transportation Research Part B: Methodological, Elsevier, vol. 35(4), pages 401-417, May.
    13. Luigi Moccia & Jean‐François Cordeau & Manlio Gaudioso & Gilbert Laporte, 2006. "A branch‐and‐cut algorithm for the quay crane scheduling problem in a container terminal," Naval Research Logistics (NRL), John Wiley & Sons, vol. 53(1), pages 45-59, February.
    14. Tang, Lixin & Zhao, Jiao & Liu, Jiyin, 2014. "Modeling and solution of the joint quay crane and truck scheduling problem," European Journal of Operational Research, Elsevier, vol. 236(3), pages 978-990.
    15. Lixin Tang & Wei Jiang & Jiyin Liu & Yun Dong, 2015. "Research into container reshuffling and stacking problems in container terminal yards," IISE Transactions, Taylor & Francis Journals, vol. 47(7), pages 751-766, July.
    16. Giallombardo, Giovanni & Moccia, Luigi & Salani, Matteo & Vacca, Ilaria, 2010. "Modeling and solving the Tactical Berth Allocation Problem," Transportation Research Part B: Methodological, Elsevier, vol. 44(2), pages 232-245, February.
    17. Y Zhu & A Lim, 2006. "Crane scheduling with non-crossing constraint," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(12), pages 1464-1471, December.
    18. Lee, Der-Horng & Wang, Hui Qiu & Miao, Lixin, 2008. "Quay crane scheduling with non-interference constraints in port container terminals," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 44(1), pages 124-135, January.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Chen, Sumin & Zeng, Qingcheng & Li, Yantong, 2023. "Integrated operations planning in highly electrified container terminals considering time-of-use tariffs," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 171(C).
    2. Roshanaei, Vahid & Naderi, Bahman, 2021. "Solving integrated operating room planning and scheduling: Logic-based Benders decomposition versus Branch-Price-and-Cut," European Journal of Operational Research, Elsevier, vol. 293(1), pages 65-78.
    3. Karim Pérez Martínez & Yossiri Adulyasak & Raf Jans, 2022. "Logic-Based Benders Decomposition for Integrated Process Configuration and Production Planning Problems," INFORMS Journal on Computing, INFORMS, vol. 34(4), pages 2177-2191, July.
    4. Sun, Defeng & Meng, Ying & Tang, Lixin & Liu, Jinyin & Huang, Baobin & Yang, Jiefu, 2020. "Storage space allocation problem at inland bulk material stockyard," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 134(C).
    5. Zhang, Zhe & Song, Xiaoling & Huang, Huijung & Zhou, Xiaoyang & Yin, Yong, 2022. "Logic-based Benders decomposition method for the seru scheduling problem with sequence-dependent setup time and DeJong’s learning effect," European Journal of Operational Research, Elsevier, vol. 297(3), pages 866-877.
    6. Cao, Zhen & Wang, Wenyuan & Jiang, Ying & Xu, Xinglu & Xu, Yunzhuo & Guo, Zijian, 2022. "Joint berth allocation and ship loader scheduling under the rotary loading mode in coal export terminals," Transportation Research Part B: Methodological, Elsevier, vol. 162(C), pages 229-260.
    7. Damla Kizilay & Deniz Türsel Eliiyi, 2021. "A comprehensive review of quay crane scheduling, yard operations and integrations thereof in container terminals," Flexible Services and Manufacturing Journal, Springer, vol. 33(1), pages 1-42, March.
    8. Abou Kasm, Omar & Diabat, Ali & Chow, Joseph Y.J., 2023. "Simultaneous operation of next-generation and traditional quay cranes at container terminals," European Journal of Operational Research, Elsevier, vol. 308(3), pages 1110-1125.
    9. Raeesi, Ramin & Sahebjamnia, Navid & Mansouri, S. Afshin, 2023. "The synergistic effect of operational research and big data analytics in greening container terminal operations: A review and future directions," European Journal of Operational Research, Elsevier, vol. 310(3), pages 943-973.
    10. Sun, Defeng & Tang, Lixin & Baldacci, Roberto & Lim, Andrew, 2021. "An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability," European Journal of Operational Research, Elsevier, vol. 291(1), pages 271-283.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Sun, Defeng & Tang, Lixin & Baldacci, Roberto & Lim, Andrew, 2021. "An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability," European Journal of Operational Research, Elsevier, vol. 291(1), pages 271-283.
    2. T. R. Lalita & G. S. R. Murthy, 2022. "Compact ILP formulations for a class of solutions to berth allocation and quay crane scheduling problems," OPSEARCH, Springer;Operational Research Society of India, vol. 59(1), pages 413-439, March.
    3. Qin, Tianbao & Du, Yuquan & Chen, Jiang Hang & Sha, Mei, 2020. "Combining mixed integer programming and constraint programming to solve the integrated scheduling problem of container handling operations of a single vessel," European Journal of Operational Research, Elsevier, vol. 285(3), pages 884-901.
    4. Shoufeng Ma & Hongming Li & Ning Zhu & Chenyi Fu, 2021. "Stochastic programming approach for unidirectional quay crane scheduling problem with uncertainty," Journal of Scheduling, Springer, vol. 24(2), pages 137-174, April.
    5. Abdellah Salhi & Ghazwan Alsoufi & Xinan Yang, 2019. "An evolutionary approach to a combined mixed integer programming model of seaside operations as arise in container ports," Annals of Operations Research, Springer, vol. 272(1), pages 69-98, January.
    6. Nabil Nehme & Bacel Maddah & Isam A. Kaysi, 2021. "An integrated multi-ship crane allocation in Beirut Port container terminal," Operational Research, Springer, vol. 21(3), pages 1743-1761, September.
    7. Boysen, Nils & Briskorn, Dirk & Meisel, Frank, 2017. "A generalized classification scheme for crane scheduling with interference," European Journal of Operational Research, Elsevier, vol. 258(1), pages 343-357.
    8. Shucheng Yu & Shuaian Wang & Lu Zhen, 2017. "Quay crane scheduling problem with considering tidal impact and fuel consumption," Flexible Services and Manufacturing Journal, Springer, vol. 29(3), pages 345-368, December.
    9. Bierwirth, Christian & Meisel, Frank, 2015. "A follow-up survey of berth allocation and quay crane scheduling problems in container terminals," European Journal of Operational Research, Elsevier, vol. 244(3), pages 675-689.
    10. Lu Zhen & Shucheng Yu & Shuaian Wang & Zhuo Sun, 2019. "Scheduling quay cranes and yard trucks for unloading operations in container ports," Annals of Operations Research, Springer, vol. 273(1), pages 455-478, February.
    11. Damla Kizilay & Deniz Türsel Eliiyi, 2021. "A comprehensive review of quay crane scheduling, yard operations and integrations thereof in container terminals," Flexible Services and Manufacturing Journal, Springer, vol. 33(1), pages 1-42, March.
    12. Gharehgozli, Amir & Yu, Yugang & de Koster, René & Du, Shaofu, 2019. "Sequencing storage and retrieval requests in a container block with multiple open locations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 125(C), pages 261-284.
    13. Giorgi Tadumadze & Simon Emde & Heiko Diefenbach, 2020. "Exact and heuristic algorithms for scheduling jobs with time windows on unrelated parallel machines," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(2), pages 461-497, June.
    14. Dirk Briskorn & Florian Jaehn & Andreas Wiehl, 2019. "A generator for test instances of scheduling problems concerning cranes in transshipment terminals," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(1), pages 45-69, March.
    15. Wu, Lingxiao & Ma, Weimin, 2017. "Quay crane scheduling with draft and trim constraints," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 97(C), pages 38-68.
    16. Frank Meisel & Christian Bierwirth, 2013. "A Framework for Integrated Berth Allocation and Crane Operations Planning in Seaport Container Terminals," Transportation Science, INFORMS, vol. 47(2), pages 131-147, May.
    17. Kong, Lingrui & Ji, Mingjun & Gao, Zhendi, 2022. "An exact algorithm for scheduling tandem quay crane operations in container terminals," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 168(C).
    18. Lu Zhen & Shuaian Wang & Kai Wang, 2016. "Terminal allocation problem in a transshipment hub considering bunker consumption," Naval Research Logistics (NRL), John Wiley & Sons, vol. 63(7), pages 529-548, October.
    19. Yongpei Guan & Kang-Hung Yang & Zhili Zhou, 2013. "The crane scheduling problem: models and solution approaches," Annals of Operations Research, Springer, vol. 203(1), pages 119-139, March.
    20. Frank Meisel, 2011. "The quay crane scheduling problem with time windows," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(7), pages 619-636, October.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:273:y:2019:i:2:p:504-515. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.