IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v205y2026ics1366554525005186.html

Pricing and equity in strategic berth allocation problem considering general and dedicated service modes

Author

Listed:
  • Guo, Liming
  • Zheng, Jianfeng
  • Du, Jian

Abstract

Port operators can enhance their competitiveness by strategically adjusting service charges to attract more vessels from neighboring ports. In terms of service equity and profitability of the port, a novel vessel-oriented and port-oriented strategic berth allocation problem (SBAP) is proposed to determine the service fee charged to each liner carrier and the accepted number of arriving vessels in a port. In addition, two service modes in the port are introduced: the general service where incoming vessels from liner carriers share general berths and queue for service, and the dedicated service where selected berths are reserved for a specific liner carrier, exclusively serving its vessels. By modeling vessels and berths as customers and servers, we formulate the SBAP as a queueing system with different queueing structures corresponding to each service mode. To maximize port profits while ensuring service equity among liner carriers, a bi-objective mixed integer programming (BMIP) model based on queueing theory is formulated by determining the proper pricing, queueing structure and the quantity of dedicated berths reserved for individual liner carrier. To efficiently solve the BMIP model and obtain the Pareto frontier, we design a solution approach combining the ε-constraint method with a non-dominated sorting strategy. Numerical experiments demonstrate the effectiveness of the proposed model and solution method.

