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

A combinatorial benders’ cuts algorithm for the quayside operation problem at container terminals

Author

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

Abstract

The quayside operation problem is one of the key components in the management system for a container terminal. In this paper, the integrated models proposed in the previous studies to address the quayside operation problem are examined and one of the potential frameworks is identified. A new method called combinatorial benders’ cuts algorithm is developed to solve the berth-level model in the framework. The computational experiment conducted in this research shows that the proposed approach is more efficient than the branch and cut algorithm embedded in CPLEX.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:transe:v:48:y:2012:i:1:p:266-275
    DOI: 10.1016/j.tre.2011.06.004
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554511000834
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.tre.2011.06.004?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 search for a different version of it.

    References listed on IDEAS

    as
    1. Meisel, Frank & Bierwirth, Christian, 2009. "Heuristics for the integration of crane productivity in the berth allocation problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 45(1), pages 196-209, January.
    2. 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.
    3. 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.
    4. Imai, Akio & Chen, Hsieh Chia & Nishimura, Etsuko & Papadimitriou, Stratos, 2008. "The simultaneous berth and quay crane allocation problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 44(5), pages 900-920, September.
    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. Fang, Kan & Wang, Shijin & Pinedo, Michael L. & Chen, Lin & Chu, Feng, 2021. "A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions," European Journal of Operational Research, Elsevier, vol. 291(1), pages 128-146.
    2. Mancini, Simona & Gansterer, Margaretha, 2021. "Vehicle scheduling for rental-with-driver services," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 156(C).
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. Zhang, Qihuan & Wang, Ziteng & Huang, Min & Yu, Yang & Fang, Shu-Cherng, 2022. "Heterogeneous multi-depot collaborative vehicle routing problem," Transportation Research Part B: Methodological, Elsevier, vol. 160(C), pages 1-20.
    8. Gharehgozli, Amir & Yu, Yugang & de Koster, René & Du, Shaofu, 2019. "Sequencing storage and retrieval requests in a container block with multiple open locations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 125(C), pages 261-284.
    9. Gharehgozli, Amir Hossein & Vernooij, Floris Gerardus & Zaerpour, Nima, 2017. "A simulation study of the performance of twin automated stacking cranes at a seaport container terminal," European Journal of Operational Research, Elsevier, vol. 261(1), pages 108-128.
    10. 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.
    11. 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.
    12. Jiayin Pan & Yinfeng Xu & Guiqing Zhang, 2018. "Online integrated allocation of berths and quay cranes in container terminals with 1-lookahead," Journal of Combinatorial Optimization, Springer, vol. 36(2), pages 617-636, August.
    13. 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.
    14. 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.
    15. Mancini, Simona & Ciavotta, Michele & Meloni, Carlo, 2021. "The Multiple Multidimensional Knapsack with Family-Split Penalties," European Journal of Operational Research, Elsevier, vol. 289(3), pages 987-998.

    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. 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. 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).
    3. 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.
    4. 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.
    5. 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.
    6. Zhen, Lu & Lee, Loo Hay & Chew, Ek Peng, 2011. "A decision model for berth allocation under uncertainty," European Journal of Operational Research, Elsevier, vol. 212(1), pages 54-68, July.
    7. 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.
    8. 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.
    9. 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.
    10. 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.
    11. 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.
    12. Fanrui Xie & Tao Wu & Canrong Zhang, 2019. "A Branch-and-Price Algorithm for the Integrated Berth Allocation and Quay Crane Assignment Problem," Transportation Science, INFORMS, vol. 53(5), pages 1427-1454, September.
    13. Ilaria Vacca & Matteo Salani & Michel Bierlaire, 2013. "An Exact Algorithm for the Integrated Planning of Berth Allocation and Quay Crane Assignment," Transportation Science, INFORMS, vol. 47(2), pages 148-161, May.
    14. Han, Xiao-le & Lu, Zhi-qiang & Xi, Li-feng, 2010. "A proactive approach for simultaneous berth and quay crane scheduling problem with stochastic arrival and handling time," European Journal of Operational Research, Elsevier, vol. 207(3), pages 1327-1340, December.
    15. 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.
    16. 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.
    17. 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.
    18. T. R. Lalita & G. S. R. Murthy, 2022. "Compact ILP formulations for a class of solutions to berth allocation and quay crane scheduling problems," OPSEARCH, Springer;Operational Research Society of India, vol. 59(1), pages 413-439, March.
    19. 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.
    20. Zhen, Lu, 2015. "Tactical berth allocation under uncertainty," European Journal of Operational Research, Elsevier, vol. 247(3), pages 928-944.

    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:48:y:2012:i:1:p:266-275. 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.