IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v186y2024ics136655452400156x.html
   My bibliography  Save this article

An exact algorithm for multiple-equipment integrated scheduling in an automated container terminal using a double-cycling strategy

Author

Listed:
  • Li, Yiming
  • Sun, Zhuo
  • Hong, Soondo

Abstract

The integrated scheduling of quay cranes, automated guided vehicles, and yard cranes is key to achieving efficient performance for an automated container terminal. This paper investigates a multiple-equipment integrated scheduling problem. Firstly, the double-cycling strategy for container handling is proposed to coordinate the scheduling of quay cranes, automated guided vehicles, and yard cranes. Furthermore, a mixed-integer linear programming model is proposed to minimize the makespan of multiple-equipment. And simultaneously, an enhanced Benders decomposition algorithm is designed to solve the problem and several accelerating measures are developed to accelerate the convergence speed. The computational results indicate that (i) the schemes obtained from the model are superior to the current terminal schemes in terms of makespan, waiting time and setup time; (ii) the proposed enhanced Benders decomposition algorithm outperforms the GUROBI and existing method; and (iii) the double-cycling strategy is more efficient than the first come first serve strategy and single-cycling strategy, with 10.65% and 10.34% reductions, respectively, in makespan.

Suggested Citation

  • Li, Yiming & Sun, Zhuo & Hong, Soondo, 2024. "An exact algorithm for multiple-equipment integrated scheduling in an automated container terminal using a double-cycling strategy," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 186(C).
    • Handle: RePEc:eee:transe:v:186:y:2024:i:c:s136655452400156x
    DOI: 10.1016/j.tre.2024.103565
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S136655452400156X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.tre.2024.103565?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. 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. Anne V. Goodchild & Carlos F. Daganzo, 2006. "Double-Cycling Strategies for Container Ships and Their Effect on Ship Loading and Unloading Operations," Transportation Science, INFORMS, vol. 40(4), pages 473-483, November.
    3. Yang, Ying & Liu, Yang & Li, Guorong & Zhang, Zekun & Liu, Yanbin, 2024. "Harnessing the power of Machine learning for AIS Data-Driven maritime Research: A comprehensive review," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 183(C).
    4. Yang, Lingxiao & Zheng, Jianfeng & Wang, Jian & Hu, Xiaowei, 2023. "The maximal detour liner shipping hub location problem: Improving the applicability of the p-hub center problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 179(C).
    5. Feifeng Zheng & Yaxin Pang & Ming Liu & Yinfeng Xu, 2020. "Dynamic programming algorithms for the general quay crane double-cycling problem with internal-reshuffles," Journal of Combinatorial Optimization, Springer, vol. 39(3), pages 708-724, April.
    6. Zhen, Lu, 2016. "Modeling of yard congestion and optimization of yard template in container ports," Transportation Research Part B: Methodological, Elsevier, vol. 90(C), pages 83-104.
    7. Quentin Botton & Bernard Fortz & Luis Gouveia & Michael Poss, 2013. "Benders Decomposition for the Hop-Constrained Survivable Network Design Problem," INFORMS Journal on Computing, INFORMS, vol. 25(1), pages 13-26, February.
    8. Kai Wang & Lu Zhen & Shuaian Wang, 2018. "Column Generation for the Integrated Berth Allocation, Quay Crane Assignment, and Yard Assignment Problem," Transportation Science, INFORMS, vol. 52(4), pages 812-834, August.
    9. Qinglei Zhang & Weixin Hu & Jianguo Duan & Jiyun Qin, 2021. "Cooperative Scheduling of AGV and ASC in Automation Container Terminal Relay Operation Mode," Mathematical Problems in Engineering, Hindawi, vol. 2021, pages 1-18, January.
    10. Feifeng Zheng & Xiaoyi Man & Feng Chu & Ming Liu & Chengbin Chu, 2019. "A two-stage stochastic programming for single yard crane scheduling with uncertain release times of retrieval tasks," International Journal of Production Research, Taylor & Francis Journals, vol. 57(13), pages 4132-4147, July.
    11. Liu, Ming & Chu, Feng & Zhang, Zizhen & Chu, Chengbin, 2015. "A polynomial-time heuristic for the quay crane double-cycling problem with internal-reshuffling operations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 81(C), pages 52-74.
    12. T. L. Magnanti & R. T. Wong, 1981. "Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria," Operations Research, INFORMS, vol. 29(3), pages 464-484, June.
    13. Cao, Jin Xin & Lee, Der-Horng & Chen, Jiang Hang & Shi, Qixin, 2010. "The integrated yard truck and yard crane scheduling problem: Benders' decomposition-based methods," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 46(3), pages 344-353, May.
    14. Zhen, Lu & Zhuge, Dan & Wang, Shuaian & Wang, Kai, 2022. "Integrated berth and yard space allocation under uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 162(C), pages 1-27.
    15. Zhen, Lu, 2014. "Container yard template planning under uncertain maritime market," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 69(C), pages 199-217.
    16. 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.
    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. Roy, Debjit & de Koster, René, 2018. "Stochastic modeling of unloading and loading operations at a container terminal using automated lifting vehicles," European Journal of Operational Research, Elsevier, vol. 266(3), pages 895-910.
    19. 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.
    20. Yan, Ran & Wang, Shuaian & Psaraftis, Harilaos N., 2021. "Data analytics for fuel consumption management in maritime transportation: Status and perspectives," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 155(C).
    Full references (including those not matched with items on IDEAS)

    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. 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.
    2. Wang, Mengyao & Zhou, Chenhao & Wang, Aihu, 2022. "A cluster-based yard template design integrated with yard crane deployment using a placement heuristic," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 160(C).
    3. Roy, Debjit & van Ommeren, Jan-Kees & de Koster, René & Gharehgozli, Amir, 2022. "Modeling landside container terminal queues: Exact analysis and approximations," Transportation Research Part B: Methodological, Elsevier, vol. 162(C), pages 73-102.
    4. 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.
    5. Chargui, Kaoutar & Zouadi, Tarik & Sreedharan, V. Raja & El Fallahi, Abdellah & Reghioui, Mohamed, 2023. "A novel robust exact decomposition algorithm for berth and quay crane allocation and scheduling problem considering uncertainty and energy efficiency," Omega, Elsevier, vol. 118(C).
    6. Yang, Lingyi & Ng, Tsan Sheng & Lee, Loo Hay, 2022. "A robust approximation for yard template optimization under uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 160(C), pages 21-53.
    7. Zhen, Lu & Zhuge, Dan & Wang, Shuaian & Wang, Kai, 2022. "Integrated berth and yard space allocation under uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 162(C), pages 1-27.
    8. Matthew E. H. Petering & Yong Wu & Wenkai Li & Mark Goh & Robert Souza & Katta G. Murty, 2017. "Real-time container storage location assignment at a seaport container transshipment terminal: dispersion levels, yard templates, and sensitivity analyses," Flexible Services and Manufacturing Journal, Springer, vol. 29(3), pages 369-402, December.
    9. Maher, Stephen J., 2021. "Implementing the branch-and-cut approach for a general purpose Benders’ decomposition framework," European Journal of Operational Research, Elsevier, vol. 290(2), pages 479-498.
    10. Dalila B. M. M. Fontes & S. Mahdi Homayouni, 2023. "A bi-objective multi-population biased random key genetic algorithm for joint scheduling quay cranes and speed adjustable vehicles in container terminals," Flexible Services and Manufacturing Journal, Springer, vol. 35(1), pages 241-268, March.
    11. Vatsa, Amit Kumar & Jayaswal, Sachin, 2015. "A New Formulation and Benders' Decomposition for Multi-period facility Location Problem with Server Uncertainty," IIMA Working Papers WP2015-02-07, Indian Institute of Management Ahmedabad, Research and Publication Department.
    12. Jyotirmoy Dalal & Halit Üster, 2018. "Combining Worst Case and Average Case Considerations in an Integrated Emergency Response Network Design Problem," Transportation Science, INFORMS, vol. 52(1), pages 171-188, January.
    13. Ljubić, Ivana & Mutzel, Petra & Zey, Bernd, 2017. "Stochastic survivable network design problems: Theory and practice," European Journal of Operational Research, Elsevier, vol. 256(2), pages 333-348.
    14. Rahmaniani, Ragheb & Crainic, Teodor Gabriel & Gendreau, Michel & Rei, Walter, 2017. "The Benders decomposition algorithm: A literature review," European Journal of Operational Research, Elsevier, vol. 259(3), pages 801-817.
    15. 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.
    16. Amir Gharehgozli & Nima Zaerpour & Rene Koster, 2020. "Container terminal layout design: transition and future," Maritime Economics & Logistics, Palgrave Macmillan;International Association of Maritime Economists (IAME), vol. 22(4), pages 610-639, December.
    17. Guo, Liming & Zheng, Jianfeng & Du, Jian & Gao, Ziyou & Fagerholt, Kjetil, 2024. "Integrated planning of berth allocation, quay crane assignment and yard assignment in multiple cooperative terminals," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 183(C).
    18. Zhou, Chenhao & Wang, Wencheng & Li, Haobin, 2020. "Container reshuffling considered space allocation problem in container terminals," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 136(C).
    19. Zhang, Xiaoju & Zeng, Qingcheng & Sheu, Jiuh-Biing, 2019. "Modeling the productivity and stability of a terminal operation system with quay crane double cycling," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 122(C), pages 181-197.
    20. Çalık, Hatice & Fortz, Bernard, 2019. "A Benders decomposition method for locating stations in a one-way electric car sharing system under demand uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 125(C), pages 121-150.

    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:transe:v:186:y:2024:i:c:s136655452400156x. 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/wps/find/journaldescription.cws_home/600244/description#description .

    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.