IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v16y2024i7p2985-d1369576.html
   My bibliography  Save this article

Collaborative Scheduling Optimization of Container Port Berths and Cranes under Low-Carbon Environment

Author

Listed:
  • Meixian Jiang

    (College of Mechanical Engineering, Zhejiang University of Technology, Hangzhou 310023, China)

  • Fangzheng Ma

    (College of Mechanical Engineering, Zhejiang University of Technology, Hangzhou 310023, China)

  • Yuqiu Zhang

    (College of Biomedical Science and Engineering, South China University of Technology, Guangzhou 510006, China)

  • Shuying Lv

    (College of Mechanical Engineering, Zhejiang University of Technology, Hangzhou 310023, China)

  • Zhi Pei

    (College of Mechanical Engineering, Zhejiang University of Technology, Hangzhou 310023, China)

  • Guanghua Wu

    (College of Mechanical Engineering, Zhejiang University of Technology, Hangzhou 310023, China)

Abstract

Motivated by the need for a green and low-carbon economy, we explore the co-scheduling optimization of berths and cranes. Our aim is to balance the carbon tax and operating costs of ports under uncertain conditions, proposing an innovative nonlinear mixed-integer programming formulation. To address this optimization challenge, we have developed an enhanced version of the adaptive spiral flying dung beetle algorithm (ASFDBO). In order to evaluate the performance of the ASFDBO algorithm, we performed a benchmark function test and a convergence analysis with other recognized metaheuristics. In addition, we verified the practical applicability of the ASFDBO algorithm in different test scenarios. Through numerical experiments, we analyze the feasibility and effectiveness of the algorithm’s scheduling solutions and improvement strategies. Results indicate that our collaborative scheduling optimization, which considers both carbon and production costs, achieves feasible solutions and reduces carbon expenses. Finally, we investigate the impact of different carbon tax rates on the joint scheduling optimization of berths and quay cranes, and the results show that a reasonable carbon tax policy can effectively reduce the carbon emissions of ports.

