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

Distributionally Robust Programming of Berth-Allocation-with-Crane-Allocation Problem with Uncertain Quay-Crane-Handling Efficiency

Author

Listed:
  • Xufeng Tang

    (College of Transport & Communications, Shanghai Maritime University, Shanghai 201306, China)

  • Chang Liu

    (School of Management, Shanghai University, Shanghai 200020, China)

  • Xinqi Li

    (School of Management, Shanghai University, Shanghai 200020, China)

  • Ying Ji

    (School of Management, Shanghai University, Shanghai 200020, China)

Abstract

In order to promote the efficient and intelligent construction of container ports, we focus on the optimization of berth-and-quay-crane (QC) allocation in tidal terminal operations. This paper investigates the quay-crane-profile-(QC-profile)-based assignment problem, and considers the uncertainty in QC profiles regarding QC efficiency for the first time. A mixed-integer programming (MIP) model is established for a discrete berth allocation with a crane-assignment problem (BACAP), considering the tide time window. We aim to minimize the total time loss caused by anchorage and the delay of vessels. Leveraging the theory of uncertainty optimization, the proposed deterministic model is extended into a stochastic programming (SP) model and a distributionally robust optimization (DRO) model, via the consideration of the random QC efficiency. To solve the proposed models, a column generation (CG) algorithm is employed, utilizing the mathematical method and subproblem-solving approach. The numerical experiments with different instances demonstrate that the DRO model yields a smaller variation in the objective function values, and the effectiveness of the CG method. The experimental results verify the robustness of the constructed models, and the efficiency of the proposed algorithm.

Suggested Citation

  • 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.
    • Handle: RePEc:gam:jsusta:v:15:y:2023:i:18:p:13448-:d:1235378
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/15/18/13448/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2071-1050/15/18/13448/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Agra, Agostinho & Rodrigues, Filipe, 2022. "Distributionally robust optimization for the berth allocation problem under uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 164(C), pages 1-24.
    2. Kuzmicz, Katarzyna Anna & Pesch, Erwin, 2019. "Approaches to empty container repositioning problems in the context of Eurasian intermodal transportation," Omega, Elsevier, vol. 85(C), pages 194-213.
    3. Feng Li & Jiuh-Biing Sheu & Zi-You Gao, 2015. "Solving the Continuous Berth Allocation and Specific Quay Crane Assignment Problems with Quay Crane Coverage Range," Transportation Science, INFORMS, vol. 49(4), pages 968-989, November.
    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. 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.
    6. Imai, Akio & Chen, Hsieh Chia & Nishimura, Etsuko & Papadimitriou, Stratos, 2008. "The simultaneous berth and quay crane allocation problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 44(5), pages 900-920, September.
    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. G. C. Calafiore & L. El Ghaoui, 2006. "On Distributionally Robust Chance-Constrained Linear Programs," Journal of Optimization Theory and Applications, Springer, vol. 130(1), pages 1-22, July.
    9. Xiang, Xi & Liu, Changchun & Miao, Lixin, 2017. "A bi-objective robust model for berth allocation scheduling under uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 106(C), pages 294-319.
    10. Lu Zhen & Ek Peng Chew & Loo Hay Lee, 2011. "An Integrated Model for Berth Template and Yard Template Planning in Transshipment Hubs," Transportation Science, INFORMS, vol. 45(4), pages 483-504, November.
    11. 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.
    12. 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.
    13. Türkoğulları, Yavuz B. & Taşkın, Z. Caner & Aras, Necati & Altınel, İ. Kuban, 2014. "Optimal berth allocation and time-invariant quay crane assignment in container terminals," European Journal of Operational Research, Elsevier, vol. 235(1), pages 88-101.
    14. 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.
    15. 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.
    16. Lorenz Kolley & Nicolas Rückert & Marvin Kastner & Carlos Jahn & Kathrin Fischer, 2023. "Robust berth scheduling using machine learning for vessel arrival time prediction," Flexible Services and Manufacturing Journal, Springer, vol. 35(1), pages 29-69, March.
    17. 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.
    18. Changchun Liu & Xi Xiang & Li Zheng, 2017. "Two decision models for berth allocation problem under uncertainty considering service level," Flexible Services and Manufacturing Journal, Springer, vol. 29(3), pages 312-344, December.
    19. Iris, Çağatay & Lam, Jasmine Siu Lee, 2019. "Recoverable robustness in weekly berth and quay crane planning," Transportation Research Part B: Methodological, Elsevier, vol. 122(C), pages 365-389.
    20. Xiang, Xi & Liu, Changchun, 2021. "An expanded robust optimisation approach for the berth allocation problem considering uncertain operation time," Omega, Elsevier, vol. 103(C).
    21. 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.
    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. Xiang, Xi & Liu, Changchun, 2021. "An almost robust optimization model for integrated berth allocation and quay crane assignment problem," Omega, Elsevier, vol. 104(C).
    2. 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.
    3. 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).
    4. Xiang, Xi & Liu, Changchun, 2021. "An expanded robust optimisation approach for the berth allocation problem considering uncertain operation time," Omega, Elsevier, vol. 103(C).
    5. 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.
    6. Iris, Çağatay & Pacino, Dario & Ropke, Stefan, 2017. "Improved formulations and an Adaptive Large Neighborhood Search heuristic for the integrated berth allocation and quay crane assignment problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 105(C), pages 123-147.
    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. 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.
    9. Liu, Baoli & Li, Zhi-Chun & Wang, Yadong, 2022. "A two-stage stochastic programming model for seaport berth and channel planning with uncertainties in ship arrival and handling times," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 167(C).
    10. Rodrigues, Filipe & Agra, Agostinho, 2021. "An exact robust approach for the integrated berth allocation and quay crane scheduling problem under uncertain arrival times," European Journal of Operational Research, Elsevier, vol. 295(2), pages 499-516.
    11. 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).
    12. Agra, Agostinho & Rodrigues, Filipe, 2022. "Distributionally robust optimization for the berth allocation problem under uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 164(C), pages 1-24.
    13. 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).
    14. Changchun Liu & Xi Xiang & Li Zheng, 2020. "A two-stage robust optimization approach for the berth allocation problem under uncertainty," Flexible Services and Manufacturing Journal, Springer, vol. 32(2), pages 425-452, June.
    15. 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.
    16. 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.
    17. 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.
    18. Fanrui Xie & Tao Wu & Canrong Zhang, 2019. "A Branch-and-Price Algorithm for the Integrated Berth Allocation and Quay Crane Assignment Problem," Transportation Science, INFORMS, vol. 53(5), pages 1427-1454, September.
    19. 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.
    20. 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.

    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:15:y:2023:i:18:p:13448-:d:1235378. 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.