Metraipolis › archive › dc_d041ac57dec0
Machine Learning-Enhanced Tabu Search for Tactical Wireless Network Design — arXiv:2608.28627
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.28627
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T07:41:45.708Z
- SHA-256 of the archived text
0ec59a0c883dd0f999cc0f52f67766b59ee87f8035f9714098c522fce854a779- Stable URL of this page
https://metraipolis.com/documento/dc_d041ac57dec0
How to cite
Machine Learning-Enhanced Tabu Search for Tactical Wireless Network Design — arXiv:2608.28627 — arXiv (en), https://arxiv.org/abs/2608.28627 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d041ac57dec0 (Metraipolis archive dc_d041ac57dec0, sha256 0ec59a0c883dd0f999cc0f52f67766b59ee87f8035f9714098c522fce854a779)
BibTeX
@misc{dcd041ac57dec0,
title = {Machine Learning-Enhanced Tabu Search for Tactical Wireless Network Design — arXiv:2608.28627},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.28627},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d041ac57dec0; sha256 0ec59a0c883dd0f999cc0f52f67766b59ee87f8035f9714098c522fce854a779},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.28627. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Designing high-performance tactical wireless networks under realistic operational constraints gives rise to challenging combinatorial optimization problems, where the evaluation of candidate solutions relies on detailed physical and traffic-aware models. Although classical metaheuristics such as Tabu Search offer effective mechanisms for exploring large search spaces, their computational cost remains high because numerous candidate moves must be evaluated at every iteration. In this paper, we propose a data-driven framework that improves the efficiency of Tabu Search by learning to guide its move selection process. Rather than altering the neighborhood structure, our approach exploits the information contained in the search trajectories generated during the optimization process. At each iteration, we record both improving and non-improving edge-based transformations together with a set of descriptive features capturing the structural, geometric, and performance characteristics of the network. This information is used to train a Graph Neural Network (GNN) that predicts the impact of candidate moves on the objective function. The trained model is then integrated into the Tabu Search algorithm to rank candidate transformations according to their predicted quality, thereby reducing the number of costly objective evaluations while maintaining an effective exploration of the search space. Experimental results on synthetic benchmark instances demonstrate that the proposed learning-assisted Tabu Search notably reduces computation time while consistently producing higher-quality solutions than the standard algorithm. These findings highlight the potential of combining machine learning with metaheuristics by leveraging the implicit knowledge embedded in search trajectories, paving the way for more efficient solution methods for large-scale network design problems. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-01 in cs.AI). Categorie arXiv: Artificial Intelligence (cs.AI) ; Machine Learning (cs.LG); Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2608.28627 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-17T07:28:26.458Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-09-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).