IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v53y2019i3p728-745.html
   My bibliography  Save this article

Managing Navigation Channel Traffic and Anchorage Area Utilization of a Container Port

Author

Listed:
  • Shuai Jia

    (Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Kowloon, Hong Kong)

  • Chung-Lun Li

    (Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Kowloon, Hong Kong)

  • Zhou Xu

    (Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Kowloon, Hong Kong)

Abstract

Navigation channels are fairways for vessels to travel in and out of the terminal basin of a container port. The capacity of a navigation channel is restricted by the number of traffic lanes and safety clearance of vessels, and the availability of a navigation channel is usually affected by tides. The limited capacity and availability of a navigation channel could lead to congestion in the terminal basin. When the navigation channels run out of capacity, the anchorage areas in the terminal basin could serve as a buffer. This paper aims to develop a mathematical model that simultaneously optimizes the navigation channel traffic and anchorage area utilization. We provide a mixed integer programming formulation of the problem, analyze its complexity, and propose a Lagrangian relaxation heuristic in which the relaxed problem is decomposed into two asymmetric assignment problems. Computational performance of the Lagrangian relaxation heuristic is tested on problem instances generated based on the operational data of a port in Shanghai. Computational results show that the proposed heuristic is able to achieve satisfactory performance within a reasonable computation time. Data files and the online appendix are available at https://doi.org/10.1287/trsc.2018.0879 .

