IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v327y2025i1p95-114.html

A multi-stage approach for Root Sequence Index allocation

Author

Listed:
  • Londe, Mariana A.
  • Andrade, Carlos E.
  • Pessoa, Luciana S.

Abstract

The Root Sequence Index (RSI) is a parameter used in mobile wireless networks to allocate uplink channels between user equipment and base stations. Inadequate RSI assignment to neighbor radios may lead to failure in service establishment and performance degradation. Wireless networks are also dynamic, with uncertain modifications in time due to, for instance, seasonal foliage. In this paper, we model RSI allocation with seasonal changes in the network as a multistage robust problem, being the first proactive, look-ahead method to consider uncertainty in RSI assignments. We develop methods to solve this stochastic problem, aiming to minimize the possible interference and network changes in time. A mixed-integer programming model, a classic Biased Random-Key Genetic Algorithm (BRKGA), and a novel BRKGA hybridized with Dijkstra’s algorithm are explored and compared. We also introduce a Monte Carlo-based simulation methodology to obtain scenarios. The hybrid BRKGA-based approach is shown to obtain more robust solutions in shorter computational times.

Suggested Citation

  • Londe, Mariana A. & Andrade, Carlos E. & Pessoa, Luciana S., 2025. "A multi-stage approach for Root Sequence Index allocation," European Journal of Operational Research, Elsevier, vol. 327(1), pages 95-114.
    • Handle: RePEc:eee:ejores:v:327:y:2025:i:1:p:95-114
    DOI: 10.1016/j.ejor.2025.05.015
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221725003832
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2025.05.015?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

    for a different version of it.

    References listed on IDEAS

    as
    1. Andrade, Carlos E. & Toso, Rodrigo F. & Gonçalves, José F. & Resende, Mauricio G.C., 2021. "The Multi-Parent Biased Random-Key Genetic Algorithm with Implicit Path-Relinking and its real-world applications," European Journal of Operational Research, Elsevier, vol. 289(1), pages 17-30.
    2. Plaga, Leonie Sara & Bertsch, Valentin, 2023. "Methods for assessing climate uncertainty in energy system models — A systematic literature review," Applied Energy, Elsevier, vol. 331(C).
    3. Mauricio Resende, 2012. "Biased random-key genetic algorithms with applications in telecommunications," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 20(1), pages 130-153, April.
    4. Londe, Mariana A. & Pessoa, Luciana S. & Andrade, Carlos E. & Resende, Mauricio G.C., 2025. "Biased random-key genetic algorithms: A review," European Journal of Operational Research, Elsevier, vol. 321(1), pages 1-22.
    5. Angel A. Juan & Peter Keenan & Rafael Martí & Seán McGarraghy & Javier Panadero & Paula Carroll & Diego Oliva, 2023. "A review of the role of heuristics in stochastic optimisation: from metaheuristics to learnheuristics," Annals of Operations Research, Springer, vol. 320(2), pages 831-861, January.
    6. López-Ibáñez, Manuel & Dubois-Lacoste, Jérémie & Pérez Cáceres, Leslie & Birattari, Mauro & Stützle, Thomas, 2016. "The irace package: Iterated racing for automatic algorithm configuration," Operations Research Perspectives, Elsevier, vol. 3(C), pages 43-58.
    7. José María Barrero & Nicholas Bloom & Steven J. Davis, 2023. "The Evolution of Work from Home," Journal of Economic Perspectives, American Economic Association, vol. 37(4), pages 23-50, Fall.
    8. Kim, Seokwoo & Choi, Dong Gu, 2024. "A sample robust optimal bidding model for a virtual power plant," European Journal of Operational Research, Elsevier, vol. 316(3), pages 1101-1113.
    9. Ivan Marsa-Maestre & Enrique Hoz & Jose Manuel Gimenez-Guzman & David Orden & Mark Klein, 2019. "Nonlinear Negotiation Approaches for Complex-Network Optimization: A Study Inspired by Wi-Fi Channel Assignment," Group Decision and Negotiation, Springer, vol. 28(1), pages 175-196, February.
    10. Oliveira, Beatriz Brito & Carravilla, Maria Antónia & Oliveira, José Fernando, 2022. "A diversity-based genetic algorithm for scenario generation," European Journal of Operational Research, Elsevier, vol. 299(3), pages 1128-1141.
    11. Oliveira, Beatriz B. & Carravilla, Maria Antónia & Oliveira, José F. & Costa, Alysson M., 2019. "A co-evolutionary matheuristic for the car rental capacity-pricing stochastic problem," European Journal of Operational Research, Elsevier, vol. 276(2), pages 637-655.
    12. Aidin Rezaeian & Hamidreza Koosha & Mohammad Ranjbar & Saeed Poormoaied, 2024. "The assignment of project managers to projects in an uncertain dynamic environment," Annals of Operations Research, Springer, vol. 341(2), pages 1107-1134, October.
    13. Jonatas B. C. Chagas & Julian Blank & Markus Wagner & Marcone J. F. Souza & Kalyanmoy Deb, 2021. "A non-dominated sorting based customized random-key genetic algorithm for the bi-objective traveling thief problem," Journal of Heuristics, Springer, vol. 27(3), pages 267-301, June.
    14. Thiago Noronha & Mauricio Resende & Celso Ribeiro, 2011. "A biased random-key genetic algorithm for routing and wavelength assignment," Journal of Global Optimization, Springer, vol. 50(3), pages 503-518, July.
    15. Thevenin, Simon & Ben-Ammar, Oussama & Brahimi, Nadjib, 2022. "Robust optimization approaches for purchase planning with supplier selection under lead time uncertainty," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1199-1215.
    16. A. Ben-Tal & A. Nemirovski, 1998. "Robust Convex Optimization," Mathematics of Operations Research, INFORMS, vol. 23(4), pages 769-805, November.
    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. Londe, Mariana A. & Pessoa, Luciana S. & Andrade, Carlos E. & Resende, Mauricio G.C., 2025. "Biased random-key genetic algorithms: A review," European Journal of Operational Research, Elsevier, vol. 321(1), pages 1-22.
    2. Soares, Leonardo Cabral R. & Carvalho, Marco Antonio M., 2020. "Biased random-key genetic algorithm for scheduling identical parallel machines with tooling constraints," European Journal of Operational Research, Elsevier, vol. 285(3), pages 955-964.
    3. Jonatas B. C. Chagas & Julian Blank & Markus Wagner & Marcone J. F. Souza & Kalyanmoy Deb, 2021. "A non-dominated sorting based customized random-key genetic algorithm for the bi-objective traveling thief problem," Journal of Heuristics, Springer, vol. 27(3), pages 267-301, June.
    4. Andrade, Carlos E. & Toso, Rodrigo F. & Gonçalves, José F. & Resende, Mauricio G.C., 2021. "The Multi-Parent Biased Random-Key Genetic Algorithm with Implicit Path-Relinking and its real-world applications," European Journal of Operational Research, Elsevier, vol. 289(1), pages 17-30.
    5. Laguna, Manuel & Martí, Rafael & Martínez-Gavara, Anna & Pérez-Peló, Sergio & Resende, Mauricio G.C., 2025. "Greedy Randomized Adaptive Search Procedures with Path Relinking. An analytical review of designs and implementations," European Journal of Operational Research, Elsevier, vol. 327(3), pages 717-734.
    6. Pessoa, Luciana S. & Andrade, Carlos E., 2018. "Heuristics for a flowshop scheduling problem with stepwise job objective function," European Journal of Operational Research, Elsevier, vol. 266(3), pages 950-962.
    7. Carlos Cotta, 2025. "Harnessing memetic algorithms: a practical guide," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 33(2), pages 327-356, July.
    8. Dianne Villicaña-Cervantes & Omar J. Ibarra-Rojas, 2024. "Accessible location of mobile labs for COVID-19 testing," Health Care Management Science, Springer, vol. 27(1), pages 1-19, March.
    9. Cleder M. Schenekemberg & Antonio A. Chaves & Thiago A. Guimarães & Leandro C. Coelho, 2025. "Hybrid metaheuristic for the dial-a-ride problem with private fleet and common carrier integrated with public transportation," Annals of Operations Research, Springer, vol. 351(1), pages 809-847, August.
    10. Oliveira, Beatriz Brito & Carravilla, Maria Antónia & Oliveira, José Fernando, 2022. "A diversity-based genetic algorithm for scenario generation," European Journal of Operational Research, Elsevier, vol. 299(3), pages 1128-1141.
    11. Alfredo Lima & Luiz Satoru Ochi & Bruno Nogueira & Rian G. S. Pinheiro, 2025. "Biased random-key genetic algorithms for the weighted minimum broadcast time problem," Annals of Operations Research, Springer, vol. 349(3), pages 1749-1783, June.
    12. R. B. Damm & A. A. Chaves & J. A. Riveaux & D. P. Ronconi, 2025. "Scheduling technicians and tasks through an adaptive multi-objective biased random-key genetic algorithm," Annals of Operations Research, Springer, vol. 346(2), pages 945-980, March.
    13. Rafael A. Melo & Celso C. Ribeiro & Jose A. Riveaux, 2025. "A biased random-key genetic algorithm for the minimum quasi-clique partitioning problem," Annals of Operations Research, Springer, vol. 351(1), pages 575-607, August.
    14. Martí, Rafael & Sevaux, Marc & Sörensen, Kenneth, 2025. "Fifty years of metaheuristics," European Journal of Operational Research, Elsevier, vol. 321(2), pages 345-362.
    15. Caserta, Marco & Voß, Stefan, 2019. "The robust multiple-choice multidimensional knapsack problem," Omega, Elsevier, vol. 86(C), pages 16-27.
    16. Li, Xingchen & Xu, Guangcheng & Wu, Jie & Xu, Chengzhen & Zhu, Qingyuan, 2024. "Evaluation of bank efficiency by considering the uncertainty of nonperforming loans," Omega, Elsevier, vol. 126(C).
    17. Christina Büsing & Sigrid Knust & Xuan Thanh Le, 2018. "Trade-off between robustness and cost for a storage loading problem: rule-based scenario generation," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 6(4), pages 339-365, December.
    18. Wenqing Chen & Melvyn Sim & Jie Sun & Chung-Piaw Teo, 2010. "From CVaR to Uncertainty Set: Implications in Joint Chance-Constrained Optimization," Operations Research, INFORMS, vol. 58(2), pages 470-485, April.
    19. Zhi Chen & Melvyn Sim & Huan Xu, 2019. "Distributionally Robust Optimization with Infinitely Constrained Ambiguity Sets," Operations Research, INFORMS, vol. 67(5), pages 1328-1344, September.
    20. Stefan Mišković, 2017. "A VNS-LP algorithm for the robust dynamic maximal covering location problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(4), pages 1011-1033, October.

    More about this item

    Keywords

    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:ejores:v:327:y:2025:i:1:p:95-114. 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/locate/eor .

    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.