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

Learning-based hybrid algorithms for container relocation problem with storage plan

Author

Listed:
  • Wang, Peixiang
  • Xu, Qihang
  • Li, Yufei
  • Chen, Qunlong
  • Tao, Jinghan
  • Qin, Wei
  • Huang, Heng
  • Zou, Ying

Abstract

Container relocation poses a challenge in terminals, underscoring the importance of effective strategies to maintain efficient cargo flow. This paper tackles the Container Relocation Problem with Storage Plan (CRPSP) by integrating exact algorithms and reinforcement learning. We formulate the problem with a mixed-integer programming model and employ an A* algorithm to generate optimal solutions. We then design a reinforcement learning PPO model with an attention mechanism. A key contribution is the designed reward mechanism based on a lower-bound evaluation function of the A* algorithm, which significantly accelerates the convergence of the reinforcement learning model. Additionally, ensemble learning techniques, specifically Stacking, are first used to integrate multiple reinforcement learning models based on optimal solutions. Numerical experiments demonstrate notable improvements in convergence speed and robustness, highlighting the potential of combining operations research methods and machine learning for complex NP-hard problems.

Suggested Citation

  • Wang, Peixiang & Xu, Qihang & Li, Yufei & Chen, Qunlong & Tao, Jinghan & Qin, Wei & Huang, Heng & Zou, Ying, 2025. "Learning-based hybrid algorithms for container relocation problem with storage plan," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 197(C).
  • Handle: RePEc:eee:transe:v:197:y:2025:i:c:s1366554525000894
    DOI: 10.1016/j.tre.2025.104048
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.tre.2025.104048?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. 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.
    2. Chenhao Zhou & Aloisius Stephen & Kok Choon Tan & Ek Peng Chew & Loo Hay Lee, 2024. "Multiagent Q-Learning Approach for the Recharging Scheduling of Electric Automated Guided Vehicles in Container Terminals," Transportation Science, INFORMS, vol. 58(3), pages 664-683, May.
    3. 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.
    4. 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.
    5. Tiande Guo & Congying Han & Siqi Tang & Man Ding, 2019. "Solving Combinatorial Problems with Machine Learning Methods," Springer Optimization and Its Applications, in: Ding-Zhu Du & Panos M. Pardalos & Zhao Zhang (ed.), Nonlinear Combinatorial Optimization, pages 207-229, Springer.
    6. Gao, Yinping & Zhen, Lu, 2024. "A decision framework for decomposed stowage planning for containers," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 183(C).
    7. 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.
    8. Wang, Ning & Jin, Bo & Zhang, Zizhen & Lim, Andrew, 2017. "A feasibility-based heuristic for the container pre-marshalling problem," European Journal of Operational Research, Elsevier, vol. 256(1), pages 90-101.
    9. 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.
    10. Bengio, Yoshua & Lodi, Andrea & Prouvost, Antoine, 2021. "Machine learning for combinatorial optimization: A methodological tour d’horizon," European Journal of Operational Research, Elsevier, vol. 290(2), pages 405-421.
    11. Zhang, Yuchang & Bai, Ruibin & Qu, Rong & Tu, Chaofan & Jin, Jiahuan, 2022. "A deep reinforcement learning based hyper-heuristic for combinatorial optimisation with uncertainties," European Journal of Operational Research, Elsevier, vol. 300(2), pages 418-427.
    12. 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.
    13. David Silver & Julian Schrittwieser & Karen Simonyan & Ioannis Antonoglou & Aja Huang & Arthur Guez & Thomas Hubert & Lucas Baker & Matthew Lai & Adrian Bolton & Yutian Chen & Timothy Lillicrap & Fan , 2017. "Mastering the game of Go without human knowledge," Nature, Nature, vol. 550(7676), pages 354-359, October.
    14. Lixin Tang & Wei Jiang & Jiyin Liu & Yun Dong, 2015. "Research into container reshuffling and stacking problems in container terminal yards," IISE Transactions, Taylor & Francis Journals, vol. 47(7), pages 751-766, July.
    15. 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.
    16. 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.
    17. Bacci, Tiziano & Mattia, Sara & Ventura, Paolo, 2020. "A branch-and-cut algorithm for the restricted Block Relocation Problem," European Journal of Operational Research, Elsevier, vol. 287(2), pages 452-459.
    18. Filip Covic, 2017. "Re-marshalling in automated container yards with terminal appointment systems," Flexible Services and Manufacturing Journal, Springer, vol. 29(3), pages 433-503, December.
    19. Volodymyr Mnih & Koray Kavukcuoglu & David Silver & Andrei A. Rusu & Joel Veness & Marc G. Bellemare & Alex Graves & Martin Riedmiller & Andreas K. Fidjeland & Georg Ostrovski & Stig Petersen & Charle, 2015. "Human-level control through deep reinforcement learning," Nature, Nature, vol. 518(7540), pages 529-533, February.
    20. Pietro Saggese & Alessandro Belmonte & Nicola Dimitri & Angelo Facchini & Rainer Böhme, 2021. "Who are the arbitrageurs? Empirical evidence from Bitcoin traders in the Mt. Gox exchange platform," Department of Economics University of Siena 860, Department of Economics, University of Siena.
    21. Tanaka, Shunji & Tierney, Kevin & Parreño-Torres, Consuelo & Alvarez-Valdes, Ramon & Ruiz, Rubén, 2019. "A branch and bound approach for large pre-marshalling problems," European Journal of Operational Research, Elsevier, vol. 278(1), pages 211-225.
    22. 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.
    23. Raka Jovanovic & Shunji Tanaka & Tatsushi Nishi & Stefan Voß, 2019. "A GRASP approach for solving the Blocks Relocation Problem with Stowage Plan," Flexible Services and Manufacturing Journal, Springer, vol. 31(3), pages 702-729, September.
    Full references (including those not matched with items on IDEAS)

    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. 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).
    3. Azab, Ahmed & Morita, Hiroshi, 2022. "The block relocation problem with appointment scheduling," European Journal of Operational Research, Elsevier, vol. 297(2), pages 680-694.
    4. Liqun Liu & Yuanjun Feng & Qingcheng Zeng & Zhijun Chen & Yaqiu Li, 2025. "A Q-learning-based algorithm for the block relocation problem," Journal of Heuristics, Springer, vol. 31(1), pages 1-41, March.
    5. Alf Kimms & Fabian Wilschewski, 2023. "A new modeling approach for the unrestricted block relocation problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 45(4), pages 1071-1111, December.
    6. Feng, Yuanjun & Song, Dong-Ping & Li, Dong, 2022. "Smart stacking for import containers using customer information at automated container terminals," European Journal of Operational Research, Elsevier, vol. 301(2), pages 502-522.
    7. 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.
    8. Raeesi, Ramin & Sahebjamnia, Navid & Mansouri, S. Afshin, 2023. "The synergistic effect of operational research and big data analytics in greening container terminal operations: A review and future directions," European Journal of Operational Research, Elsevier, vol. 310(3), pages 943-973.
    9. 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.
    10. 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.
    11. 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.
    12. 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.
    13. Azab, Ahmed & Morita, Hiroshi, 2022. "Coordinating truck appointments with container relocations and retrievals in container terminals under partial appointments information," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 160(C).
    14. 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).
    15. Wang, Wenyuan & Liu, Huakun & Tian, Qi & Xia, Zicheng & Liu, Suri & Peng, Yun, 2024. "An enhanced variable neighborhood search method for refrigerated container stacking and relocation problem with duplicate priorities," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 188(C).
    16. 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.
    17. 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.
    18. 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.
    19. 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.
    20. 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.

    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:197:y:2025:i:c:s1366554525000894. 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.