.png){kind=icon}
.png){kind=icon}
Return
A heuristic algorithm based on beam search and iterated local search for the maritime inventory routing problem
.png){kind=icon}
PRE
AI
N
R
A
R
DOI：10.1016/j.cor.2025.107347.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
• Novel integration of Beam Search, greedy heuristic and ILS to effectively solve MIRP. • Innovative strategy for evaluating Beam Search partial solutions. • First self-contained heuristic method applied to all 72 MIRPLib Group 2 instances. • 18 new best-known solutions with competitive times and strong performance. • Effective in finding high-quality solutions for MIRP instances in reasonable times.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W
Organization
Cited Papers