IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v347y2025i3d10.1007_s10479-024-06318-5.html
   My bibliography  Save this article

Optimal refund policy design for ship berthing appointment mechanism

Author

Listed:
  • Haoqing Wang

    (The Hong Kong Polytechnic University)

  • Yan Liu

    (The Hong Kong Polytechnic University)

  • Yuquan Du

    (La Trobe University)

  • Shuaian Wang

    (The Hong Kong Polytechnic University)

Abstract

Seaports, the nodal and bottleneck points in the global supply chain network, have been making effort to encourage shipping companies to book berths before ships arrive at the ports. The information and communication technology (ICT) system is essential for the success of this effort. We propose an appointment mechanism with a refund policy for the berth booking ICT system to mitigate port congestion. Two refund policies are investigated: cash refund policy and coupon refund policy. We develop a bi-level model that considers the interests of the port and shipping companies, with which the cash refund policy determines its optimal booking fee and the returned cash, and the coupon refund policy determines its optimal booking fee, the value of the coupon, and the shelf life of the coupon. Numerical experiments are conducted to analyze the two refund policies, the reactions of shipping companies with different characteristics, and how the port takes advantage of the characteristics of shipping companies to maximize profit. The proposed appointment mechanism achieves a win-win performance for the port and shipping companies as it increases the income of the port and reduces the delay cost of shipping companies. This study innovatively investigates the refund policy for the berth booking system and helps understand the mechanism of the system, thereby providing theoretical support for applying the berth booking system in the maritime industry. Moreover, this study contributes to alleviating port congestion and to environmental sustainability by reducing ship emissions caused by waiting at port and inappropriate sailing speed.

