IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v44y2008i1p136-151.html
   My bibliography  Save this article

Berthing ships at a multi-user container terminal with a limited quay capacity

Author

Listed:
  • Imai, Akio
  • Nishimura, Etsuko
  • Papadimitriou, Stratos

Abstract

This paper addresses a variation of the berth allocation problem at multi-user terminals, as ships which would normally be served at the terminal but their expected wait time exceeds the time limit, are assigned to an external terminal. The objective of the problem is to minimize the total service time of ships at the external terminal. A genetic algorithm based heuristic is developed and a wide variety of numerical experiments showed that the heuristic developed performed well in reducing external terminal usage and thus may be helpful in the efficient management of busy ports during extreme peaking conditions.

Suggested Citation

  • Imai, Akio & Nishimura, Etsuko & Papadimitriou, Stratos, 2008. "Berthing ships at a multi-user container terminal with a limited quay capacity," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 44(1), pages 136-151, January.
    • Handle: RePEc:eee:transe:v:44:y:2008:i:1:p:136-151
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S136655450600041X
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. 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.
    2. 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).
    3. Buddhi A. Weerasinghe & H. Niles Perera & Xiwen Bai, 2024. "Optimizing container terminal operations: a systematic review of operations research applications," Maritime Economics & Logistics, Palgrave Macmillan;International Association of Maritime Economists (IAME), vol. 26(2), pages 307-341, June.
    4. Ya Xu & Yuquan Du & Yongjian Li & Heng Zhang, 2021. "Collaborative emergency berth scheduling based on decentralized decision and price mechanism," Annals of Operations Research, Springer, vol. 298(1), pages 525-554, March.
    5. 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.
    6. 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.
    7. 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).
    8. Qiaoyu Peng & Chuanxu Wang, 2022. "Ship space sharing strategies with different rental modes: How does NVOCCs cooperate with booking platform?," Operational Research, Springer, vol. 22(3), pages 3003-3035, July.
    9. Schepler, Xavier & Balev, Stefan & Michel, Sophie & Sanlaville, Éric, 2017. "Global planning in a multi-terminal and multi-modal maritime container port," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 100(C), pages 38-62.
    10. 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).
    11. Wen-Kai K. Hsu & Hong-Fwu Yu & Show-Hui S. Huang, 2015. "Evaluating the service requirements of dedicated container terminals: a revised IPA model with fuzzy AHP," Maritime Policy & Management, Taylor & Francis Journals, vol. 42(8), pages 789-805, November.
    12. Wang, Shuaian & Meng, Qiang & Liu, Zhiyuan, 2013. "A note on “Berth allocation considering fuel consumption and vessel emissions”," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 49(1), pages 48-54.
    13. Hamed Hasheminia & Changmin Jiang, 2017. "Strategic trade-off between vessel delay and schedule recovery: an empirical analysis of container liner shipping," Maritime Policy & Management, Taylor & Francis Journals, vol. 44(4), pages 458-473, May.
    14. 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.
    15. Shih-Wei Lin & Ching-Jung Ting & Kun-Chih Wu, 2018. "Simulated annealing with different vessel assignment strategies for the continuous berth allocation problem," Flexible Services and Manufacturing Journal, Springer, vol. 30(4), pages 740-763, December.
    16. Li, Chen & Qi, Xiangtong & Song, Dongping, 2016. "Real-time schedule recovery in liner shipping service with regular uncertainties and disruption events," Transportation Research Part B: Methodological, Elsevier, vol. 93(PB), pages 762-788.
    17. 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.
    18. 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.
    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. Evrim Ursavas, 2022. "Priority control of berth allocation problem in container terminals," Annals of Operations Research, Springer, vol. 317(2), pages 805-824, October.
    21. 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.
    22. 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.
    23. 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.

    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:44:y:2008:i:1:p:136-151. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.