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

Two-Stage Robust Programming Modeling for Continuous Berth Allocation with Uncertain Vessel Arrival Time

Author

Listed:
  • Shaojian Qu

    (The Research Institute for Risk Governance and Emergency Decision-Making, Collaborative Innovation Center on Forecast and Evaluation of Meteorological Disasters (CIC-FEMD), School of Management Science and Engineering, Nanjing University of Information Science & Technology, Nanjing 210044, China
    School of Economics and Management, Anhui Jianzhu University, Hefei 230022, China)

  • Xinqi Li

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

  • Chang Liu

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

  • Xufeng Tang

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

  • Zhisheng Peng

    (School of Economics and Management, Anhui Jianzhu University, Hefei 230022, China)

  • Ying Ji

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

Abstract

In order to mitigate the environmental pollution caused by sea freight, we focused on optimizing carbon emissions in container terminal operations. This paper establishes a mixed integer programming (MIP) model for a continuous berth allocation problem (CBAP) considering the tide time window. We aimed to minimize the total carbon emissions caused by the waiting time, consumption time and deviation to berth preference. In order to overcome the influence of an uncertain arrival time, the proposed MIP model was extended to mixed integer robust programming (MIRP) models, which applied a two-stage robust optimization (TSRO) approach to the optimal solution. We introduced an uncertainty set and scenarios to describe the uncertain arrival time. Due to the complexity of the resulting models, we proposed three particle swarm optimization (PSO) algorithms and made two novelties. The numerical experiment revealed that the robust models yielded a smaller variation in the objective function values, and the improved algorithms demonstrated a shorter solution time in solving the optimization problem. The results show the robustness of the constructed models and the efficiency of the proposed algorithms.