Suggested Citation

  • Haoqing Wang & Yan Liu & Yuquan Du & Shuaian Wang, 2025. "Optimal refund policy design for ship berthing appointment mechanism," Annals of Operations Research, Springer, vol. 347(3), pages 1643-1670, April.
    • Handle: RePEc:spr:annopr:v:347:y:2025:i:3:d:10.1007_s10479-024-06318-5
    DOI: 10.1007/s10479-024-06318-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-024-06318-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-024-06318-5?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. Mikael Lind & Robert Ward & Michael Bergmann & Sandra Haraldson & Almir Zerem & Jan Hoffmann & Erik Eklund, 2021. "Maritime Informatics for Increased Collaboration," Progress in IS, in: Mikael Lind & Michalis Michaelides & Robert Ward & Richard T. Watson (ed.), Maritime Informatics, pages 113-136, Springer.
    2. Ksciuk, Jana & Kuhlemann, Stefan & Tierney, Kevin & Koberstein, Achim, 2023. "Uncertainty in maritime ship routing and scheduling: A Literature review," European Journal of Operational Research, Elsevier, vol. 308(2), pages 499-524.
    3. Arijit De & Saurabh Pratap & Akhilesh Kumar & M. K. Tiwari, 2020. "A hybrid dynamic berth allocation planning problem with fuel costs considerations for container terminal port using chemical reaction optimization approach," Annals of Operations Research, Springer, vol. 290(1), pages 783-811, July.
    4. Steinbach, Sandro, 2022. "Port congestion, container shortages, and U.S. foreign trade," Economics Letters, Elsevier, vol. 213(C).
    5. Changmin Jiang & Yulai Wan & Anming Zhang, 2017. "Internalization of port congestion: strategic effect behind shipping line delays and implications for terminal charges and investment," Maritime Policy & Management, Taylor & Francis Journals, vol. 44(1), pages 112-130, January.
    6. Robert Ward & Niels Bjørn-Andersen, 2021. "The Origins of Maritime Informatics," Progress in IS, in: Mikael Lind & Michalis Michaelides & Robert Ward & Richard T. Watson (ed.), Maritime Informatics, pages 5-11, Springer.
    7. Zhen, Lu & Xu, Zhou & Wang, Kai & Ding, Yi, 2016. "Multi-period yard template planning in container terminals," Transportation Research Part B: Methodological, Elsevier, vol. 93(PB), pages 700-719.
    8. 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.
    9. Jin Hyoung Park & Mikael Lind & Niels Bjørn-Andersen & Thomas Christensen & Fredrik Elern & Fred Pot, 2021. "Maritime Informatics for Recreational and Fishing Vessels," Progress in IS, in: Mikael Lind & Michalis Michaelides & Robert Ward & Richard T. Watson (ed.), Maritime Informatics, pages 237-253, Springer.
    10. 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.
    11. Nishimura, Etsuko & Imai, Akio & Papadimitriou, Stratos, 2001. "Berth allocation planning in the public berth system by genetic algorithms," European Journal of Operational Research, Elsevier, vol. 131(2), pages 282-292, June.
    12. Yuquan Du & Qiushuang Chen & Jasmine Siu Lee Lam & Ya Xu & Jin Xin Cao, 2015. "Modeling the Impacts of Tides and the Virtual Arrival Policy in Berth Allocation," Transportation Science, INFORMS, vol. 49(4), pages 939-956, November.
    13. Guy Desaulniers & Daniel Villeneuve, 2000. "The Shortest Path Problem with Time Windows and Linear Waiting Costs," Transportation Science, INFORMS, vol. 34(3), pages 312-319, August.
    14. van Riessen, B. & Negenborn, R.R. & Dekker, R., 2016. "Real-time Container Transport Planning with Decision Trees based on Offline Obtained Optimal Solutions," Econometric Institute Research Papers EI2016-14, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    15. Guo, Liming & Zheng, Jianfeng & Liang, Jinpeng & Wang, Shuaian, 2023. "Column generation for the multi-port berth allocation problem with port cooperation stability," Transportation Research Part B: Methodological, Elsevier, vol. 171(C), pages 3-28.
    16. Nan Liu & Peter M. van de Ven & Bo Zhang, 2019. "Managing Appointment Booking Under Customer Choices," Management Science, INFORMS, vol. 65(9), pages 4280-4298, September.
    17. Imai, Akio & Nishimura, Etsuko & Papadimitriou, Stratos, 2003. "Berth allocation with service priority," Transportation Research Part B: Methodological, Elsevier, vol. 37(5), pages 437-457, June.
    18. Wang, Shuaian & Meng, Qiang, 2012. "Liner ship route schedule design with sea contingency time and port time uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 46(5), pages 615-633.
    19. Liang Guo, 2009. "Service Cancellation and Competitive Refund Policy," Marketing Science, INFORMS, vol. 28(5), pages 901-917, 09-10.
    20. Mohammad Reza Amin-Naseri & Vahid Baradaran, 2015. "Accurate Estimation of Average Waiting Time in Public Transportation Systems," Transportation Science, INFORMS, vol. 49(2), pages 213-222, May.
    21. Roberts, Bryan & Rose, Adam & Heatwole, Nathaniel & Wei, Dan & Avetisyan, Misak & Chan, Oswin & Maya, Isaac, 2014. "The impact on the US economy of changes in wait times at ports of entry," Transport Policy, Elsevier, vol. 35(C), pages 162-175.
    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. Robenek, Tomáš & Umang, Nitish & Bierlaire, Michel & Ropke, Stefan, 2014. "A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports," European Journal of Operational Research, Elsevier, vol. 235(2), pages 399-411.
    3. 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.
    4. 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.
    5. Unsal, Ozgur & Oguz, Ceyda, 2019. "An exact algorithm for integrated planning of operations in dry bulk terminals," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 126(C), pages 103-121.
    6. Xu, Dongsheng & Li, Chung-Lun & Leung, Joseph Y.-T., 2012. "Berth allocation with time-dependent physical limitations on vessels," European Journal of Operational Research, Elsevier, vol. 216(1), pages 47-56.
    7. Branislav Dragović & Nam Kyu Park & Zoran Radmilović, 2006. "Ship-berth link performance evaluation: simulation and analytical approaches," Maritime Policy & Management, Taylor & Francis Journals, vol. 33(3), pages 281-299, July.
    8. Umang, Nitish & Bierlaire, Michel & Vacca, Ilaria, 2013. "Exact and heuristic methods to solve the berth allocation problem in bulk ports," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 54(C), pages 14-31.
    9. Imai, Akio & Nishimura, Etsuko & Hattori, Masahiro & Papadimitriou, Stratos, 2007. "Berth allocation at indented berths for mega-containerships," European Journal of Operational Research, Elsevier, vol. 179(2), pages 579-593, June.
    10. Imai, Akio & Yamakawa, Yukiko & Huang, Kuancheng, 2014. "The strategic berth template problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 72(C), pages 77-100.
    11. Jingjing Tong & Heather Nachtmann, 2017. "Cargo prioritization and terminal allocation problem for inland waterway disruptions," Maritime Economics & Logistics, Palgrave Macmillan;International Association of Maritime Economists (IAME), vol. 19(3), pages 403-427, August.
    12. Jean-François Cordeau & Gilbert Laporte & Pasquale Legato & Luigi Moccia, 2005. "Models and Tabu Search Heuristics for the Berth-Allocation Problem," Transportation Science, INFORMS, vol. 39(4), pages 526-538, November.
    13. Lee, Yusin & Chen, Chuen-Yih, 2009. "An optimization heuristic for the berth scheduling problem," European Journal of Operational Research, Elsevier, vol. 196(2), pages 500-508, July.
    14. Shangyao Yan & Chung-Cheng Lu & Jun-Hsiao Hsieh & Han-Chun Lin, 2019. "A Dynamic and Flexible Berth Allocation Model with Stochastic Vessel Arrival Times," Networks and Spatial Economics, Springer, vol. 19(3), pages 903-927, September.
    15. Haoqi Xie & Daniela Ambrosino, 2025. "Operations Research, Machine Learning, and Integrated Techniques for Decision Problems in the Seaside Area of Container Terminals," SN Operations Research Forum, Springer, vol. 6(2), pages 1-51, June.
    16. Imai, Akio & Nishimura, Etsuko & Papadimitriou, Stratos, 2013. "Marine container terminal configurations for efficient handling of mega-containerships," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 49(1), pages 141-158.
    17. 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.
    18. C. Cheong & K. Tan & D. Liu & C. Lin, 2010. "Multi-objective and prioritized berth allocation in container ports," Annals of Operations Research, Springer, vol. 180(1), pages 63-103, November.
    19. 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.
    20. 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).

    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:spr:annopr:v:347:y:2025:i:3:d:10.1007_s10479-024-06318-5. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.