Optimization of Restricted Container Relocation Using the Monte Carlo Tree Search Method
Abstract 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.
Authors
- Khadidja Yachba (ORCID: https://orcid.org/0000-0002-7754-2823)
- Amin Chaabane (ORCID: https://orcid.org/0000-0002-1113-7630)
- Ladjel Bellatreche
Institutions
- Université Oran 1 Ahmed Ben Bella (DZ)
- École Nationale Supérieure de Mécanique et d'Aérotechnique (FR)
- Ahmed Zabana University - Relizane (DZ)
Publication Details
- Journal
- Transport and Telecommunication Journal
- Published
- 2025-02-01
- DOI
- https://doi.org/10.2478/ttj-2025-0002
- Primary Topic
- Maritime Ports and Logistics
- Type
- article
- Field-Weighted Citation Impact
- 0.00