Suggested Citation

  • 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.
    • Handle: RePEc:gam:jsusta:v:15:y:2023:i:13:p:10560-:d:1186919
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. 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.
    2. Ursavas, Evrim & Zhu, Stuart X., 2016. "Optimal policies for the berth allocation problem under stochastic nature," European Journal of Operational Research, Elsevier, vol. 255(2), pages 380-387.
    3. Dimitris Bertsimas & Melvyn Sim, 2004. "The Price of Robustness," Operations Research, INFORMS, vol. 52(1), pages 35-53, February.
    4. Yangcan Wu & Lixin Miao & Ya Jia, 2021. "An Efficient Procedure for Inserting Buffers to Generate Robust Berth Plans in Container Terminals," Discrete Dynamics in Nature and Society, Hindawi, vol. 2021, pages 1-9, March.
    5. Han, Xiao-le & Lu, Zhi-qiang & Xi, Li-feng, 2010. "A proactive approach for simultaneous berth and quay crane scheduling problem with stochastic arrival and handling time," European Journal of Operational Research, Elsevier, vol. 207(3), pages 1327-1340, December.
    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. Kim, Kap Hwan & Moon, Kyung Chan, 2003. "Berth scheduling by simulated annealing," Transportation Research Part B: Methodological, Elsevier, vol. 37(6), pages 541-560, July.
    8. 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).
    9. 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).
    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. Ya Xu & Qiushuang Chen & Xiongwen Quan, 2012. "Robust berth scheduling with uncertain vessel delay and handling time," Annals of Operations Research, Springer, vol. 192(1), pages 123-140, January.
    12. 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.
    13. Zhen, Lu & Liang, Zhe & Zhuge, Dan & Lee, Loo Hay & Chew, Ek Peng, 2017. "Daily berth planning in a tidal port with channel flow control," Transportation Research Part B: Methodological, Elsevier, vol. 106(C), pages 193-217.
    14. Yun Peng & Wenyuan Wang & Ke Liu & Xiangda Li & Qi Tian, 2018. "The Impact of the Allocation of Facilities on Reducing Carbon Emissions from a Green Container Terminal Perspective," Sustainability, MDPI, vol. 10(6), pages 1-19, May.
    15. 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.
    16. Rajnish Kler & Roshan Gangurde & Samariddin Elmirzaev & Md Shamim Hossain & Nhut V. T. Vo & Tien V. T. Nguyen & P. Naveen Kumar & Peiman Ghasemi, 2022. "Optimization of Meat and Poultry Farm Inventory Stock Using Data Analytics for Green Supply Chain Network," Discrete Dynamics in Nature and Society, Hindawi, vol. 2022, pages 1-8, October.
    17. Hsien-Pin Hsu & Tai-Lin Chiang & Chia-Nan Wang & Hsin-Pin Fu & Chien-Chang Chou, 2019. "A Hybrid GA with Variable Quay Crane Assignment for Solving Berth Allocation Problem and Quay Crane Assignment Problem Simultaneously," Sustainability, MDPI, vol. 11(7), pages 1-21, April.
    18. 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.
    19. Joel Goh & Melvyn Sim, 2011. "Robust Optimization Made Easy with ROME," Operations Research, INFORMS, vol. 59(4), pages 973-985, August.
    20. Xiang, Xi & Liu, Changchun, 2021. "An almost robust optimization model for integrated berth allocation and quay crane assignment problem," Omega, Elsevier, vol. 104(C).
    21. 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.
    22. Lu Zhen & Qian Sun & Wei Zhang & Kai Wang & Wen Yi, 2021. "Column generation for low carbon berth allocation under uncertainty," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 72(10), pages 2225-2240, October.
    23. 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.
    24. Xiang, Xi & Liu, Changchun, 2021. "An expanded robust optimisation approach for the berth allocation problem considering uncertain operation time," Omega, Elsevier, vol. 103(C).
    25. 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.
    26. 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.
    27. Ji, Ying & Du, Jianhui & Han, Xiaoya & Wu, Xiaoqing & Huang, Ripeng & Wang, Shilei & Liu, Zhimin, 2020. "A mixed integer robust programming model for two-echelon inventory routing problem of perishable products," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 548(C).
    28. Walter J. Bell & Louis M. Dalberto & Marshall L. Fisher & Arnold J. Greenfield & R. Jaikumar & Pradeep Kedia & Robert G. Mack & Paul J. Prutzman, 1983. "Improving the Distribution of Industrial Gases with an On-Line Computerized Routing and Scheduling Optimizer," Interfaces, INFORMS, vol. 13(6), pages 4-23, December.
    29. Jia, Shuai & Li, Chung-Lun & Xu, Zhou, 2020. "A simulation optimization method for deep-sea vessel berth planning and feeder arrival scheduling at a container port," Transportation Research Part B: Methodological, Elsevier, vol. 142(C), pages 174-196.
    30. Ying Ji & Jianhui Du & Xiaoqing Wu & Zhong Wu & Deqiang Qu & Dan Yang, 2021. "Robust optimization approach to two-echelon agricultural cold chain logistics considering carbon emission and stochastic demand," Environment, Development and Sustainability: A Multidisciplinary Approach to the Theory and Practice of Sustainable Development, Springer, vol. 23(9), pages 13731-13754, September.
    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. 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.
    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. 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.
    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. 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. Xiang, Xi & Liu, Changchun, 2021. "An expanded robust optimisation approach for the berth allocation problem considering uncertain operation time," Omega, Elsevier, vol. 103(C).
    7. 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).
    8. 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).
    9. 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.
    10. 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.
    11. 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.
    12. 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.
    13. 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.
    14. Jia, Shuai & Li, Chung-Lun & Xu, Zhou, 2020. "A simulation optimization method for deep-sea vessel berth planning and feeder arrival scheduling at a container port," Transportation Research Part B: Methodological, Elsevier, vol. 142(C), pages 174-196.
    15. Correcher, Juan Francisco & Van den Bossche, Thomas & Alvarez-Valdes, Ramon & Vanden Berghe, Greet, 2019. "The berth allocation problem in terminals with irregular layouts," European Journal of Operational Research, Elsevier, vol. 272(3), pages 1096-1108.
    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. 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.
    18. 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.
    19. 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.
    20. 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.

    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:13:p:10560-:d:1186919. 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.