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

Integrating berth allocation and quay crane assignments

Author

Listed:
  • Chang, Daofang
  • Jiang, Zuhua
  • Yan, Wei
  • He, Junliang

Abstract

In this study, a dynamic allocation model using objective programming for berth allocation and quay crane assignments was preliminarily developed based on rolling-horizon approach. Afterwards, a hybrid parallel genetic algorithm (HPGA), which combined parallel genetic algorithm (PGA) and heuristic algorithm, was employed to resolve the proposed model. Furthermore, a simulation was conducted to evaluate the HPGA and to execute relevant gene repair techniques. Eventually, the numerical experiments on a specific container terminal were applied to illustrate the proposed models and algorithms. In so doing, the effectiveness of the proposed approach was verified.

Suggested Citation

  • Chang, Daofang & Jiang, Zuhua & Yan, Wei & He, Junliang, 2010. "Integrating berth allocation and quay crane assignments," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 46(6), pages 975-990, November.
    • Handle: RePEc:eee:transe:v:46:y:2010:i:6:p:975-990
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554510000608
    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. 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.
    2. Xiang, Xi & Liu, Changchun, 2021. "An almost robust optimization model for integrated berth allocation and quay crane assignment problem," Omega, Elsevier, vol. 104(C).
    3. Wang, Qi & Zhang, Chunyu & Ding, Yi & Xydis, George & Wang, Jianhui & Østergaard, Jacob, 2015. "Review of real-time electricity markets for integrating Distributed Energy Resources and Demand Response," Applied Energy, Elsevier, vol. 138(C), pages 695-706.
    4. Correcher, Juan F. & Alvarez-Valdes, Ramon & Tamarit, Jose M., 2019. "New exact methods for the time-invariant berth allocation and quay crane assignment problem," European Journal of Operational Research, Elsevier, vol. 275(1), pages 80-92.
    5. Ahmed Karam & Amr Eltawil & Kristian Hegner Reinau, 2020. "Energy-Efficient and Integrated Allocation of Berths, Quay Cranes, and Internal Trucks in Container Terminals," Sustainability, MDPI, vol. 12(8), pages 1-24, April.
    6. Frank Meisel & Christian Bierwirth, 2013. "A Framework for Integrated Berth Allocation and Crane Operations Planning in Seaport Container Terminals," Transportation Science, INFORMS, vol. 47(2), pages 131-147, May.
    7. Omar Abou Kasm & Ali Diabat & T. C. E. Cheng, 2020. "The integrated berth allocation, quay crane assignment and scheduling problem: mathematical formulations and a case study," Annals of Operations Research, Springer, vol. 291(1), pages 435-461, August.
    8. Iris, Çağatay & Pacino, Dario & Ropke, Stefan & Larsen, Allan, 2015. "Integrated Berth Allocation and Quay Crane Assignment Problem: Set partitioning models and computational results," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 81(C), pages 75-97.
    9. 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.
    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. Hongming Li & Xintao Li, 2022. "A Branch-and-Bound Algorithm for the Bi-Objective Quay Crane Scheduling Problem Based on Efficiency and Energy," Mathematics, MDPI, vol. 10(24), pages 1-20, December.
    12. Cimpeanu, Radu & Devine, Mel T. & O’Brien, Conor, 2017. "A simulation model for the management and expansion of extended port terminal operations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 98(C), pages 105-131.
    13. Zhen, Lu, 2014. "Container yard template planning under uncertain maritime market," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 69(C), pages 199-217.
    14. 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.
    15. Iris, Çağatay & Lam, Jasmine Siu Lee, 2019. "A review of energy efficiency in ports: Operational strategies, technologies and energy management systems," Renewable and Sustainable Energy Reviews, Elsevier, vol. 112(C), pages 170-182.
    16. Canrong Zhang & Tao Wu & Mingyao Qi & Lixin Miao, 2018. "Simultaneous Allocation of Berths and Quay Cranes under Discrete Berth Situation," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 35(03), pages 1-28, June.
    17. 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).
    18. Issam Krimi & Raca Todosijević & Rachid Benmansour & Mustapha Ratli & Abdessamad Ait Cadi & Afaf Aloullal, 2020. "Modelling and solving the multi-quays berth allocation and crane assignment problem with availability constraints," Journal of Global Optimization, Springer, vol. 78(2), pages 349-373, October.
    19. 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.
    20. Hsien-Pin Hsu & Chia-Nan Wang, 2020. "Resources Planning for Container Terminal in a Maritime Supply Chain Using Multiple Particle Swarms Optimization (MPSO)," Mathematics, MDPI, vol. 8(5), pages 1-31, May.
    21. 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.
    22. Wang, Tingsong & Wang, Xinchang & Meng, Qiang, 2018. "Joint berth allocation and quay crane assignment under different carbon taxation policies," Transportation Research Part B: Methodological, Elsevier, vol. 117(PA), pages 18-36.
    23. 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.
    24. Zhang, Yue & Liang, Chengji & Shi, Jian & Lim, Gino & Wu, Yiwei, 2022. "Optimal Port Microgrid Scheduling Incorporating Onshore Power Supply and Berth Allocation Under Uncertainty," Applied Energy, Elsevier, vol. 313(C).
    25. Gharehgozli, A.H. & Roy, D. & de Koster, M.B.M., 2014. "Sea Container Terminals," ERIM Report Series Research in Management ERS-2014-009-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.

    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:46:y:2010:i:6:p:975-990. 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.