IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v66y2019i4p333-351.html
   My bibliography  Save this article

Mathematical formulation and heuristic algorithm for the block relocation and loading problem

Author

Listed:
  • Huiling Zhu
  • Mingjun Ji
  • Wenwen Guo
  • Qingbin Wang
  • Yongzhi Yang

Abstract

This study considers the block relocation and loading problem in container terminals. The optimal loading sequence and relocation location are simultaneously decided on the basis of the desired ship‐bay and initial yard space configuration. An integer linear programming model is developed to minimize the number of relocations in the yard space on the basis of no shifts in the ship bay. The accuracy of the model is tested on small‐scale scenarios by using CPLEX. Considering the problem size in the real world, we present a rule‐based heuristic method that is combined with a mathematical model for the removal, loading, and relocation operations. The influence of rules on algorithm performance is also analyzed, and the heuristic algorithm is compared with different types of algorithms in the literature. The extensive numerical experiments show the efficiency of the proposed heuristic algorithm.

Suggested Citation

  • Huiling Zhu & Mingjun Ji & Wenwen Guo & Qingbin Wang & Yongzhi Yang, 2019. "Mathematical formulation and heuristic algorithm for the block relocation and loading problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 66(4), pages 333-351, June.
    • Handle: RePEc:wly:navres:v:66:y:2019:i:4:p:333-351
    DOI: 10.1002/nav.21843
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.21843
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.21843?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. Jin, Bo & Zhu, Wenbin & Lim, Andrew, 2015. "Solving the container relocation problem by an improved greedy look-ahead heuristic," European Journal of Operational Research, Elsevier, vol. 240(3), pages 837-847.
    2. Petering, Matthew E.H. & Hussein, Mazen I., 2013. "A new mixed integer program and extended look-ahead heuristic algorithm for the block relocation problem," European Journal of Operational Research, Elsevier, vol. 231(1), pages 120-130.
    3. Imai, Akio & Sasaki, Kazuya & Nishimura, Etsuko & Papadimitriou, Stratos, 2006. "Multi-objective simultaneous stowage and load planning for a container ship with container rehandle in yard stacks," European Journal of Operational Research, Elsevier, vol. 171(2), pages 373-389, June.
    4. M. Hakan Akyüz & Chung‐Yee Lee, 2014. "A mathematical formulation and efficient heuristics for the dynamic container relocation problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 61(2), pages 101-118, March.
    5. Yat‐wah Wan & Jiyin Liu & Pei‐Chun Tsai, 2009. "The assignment of storage locations to containers for a container stack," Naval Research Logistics (NRL), John Wiley & Sons, vol. 56(8), pages 699-713, December.
    6. Galle, Virgile & Barnhart, Cynthia & Jaillet, Patrick, 2018. "A new binary formulation of the restricted Container Relocation Problem based on a binary encoding of configurations," European Journal of Operational Research, Elsevier, vol. 267(2), pages 467-477.
    7. Lehnfeld, Jana & Knust, Sigrid, 2014. "Loading, unloading and premarshalling of stacks in storage areas: Survey and classification," European Journal of Operational Research, Elsevier, vol. 239(2), pages 297-312.
    8. Caserta, Marco & Schwarze, Silvia & Voß, Stefan, 2012. "A mathematical formulation and complexity considerations for the blocks relocation problem," European Journal of Operational Research, Elsevier, vol. 219(1), pages 96-104.
    9. Bortfeldt, Andreas & Forster, Florian, 2012. "A tree search procedure for the container pre-marshalling problem," European Journal of Operational Research, Elsevier, vol. 217(3), pages 531-540.
    10. Zhao, Wenjuan & Goodchild, Anne V., 2010. "The impact of truck arrival information on container terminal rehandling," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 46(3), pages 327-343, May.
    11. Kim, Kap Hwan & Park, Young Man & Ryu, Kwang-Ryul, 2000. "Deriving decision rules to locate export containers in container yards," European Journal of Operational Research, Elsevier, vol. 124(1), pages 89-101, July.
    12. Chen, Lu & Lu, Zhiqiang, 2012. "The storage location assignment problem for outbound containers in a maritime terminal," International Journal of Production Economics, Elsevier, vol. 135(1), pages 73-80.
    13. Ji, Mingjun & Guo, Wenwen & Zhu, Huiling & Yang, Yongzhi, 2015. "Optimization of loading sequence and rehandling strategy for multi-quay crane operations in container terminals," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 80(C), pages 1-19.
    14. Zehendner, Elisabeth & Caserta, Marco & Feillet, Dominique & Schwarze, Silvia & Voß, Stefan, 2015. "An improved mathematical formulation for the blocks relocation problem," European Journal of Operational Research, Elsevier, vol. 245(2), pages 415-422.
    15. Jang, Dong-Won & Kim, Se Won & Kim, Kap Hwan, 2013. "The optimization of mixed block stacking requiring relocations," International Journal of Production Economics, Elsevier, vol. 143(2), pages 256-262.
    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. Jin, Bo & Tanaka, Shunji, 2023. "An exact algorithm for the unrestricted container relocation problem with new lower bounds and dominance rules," European Journal of Operational Research, Elsevier, vol. 304(2), pages 494-514.
    2. Parreño-Torres, Consuelo & Alvarez-Valdes, Ramon & Ruiz, Rubén & Tierney, Kevin, 2020. "Minimizing crane times in pre-marshalling problems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 137(C).
    3. Huiling Zhu, 2022. "Integrated Containership Stowage Planning: A Methodology for Coordinating Containership Stowage Plan and Terminal Yard Operations," Sustainability, MDPI, vol. 14(20), pages 1-18, October.
    4. Damla Kizilay & Deniz Türsel Eliiyi, 2021. "A comprehensive review of quay crane scheduling, yard operations and integrations thereof in container terminals," Flexible Services and Manufacturing Journal, Springer, vol. 33(1), pages 1-42, March.

    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. Jin, Bo & Tanaka, Shunji, 2023. "An exact algorithm for the unrestricted container relocation problem with new lower bounds and dominance rules," European Journal of Operational Research, Elsevier, vol. 304(2), pages 494-514.
    2. Tanaka, Shunji & Voß, Stefan, 2019. "An exact algorithm for the block relocation problem with a stowage plan," European Journal of Operational Research, Elsevier, vol. 279(3), pages 767-781.
    3. Feng, Yuanjun & Song, Dong-Ping & Li, Dong & Zeng, Qingcheng, 2020. "The stochastic container relocation problem with flexible service policies," Transportation Research Part B: Methodological, Elsevier, vol. 141(C), pages 116-163.
    4. 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.
    5. Ting, Ching-Jung & Wu, Kun-Chih, 2017. "Optimizing container relocation operations at container yards with beam search," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 103(C), pages 17-31.
    6. Azab, Ahmed & Morita, Hiroshi, 2022. "The block relocation problem with appointment scheduling," European Journal of Operational Research, Elsevier, vol. 297(2), pages 680-694.
    7. Kap Hwan Kim & Sanghyuk Yi, 2021. "Utilizing information sources to reduce relocation of inbound containers," Maritime Economics & Logistics, Palgrave Macmillan;International Association of Maritime Economists (IAME), vol. 23(4), pages 726-749, December.
    8. Feng, Yuanjun & Song, Dong-Ping & Li, Dong & Xie, Ying, 2022. "Service fairness and value of customer information for the stochastic container relocation problem under flexible service policy," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 167(C).
    9. Zweers, Bernard G. & Bhulai, Sandjai & van der Mei, Rob D., 2020. "Optimizing pre-processing and relocation moves in the Stochastic Container Relocation Problem," European Journal of Operational Research, Elsevier, vol. 283(3), pages 954-971.
    10. Andresson Silva Firmino & Ricardo Martins Abreu Silva & Valéria Cesário Times, 2019. "A reactive GRASP metaheuristic for the container retrieval problem to reduce crane’s working time," Journal of Heuristics, Springer, vol. 25(2), pages 141-173, April.
    11. Zehendner, Elisabeth & Feillet, Dominique & Jaillet, Patrick, 2017. "An algorithm with performance guarantee for the Online Container Relocation Problem," European Journal of Operational Research, Elsevier, vol. 259(1), pages 48-62.
    12. Jovanovic, Raka & Tuba, Milan & Voß, Stefan, 2019. "An efficient ant colony optimization algorithm for the blocks relocation problem," European Journal of Operational Research, Elsevier, vol. 274(1), pages 78-90.
    13. Boge, Sven & Goerigk, Marc & Knust, Sigrid, 2020. "Robust optimization for premarshalling with uncertain priority classes," European Journal of Operational Research, Elsevier, vol. 287(1), pages 191-210.
    14. de Melo da Silva, Marcos & Toulouse, Sophie & Wolfler Calvo, Roberto, 2018. "A new effective unified model for solving the Pre-marshalling and Block Relocation Problems," European Journal of Operational Research, Elsevier, vol. 271(1), pages 40-56.
    15. Boschma, René & Mes, Martijn R.K. & de Vries, Leon R., 2023. "Approximate dynamic programming for container stacking," European Journal of Operational Research, Elsevier, vol. 310(1), pages 328-342.
    16. Huiling Zhu, 2022. "Integrated Containership Stowage Planning: A Methodology for Coordinating Containership Stowage Plan and Terminal Yard Operations," Sustainability, MDPI, vol. 14(20), pages 1-18, October.
    17. Lehnfeld, Jana & Knust, Sigrid, 2014. "Loading, unloading and premarshalling of stacks in storage areas: Survey and classification," European Journal of Operational Research, Elsevier, vol. 239(2), pages 297-312.
    18. Juan P. Cavada & Cristián E. Cortés & Pablo A. Rey, 2023. "Comparing allocation and relocation policies at a logistics service container terminal: a discrete-event simulation approach," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 31(4), pages 1281-1316, December.
    19. V. Galle & V. H. Manshadi & S. Borjian Boroujeni & C. Barnhart & P. Jaillet, 2018. "The Stochastic Container Relocation Problem," Transportation Science, INFORMS, vol. 52(5), pages 1035-1058, October.
    20. Zhang, Canrong & Guan, Hao & Yuan, Yifei & Chen, Weiwei & Wu, Tao, 2020. "Machine learning-driven algorithms for the container relocation problem," Transportation Research Part B: Methodological, Elsevier, vol. 139(C), pages 102-131.

    More about this item

    Statistics

    Access and download statistics

    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:wly:navres:v:66:y:2019:i:4:p:333-351. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.