Suggested Citation

  • Meixian Jiang & Fangzheng Ma & Yuqiu Zhang & Shuying Lv & Zhi Pei & Guanghua Wu, 2024. "Collaborative Scheduling Optimization of Container Port Berths and Cranes under Low-Carbon Environment," Sustainability, MDPI, vol. 16(7), pages 1-26, April.
  • Handle: RePEc:gam:jsusta:v:16:y:2024:i:7:p:2985-:d:1369576
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/16/7/2985/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2071-1050/16/7/2985/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. 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.
    2. T. Jonker & M. B. Duinkerken & N. Yorke-Smith & A. Waal & R. R. Negenborn, 2021. "Coordinated optimization of equipment operations in a container terminal," Flexible Services and Manufacturing Journal, Springer, vol. 33(2), pages 281-311, June.
    3. Agra, Agostinho & Oliveira, Maryse, 2018. "MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem," European Journal of Operational Research, Elsevier, vol. 264(1), pages 138-148.
    4. Xiang, Xi & Liu, Changchun, 2021. "An almost robust optimization model for integrated berth allocation and quay crane assignment problem," Omega, Elsevier, vol. 104(C).
    5. Wang, Tingsong & Wang, Xinchang & Meng, Qiang, 2018. "Joint berth allocation and quay crane assignment under different carbon taxation policies," Transportation Research Part B: Methodological, Elsevier, vol. 117(PA), pages 18-36.
    6. Xiaogang Jiao & Feifeng Zheng & Ming Liu & Yinfeng Xu, 2018. "Integrated Berth Allocation and Time-Variant Quay Crane Scheduling with Tidal Impact in Approach Channel," Discrete Dynamics in Nature and Society, Hindawi, vol. 2018, pages 1-19, October.
    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. 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.
    2. 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.
    3. 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).
    4. Xufeng Tang & Chang Liu & Xinqi Li & Ying Ji, 2023. "Distributionally Robust Programming of Berth-Allocation-with-Crane-Allocation Problem with Uncertain Quay-Crane-Handling Efficiency," Sustainability, MDPI, vol. 15(18), pages 1-27, September.
    5. 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.
    6. Meixian Jiang & Jiajia Feng & Jian Zhou & Lin Zhou & Fangzheng Ma & Guanghua Wu & Yuqiu Zhang, 2023. "Multi-Terminal Berth and Quay Crane Joint Scheduling in Container Ports Considering Carbon Cost," Sustainability, MDPI, vol. 15(6), pages 1-20, March.
    7. Rodrigues, Filipe & Agra, Agostinho, 2022. "Berth allocation and quay crane assignment/scheduling problem under uncertainty: A survey," European Journal of Operational Research, Elsevier, vol. 303(2), pages 501-524.
    8. Liu, Changchun, 2020. "Iterative heuristic for simultaneous allocations of berths, quay cranes, and yards under practical situations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 133(C).
    9. Xiang, Xi & Liu, Changchun, 2021. "An almost robust optimization model for integrated berth allocation and quay crane assignment problem," Omega, Elsevier, vol. 104(C).
    10. Guo, Liming & Zheng, Jianfeng & Du, Haoming & Du, Jian & Zhu, Zhihong, 2022. "The berth assignment and allocation problem considering cooperative liner carriers," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    11. Shaojian Qu & Xinqi Li & Chang Liu & Xufeng Tang & Zhisheng Peng & Ying Ji, 2023. "Two-Stage Robust Programming Modeling for Continuous Berth Allocation with Uncertain Vessel Arrival Time," Sustainability, MDPI, vol. 15(13), pages 1-30, July.
    12. El Mehdi, Er Raqabi & Ilyas, Himmich & Nizar, El Hachemi & Issmaïl, El Hallaoui & François, Soumis, 2023. "Incremental LNS framework for integrated production, inventory, and vessel scheduling: Application to a global supply chain," Omega, Elsevier, vol. 116(C).
    13. Liu, Baoli & Li, Zhi-Chun & Sheng, Dian & Wang, Yadong, 2021. "Integrated planning of berth allocation and vessel sequencing in a seaport with one-way navigation channel," Transportation Research Part B: Methodological, Elsevier, vol. 143(C), pages 23-47.
    14. Mao, Anjia & Yu, Tiantian & Ding, Zhaohao & Fang, Sidun & Guo, Jinran & Sheng, Qianqian, 2022. "Optimal scheduling for seaport integrated energy system considering flexible berth allocation," Applied Energy, Elsevier, vol. 308(C).
    15. Sung Won Cho & Hyun Ji Park & Chulung Lee, 2021. "An integrated method for berth allocation and quay crane assignment to allow for reassignment of vessels to other terminals," Maritime Economics & Logistics, Palgrave Macmillan;International Association of Maritime Economists (IAME), vol. 23(1), pages 123-153, March.
    16. Wang, Chong & Liu, Kaiyuan & Zhang, Canrong & Miao, Lixin, 2024. "Distributionally robust chance-constrained optimization for the integrated berth allocation and quay crane assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 182(C).
    17. Omar Abou Kasm & Ali Diabat & T. C. E. Cheng, 2020. "The integrated berth allocation, quay crane assignment and scheduling problem: mathematical formulations and a case study," Annals of Operations Research, Springer, vol. 291(1), pages 435-461, August.
    18. Gharehgozli, Amir & Zaerpour, Nima, 2018. "Stacking outbound barge containers in an automated deep-sea terminal," European Journal of Operational Research, Elsevier, vol. 267(3), pages 977-995.
    19. 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).
    20. Chargui, Kaoutar & Zouadi, Tarik & El Fallahi, Abdellah & Reghioui, Mohamed & Aouam, Tarik, 2021. "Berth and quay crane allocation and scheduling with worker performance variability and yard truck deployment in container terminals," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 154(C).

    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:gam:jsusta:v:16:y:2024:i:7:p:2985-:d:1369576. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.