Optimization of Restricted Container Relocation Using the Monte Carlo Tree Search Method

被引:0
作者
Chaabane, Abdelali [1 ]
Yachba, Khadidja [2 ]
Bellatreche, Ladjel [3 ]
机构
[1] Relizane Univ, Relizane, Algeria
[2] Oran Grad Sch Econ, Oran, Algeria
[3] Natl Higher Sch Mech & Aerotechnol, POITIERS, France
关键词
Container relocation; optimization of maritime operations; container ship; reinforcement learning; Monte Carlo Tree Search; ALGORITHM; FORMULATION;
D O I
10.2478/ttj-2025-0002
中图分类号
U [交通运输];
学科分类号
08 ; 0823 ;
摘要
This article explores how to improve operational performance in maritime ports by managing the flow of goods effectively. This study proposes an innovative approach based on Reinforcement Learning (RL), specifically the Monte Carlo Tree Search (MCTS) method, to address the restricted container relocation problem (RCRP). This method aims to determine an optimal sequence for container retrieval based on their respective priorities, in order to minimize the number of necessary relocations. By employing precise actions and a defined reward function, MCTS is guided towards the best possible solution. The efficiency and relevance of this method are demonstrated through various solved scenarios and compared to a literature-based approach using genetic algorithms. The results show that the MCTS approach is effective in addressing the complex challenges of goods flow management in maritime ports.
引用
收藏
页码:13 / 22
页数:10
相关论文
共 48 条
[1]  
Abdelali C., 2023, 2023 IEEE INT C BIG, P2561, DOI [10.1109/BigData59044.2023.10386793, DOI 10.1109/BIGDATA59044.2023.10386793]
[2]  
Amrani F., 2018, International Journal of Management and Decision Making, V17, P348
[3]   A Zero-blockage based Scheduling for Import Containers Pickup Operations at Container Terminal Yards [J].
Azab, Ahmed ;
Morita, Hiroshi .
PROCEEDINGS OF THE 11TH INTERNATIONAL CONFERENCE ON OPERATIONS RESEARCH AND ENTERPRISE SYSTEMS (ICORES), 2021, :286-293
[4]   The block relocation problem with appointment scheduling [J].
Azab, Ahmed ;
Morita, Hiroshi .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2022, 297 (02) :680-694
[5]   The realization-independent reallocation heuristic for the stochastic container relocation problem [J].
Bacci, Tiziano ;
Mattia, Sara ;
Ventura, Paolo .
SOFT COMPUTING, 2023, 27 (07) :4223-4233
[6]   The bounded beam search algorithm for the block relocation problem [J].
Bacci, Tiziano ;
Mattia, Sara ;
Ventura, Paolo .
COMPUTERS & OPERATIONS RESEARCH, 2019, 103 :252-264
[7]  
Belayachi N, 2017, TRANSP TELECOMMUN J, V18, P207, DOI 10.1515/ttj-2017-0018
[8]  
Bendaoud Zakaria, 2017, International Journal of Strategic Information Technology and Applications, V8, P59, DOI 10.4018/IJSITA.2017070104
[9]   A mathematical formulation and complexity considerations for the blocks relocation problem [J].
Caserta, Marco ;
Schwarze, Silvia ;
Voss, Stefan .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2012, 219 (01) :96-104
[10]   PROGRESSIVE STRATEGIES FOR MONTE-CARLO TREE SEARCH [J].
Chaslot, Guillaume M. J-B. ;
Winands, Mark H. M. ;
Van den Herik, H. Jaap ;
Uiterwijk, Jos W. H. M. ;
Bouzy, Bruno .
NEW MATHEMATICS AND NATURAL COMPUTATION, 2008, 4 (03) :343-357