Suggested Citation

  • Shuai Jia & Chung-Lun Li & Zhou Xu, 2019. "Managing Navigation Channel Traffic and Anchorage Area Utilization of a Container Port," Transportation Science, INFORMS, vol. 53(3), pages 728-745, May.
    • Handle: RePEc:inm:ortrsc:v:53:y:2019:i:3:p:728-745
    DOI: 10.1287/trsc.2018.0879
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/trsc.2018.0879
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.2018.0879?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
    ---><---

    References listed on IDEAS

    as
    1. Nauss, Robert M., 2008. "Optimal sequencing in the presence of setup times for tow/barge traffic through a river lock," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1268-1281, June.
    2. Yi Ding & Shuai Jia & Tianyi Gu & Chung-Lun Li, 2016. "SGICT Builds an Optimization-Based System for Daily Berth Planning," Interfaces, INFORMS, vol. 46(4), pages 281-296, August.
    3. Marshall L. Fisher, 2004. "The Lagrangian Relaxation Method for Solving Integer Programming Problems," Management Science, INFORMS, vol. 50(12_supple), pages 1861-1871, December.
    4. 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.
    5. 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.
    6. Eduardo Lalla-Ruiz & Stefan Voß & Christopher Expósito-Izquierdo & Belén Melián-Batista & J. Marcos Moreno-Vega, 2017. "A POPMUSIC-based approach for the berth allocation problem under time-dependent limitations," Annals of Operations Research, Springer, vol. 253(2), pages 871-897, June.
    7. 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.
    8. E. R. Petersen & A. J. Taylor, 1988. "An Optimal Scheduling System for the Welland Canal," Transportation Science, INFORMS, vol. 22(3), pages 173-185, August.
    9. 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.
    10. Passchyn, Ward & Coene, Sofie & Briskorn, Dirk & Hurink, Johann L. & Spieksma, Frits C.R. & Vanden Berghe, Greet, 2016. "The lockmaster’s problem," European Journal of Operational Research, Elsevier, vol. 251(2), pages 432-441.
    11. F.J. Sluiman, 2017. "Transit vessel scheduling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(3), pages 225-248, April.
    12. 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.
    13. 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.
    14. Kap Hwan Kim & Hoon Lee, 2015. "Container Terminal Operation: Current Trends and Future Challenges," International Series in Operations Research & Management Science, in: Chung-Yee Lee & Qiang Meng (ed.), Handbook of Ocean Container Transport Logistics, edition 127, chapter 2, pages 43-73, Springer.
    15. Amir Hossein Gharehgozli & Debjit Roy & René de Koster, 2016. "Sea container terminals: New technologies and OR models," Maritime Economics & Logistics, Palgrave Macmillan;International Association of Maritime Economists (IAME), vol. 18(2), pages 103-140, June.
    16. Lalla-Ruiz, Eduardo & Expósito-Izquierdo, Christopher & Melián-Batista, Belén & Moreno-Vega, J. Marcos, 2016. "A Set-Partitioning-based model for the Berth Allocation Problem under Time-Dependent Limitations," European Journal of Operational Research, Elsevier, vol. 250(3), pages 1001-1012.
    17. Marshall L. Fisher, 2004. "Comments on ÜThe Lagrangian Relaxation Method for Solving Integer Programming ProblemsÝ," Management Science, INFORMS, vol. 50(12_supple), pages 1872-1874, December.
    18. Alessandro Hill & Eduardo Lalla-Ruiz & Stefan Voß & Marcos Goycoolea, 2019. "A multi-mode resource-constrained project scheduling reformulation for the waterway ship scheduling problem," Journal of Scheduling, Springer, vol. 22(2), pages 173-182, April.
    19. Shucheng Yu & Shuaian Wang & Lu Zhen, 2017. "Quay crane scheduling problem with considering tidal impact and fuel consumption," Flexible Services and Manufacturing Journal, Springer, vol. 29(3), pages 345-368, December.
    20. Qin, Tianbao & Du, Yuquan & Sha, Mei, 2016. "Evaluating the solution performance of IP and CP for berth allocation with time-varying water depth," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 87(C), pages 167-185.
    21. Eduardo Lalla-Ruiz, 2017. "Intelligent management of seaside logistic operations at maritime container terminals," 4OR, Springer, vol. 15(2), pages 217-218, June.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Dawn Russell & Kusumal Ruamsook & Violeta Roso, 2022. "Managing supply chain uncertainty by building flexibility in container port capacity: a logistics triad perspective and the COVID-19 case," Maritime Economics & Logistics, Palgrave Macmillan;International Association of Maritime Economists (IAME), vol. 24(1), pages 92-113, March.
    2. Wei, Xiaoyang & Jia, Shuai & Meng, Qiang & Tan, Kok Choon, 2020. "Tugboat scheduling for container ports," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).
    3. Guo, Zijian & Cao, Zhen & Wang, Wenyuan & Jiang, Ying & Xu, Xinglu & Feng, Peng, 2021. "An integrated model for vessel traffic and deballasting scheduling in coal export terminals," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 152(C).
    4. Zhao, Ke & Jin, Jian Gang & Zhang, Di & Ji, Sheng & Lee, Der-Horng, 2023. "A variable neighborhood search heuristic for real-time barge scheduling in a river-to-sea channel with tidal restrictions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 179(C).
    5. Hao, Luyao & Jin, Jian Gang & Zhao, Ke, 2023. "Joint scheduling of barges and tugboats for river–sea intermodal transport," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 173(C).
    6. 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).
    7. Doaa Naeem & Amr Eltawil & Junichi Iijima & Mohamed Gheith, 2022. "Integrated Scheduling of Automated Yard Cranes and Automated Guided Vehicles with Limited Buffer Capacity of Dual-Trolley Quay Cranes in Automated Container Terminals," Logistics, MDPI, vol. 6(4), pages 1-17, December.
    8. 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.
    9. Wu, Lingxiao & Jia, Shuai & Wang, Shuaian, 2020. "Pilotage planning in seaports," European Journal of Operational Research, Elsevier, vol. 287(1), pages 90-105.
    10. Petris, Matteo & Pellegrini, Paola & Pesenti, Raffaele, 2022. "Models and algorithms for an integrated vessel scheduling and tug assignment problem within a canal harbor," European Journal of Operational Research, Elsevier, vol. 300(3), pages 1120-1135.
    11. Liu, Baoli & Li, Zhi-Chun & Wang, Yadong & Sheng, Dian, 2021. "Short-term berth planning and ship scheduling for a busy seaport with channel restrictions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 154(C).
    12. Ziyun Wu & Bin Ji & Samson S. Yu, 2024. "Modeling and Solution Algorithm for Green Lock Scheduling Problem on Inland Waterways," Mathematics, MDPI, vol. 12(8), pages 1-25, April.
    13. Abou Kasm, Omar & Diabat, Ali & Bierlaire, Michel, 2021. "Vessel scheduling with pilotage and tugging considerations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 148(C).
    14. Li, Shuqin & Jia, Shuai, 2019. "The seaport traffic scheduling problem: Formulations and a column-row generation algorithm," Transportation Research Part B: Methodological, Elsevier, vol. 128(C), pages 158-184.
    15. Jinzhu Gao & Taitian An & Hongfen Zhang & Kuncheng Zhang & Jiawen Shen & Guangshun He & Xiao Yang & Rui Zhao & Shizheng Tian, 2023. "The Evaluation Method of the Marine Spatial Suitability for Islands from the Perspective of Sustainable Development: A Case Study of the Pingtan Islands," Sustainability, MDPI, vol. 15(11), pages 1-23, June.
    16. Xiao, Yi & Qi, Guanqiu & Jin, Mengjie & Yuen, Kum Fai & Chen, Zhuo & Li, Kevin X., 2021. "Efficiency of Port State Control inspection regimes: A comparative study," Transport Policy, Elsevier, vol. 106(C), pages 165-172.
    17. 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.
    18. Jin, Cheng-Jie & Yang, Wenzhang & Jiang, Rui & Liao, Peng & Zheng, Shiteng & Wang, Hao, 2023. "Vessel-following dynamics: Experiment and modeling," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 615(C).

    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. 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.
    2. Li, Shuqin & Jia, Shuai, 2019. "The seaport traffic scheduling problem: Formulations and a column-row generation algorithm," Transportation Research Part B: Methodological, Elsevier, vol. 128(C), pages 158-184.
    3. 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.
    4. Liu, Baoli & Li, Zhi-Chun & Wang, Yadong & Sheng, Dian, 2021. "Short-term berth planning and ship scheduling for a busy seaport with channel restrictions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 154(C).
    5. 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.
    6. Liu, Baoli & Li, Zhi-Chun & Wang, Yadong, 2023. "A branch-and-price heuristic algorithm for the bunkering operation problem of a liquefied natural gas bunkering station in the inland waterways," Transportation Research Part B: Methodological, Elsevier, vol. 167(C), pages 145-170.
    7. 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.
    8. 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.
    9. 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.
    10. Petris, Matteo & Pellegrini, Paola & Pesenti, Raffaele, 2022. "Models and algorithms for an integrated vessel scheduling and tug assignment problem within a canal harbor," European Journal of Operational Research, Elsevier, vol. 300(3), pages 1120-1135.
    11. Ya Xu & Kelei Xue & Yuquan Du, 2018. "Berth Scheduling Problem Considering Traffic Limitations in the Navigation Channel," Sustainability, MDPI, vol. 10(12), pages 1-22, December.
    12. Ji, Bin & Yuan, Xiaohui & Yuan, Yanbin & Lei, Xiaohui & Fernando, Tyrone & Iu, Herbert H.C., 2019. "Exact and heuristic methods for optimizing lock-quay system in inland waterway," European Journal of Operational Research, Elsevier, vol. 277(2), pages 740-755.
    13. 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.
    14. 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).
    15. Yi Ding & Shuai Jia & Tianyi Gu & Chung-Lun Li, 2016. "SGICT Builds an Optimization-Based System for Daily Berth Planning," Interfaces, INFORMS, vol. 46(4), pages 281-296, August.
    16. 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.
    17. Giorgi Tadumadze & Simon Emde & Heiko Diefenbach, 2020. "Exact and heuristic algorithms for scheduling jobs with time windows on unrelated parallel machines," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(2), pages 461-497, June.
    18. Kang, Liujiang & Meng, Qiang & Tan, Kok Choon, 2020. "Tugboat scheduling under ship arrival and tugging process time uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 144(C).
    19. Jaap-Jan Steeg & Menno Oudshoorn & Neil Yorke-Smith, 2023. "Berth planning and real-time disruption recovery: a simulation study for a tidal port," Flexible Services and Manufacturing Journal, Springer, vol. 35(1), pages 70-110, March.
    20. 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.

    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:inm:ortrsc:v:53:y:2019:i:3:p:728-745. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.