.png){kind=icon}
.png){kind=icon}
Return
A multi-stage approach for Root Sequence Index allocation
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2025.05.015.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
• Introduces a robust multi-stage variant for Root Sequence Index allocation. • Provides a Monte Carlo-based simulation method to obtain scenarios for the problem. • Proposes a MIP, a traditional BRKGA, and a hybrid BRKGA to solve it. • Hybrid BRKGA with Dijkstra’s algorithm provides faster, more robust solutions.
Keywords:
Root Sequence Index allocation
Monte Carlo simulation
Mixed-Integer Programming
BRKGA
Dijkstra’s algorithm
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W