Suggested Citation

  • Guo, Liming & Zheng, Jianfeng & Du, Jian, 2026. "Pricing and equity in strategic berth allocation problem considering general and dedicated service modes," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 205(C).
    • Handle: RePEc:eee:transe:v:205:y:2026:i:c:s1366554525005186
    DOI: 10.1016/j.tre.2025.104477
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554525005186
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.tre.2025.104477?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

    for a different version of it.

    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. Bouzekri, Hamza & Alpan, Gülgün & Giard, Vincent, 2021. "Integrated Laycan and Berth Allocation and time-invariant Quay Crane Assignment Problem in tidal ports with multiple quays," European Journal of Operational Research, Elsevier, vol. 293(3), pages 892-909.
    3. Feng, Xuejun & Hu, Sangen & Gu, Weihua & Jin, Xin & Lu, Yuan, 2020. "A simulation-based approach for assessing seaside infrastructure improvement measures for large marine crude oil terminals," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).
    4. Elin Halvorsen-Weare & Kjetil Fagerholt, 2013. "Routing and scheduling in a liquefied natural gas shipping problem with inventory and berth constraints," Annals of Operations Research, Springer, vol. 203(1), pages 167-186, March.
    5. Liu, Baoli & Wang, Xincheng & Wang, Zehao & Zheng, Jianfeng & Sheng, Dian, 2025. "Modeling and solving the joint berth allocation and vessel sequencing problem with speed optimization in a busy seaport," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 197(C).
    6. Gao, Zhendi & Ji, Mingjun & Kong, Lingrui & Hou, Xinhao, 2024. "Scheduling of automated ore terminal operations based on fixed inflow rhythm," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 182(C).
    7. 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).
    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. 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.
    10. 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.
    11. Martin-Iradi, Bernardo & Pacino, Dario & Ropke, Stefan, 2024. "An adaptive large neighborhood search heuristic for the multi-port continuous berth allocation problem," European Journal of Operational Research, Elsevier, vol. 316(1), pages 152-167.
    12. Kuancheng Huang & Suprayogi & Ariantini, 2016. "A continuous berth template design model with multiple wharfs," Maritime Policy & Management, Taylor & Francis Journals, vol. 43(6), pages 763-775, August.
    13. Abbas Al-Refaie & Hala Abedalqader, 2022. "Optimal berth scheduling and sequencing under unexpected events," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 73(2), pages 430-444, March.
    14. Qiang Meng & Shuaian Wang & Henrik Andersson & Kristian Thun, 2014. "Containership Routing and Scheduling in Liner Shipping: Overview and Future Research Directions," Transportation Science, INFORMS, vol. 48(2), pages 265-280, May.
    15. Ping Cao & Shuangchi He & Junfei Huang & Yunan Liu, 2021. "To Pool or Not to Pool: Queueing Design for Large-Scale Service Systems," Operations Research, INFORMS, vol. 69(6), pages 1866-1885, November.
    16. Zhen, Lu & Wu, Jingwen & Wang, Shuaian & Li, Siyu & Wang, Miaomiao, 2025. "Optimizing automotive maritime transportation in Ro-Ro and container shipping," Transportation Research Part B: Methodological, Elsevier, vol. 194(C).
    17. Lyu, Xiaohuan & Lalla-Ruiz, Eduardo & Schulte, Frederik, 2025. "The collaborative berth allocation problem with row-generation algorithms for stable cost allocations," European Journal of Operational Research, Elsevier, vol. 323(3), pages 888-906.
    18. 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.
    19. 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.
    20. 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.
    21. 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.
    22. 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.
    23. Dong, Gang & Huang, Rongbing & Ng, Peggy, 2016. "Tacit collusion between two terminals of a port," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 93(C), pages 199-211.
    24. 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.
    25. Zhen, Lu & Wang, Wencheng & Lin, Shumin & Yang, Linying & Jiang, Shenyan, 2025. "Joint berth and flexible storage space allocation in container tower ports," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 194(C).
    26. Wang, Chong & Wang, Qi & Xiang, Xi & Zhang, Canrong & Miao, Lixin, 2025. "Optimizing integrated berth allocation and quay crane assignment: A distributionally robust approach," European Journal of Operational Research, Elsevier, vol. 320(3), pages 593-615.
    27. Hamza Bouzekri & Gülgün Alpan & Vincent Giard, 2021. "Integrated Laycan and Berth Allocation and time-invariant Quay Crane Assignment Problem in tidal ports with multiple quays," Post-Print hal-03107972, HAL.
    28. Hamza Bouzekri & Gülgün Alpan & Vincent Giard, 2021. "Integrated Laycan and Berth Allocation and time-invariant Quay Crane Assignment Problem in tidal ports with multiple quays," Post-Print hal-02480102, HAL.
    29. Lu, Bo & Fan, Lijie & Wang, Huipo & Moon, Ilkyeong, 2024. "Price-cutting or incentive? Differentiated competition between regional asymmetric ports," Transport Policy, Elsevier, vol. 147(C), pages 215-231.
    30. Li, Bokang & Afkhami, Payam & Khayamim, Razieh & Borowska-Stefańska, Marta & Wiśniewski, Szymon & Fathollahi-Fard, Amir M. & Ozkul, Seckin & Dulebenets, Maxim A., 2025. "An intelligent hyperheuristic algorithm for the berth allocation and scheduling problem at marine container terminals," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 198(C).
    31. Shumin Lin & Lu Zhen & Wencheng Wang & Zheyi Tan, 2023. "Green berth and yard space allocation under carbon tax policy in tidal ports," Maritime Policy & Management, Taylor & Francis Journals, vol. 50(8), pages 1080-1101, November.
    32. Korekane, Shinya & Nishi, Tatsushi & Tierney, Kevin & Liu, Ziang, 2024. "Neural network assisted branch and bound algorithm for dynamic berth allocation problems," European Journal of Operational Research, Elsevier, vol. 319(2), pages 531-542.
    33. Fernández, Elena & Munoz-Marquez, Manuel, 2022. "New formulations and solutions for the strategic berth template problem," European Journal of Operational Research, Elsevier, vol. 298(1), pages 99-117.
    34. Zhen, Lu, 2015. "Tactical berth allocation under uncertainty," European Journal of Operational Research, Elsevier, vol. 247(3), pages 928-944.
    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. 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).
    2. Dragović, Branislav & Dragović, Andro & Dulebenets, Maxim A., 2025. "The quay crane operation problem at marine container terminals: bibliometric analysis, emerging trends, and future research opportunities," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 201(C).
    3. Gao, Zhendi & Ji, Mingjun & Liang, Jinpeng & Kong, Lingrui, 2025. "Fill rate oriented scheduling policy for integrated ore terminal order acceptance and berth allocation," Transportation Research Part B: Methodological, Elsevier, vol. 202(C).
    4. 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.
    5. Li, Bokang & Afkhami, Payam & Khayamim, Razieh & Borowska-Stefańska, Marta & Wiśniewski, Szymon & Fathollahi-Fard, Amir M. & Ozkul, Seckin & Dulebenets, Maxim A., 2025. "An intelligent hyperheuristic algorithm for the berth allocation and scheduling problem at marine container terminals," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 198(C).
    6. Gao, Zhendi & Ji, Mingjun & Kong, Lingrui & Ji, Shengzhong & Hou, Xinhao, 2026. "Integrated scheduling for ore terminals under cargo flow uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 205(C).
    7. 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.
    8. 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.
    9. 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).
    10. 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).
    11. Lu Zhen & Haolin Li & Liyang Xiao & Dayu Lin & Shuaian Wang, 2024. "Mathematical Programming-Driven Daily Berth Planning in Xiamen Port," Interfaces, INFORMS, vol. 54(4), pages 329-356, July.
    12. 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).
    13. 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.
    14. Xiang, Xi & Liu, Changchun, 2021. "An expanded robust optimisation approach for the berth allocation problem considering uncertain operation time," Omega, Elsevier, vol. 103(C).
    15. Yang, Zhiyuan & Wang, Miaomiao & Wang, Shuaian & Zhen, Lu, 2025. "Optimizing continuous-time berth allocation, time-variant quay crane and yard assignment," Transportation Research Part B: Methodological, Elsevier, vol. 200(C).
    16. 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.
    17. Yaqiong Lv & Jingwen Wang & Zhongyuan Liu & Mingkai Zou, 2025. "From Heuristics to Multi-Agent Learning: A Survey of Intelligent Scheduling Methods in Port Seaside Operations," Mathematics, MDPI, vol. 13(17), pages 1-57, August.
    18. 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.
    19. Wang, Chong & Wang, Qi & Xiang, Xi & Zhang, Canrong & Miao, Lixin, 2025. "Optimizing integrated berth allocation and quay crane assignment: A distributionally robust approach," European Journal of Operational Research, Elsevier, vol. 320(3), pages 593-615.
    20. Berktas, Nihal & Zografos, Konstantinos G., 2025. "Generic model for capacity allocation on transportation terminals," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 196(C).

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:205:y:2026:i:c:s1366554525005186. 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.