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

The continuous Berth Allocation Problem: A Greedy Randomized Adaptive Search Solution

Author

Listed:
  • Lee, Der-Horng
  • Chen, Jiang Hang
  • Cao, Jin Xin

Abstract

In this research, continuous and dynamic Berth Allocation Problem (BAP) is studied to minimize the total weighted flow time. Different from previous studies on continuous BAP, an efficient method is proposed to address the problem to identify the possible locations for next vessel in the Time-space diagram. Then two versions of Greedy Randomized Adaptive Search Procedure (GRASP) are developed to search for near optimal solutions. Both small and large scale numerical experiments are tested to examine the effectiveness of the proposed GRASPs by comparison with CPLEX and stochastic beam search, respectively.

Suggested Citation

  • Lee, Der-Horng & Chen, Jiang Hang & Cao, Jin Xin, 2010. "The continuous Berth Allocation Problem: A Greedy Randomized Adaptive Search Solution," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 46(6), pages 1017-1029, November.
    • Handle: RePEc:eee:transe:v:46:y:2010:i:6:p:1017-1029
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554510000207
    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. 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.
    3. Mohamed Abdel-Basset & Reda Mohamed & Karam M. Sallam & Ripon K. Chakrabortty, 2022. "Light Spectrum Optimizer: A Novel Physics-Inspired Metaheuristic Optimization Algorithm," Mathematics, MDPI, vol. 10(19), pages 1-63, September.
    4. H. L. Ma & S. H. Chung & H. K. Chan & Li Cui, 2019. "An integrated model for berth and yard planning in container terminals with multi-continuous berth layout," Annals of Operations Research, Springer, vol. 273(1), pages 409-431, February.
    5. Hamza Bouzekri & Gülgün Alpan & Vincent Giard, 2019. "Modélisation des problèmes de l’allocation des planches et des postes à quai," Post-Print hal-02277658, HAL.
    6. 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.
    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. 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).
    9. 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.
    10. 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.
    11. 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.
    12. 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.
    13. 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.
    14. 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.
    15. Abdellah Salhi & Ghazwan Alsoufi & Xinan Yang, 2019. "An evolutionary approach to a combined mixed integer programming model of seaside operations as arise in container ports," Annals of Operations Research, Springer, vol. 272(1), pages 69-98, January.
    16. 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.
    17. Wawrzyniak, Jakub & Drozdowski, Maciej & Sanlaville, Éric, 2020. "Selecting algorithms for large berth allocation problems," European Journal of Operational Research, Elsevier, vol. 283(3), pages 844-862.
    18. Shu-Chuan Chang & Ming-Hua Lin & Jung-Fa Tsai, 2024. "An Optimization Approach to Berth Allocation Problems," Mathematics, MDPI, vol. 12(5), pages 1-16, March.
    19. 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.
    20. Chen, Jiang Hang & Lee, Der-Horng & Cao, Jin Xin, 2012. "A combinatorial benders’ cuts algorithm for the quayside operation problem at container terminals," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(1), pages 266-275.
    21. Andreas T. Ernst & Ceyda Oğuz & Gaurav Singh & Gita Taherkhani, 2017. "Mathematical models for the berth allocation problem in dry bulk terminals," Journal of Scheduling, Springer, vol. 20(5), pages 459-473, October.
    22. 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.
    23. Shang, Xiao Ting & Cao, Jin Xin & Ren, Jie, 2016. "A robust optimization approach to the integrated berth allocation and quay crane assignment problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 94(C), pages 44-65.
    24. Iris, Çağatay & Pacino, Dario & Ropke, Stefan, 2017. "Improved formulations and an Adaptive Large Neighborhood Search heuristic for the integrated berth allocation and quay crane assignment problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 105(C), pages 123-147.
    25. 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.

    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:1017-1029. 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.