Matthieu André, Gilles Pesant et Samuel Pierre
Article de revue (2005)
Document en libre accès dans PolyPublie et chez l'éditeur officiel |
|
Libre accès au plein texte de ce document Version officielle de l'éditeur Conditions d'utilisation: Creative Commons: Attribution (CC BY) Télécharger (716kB) |
Abstract
The problem of assigning cells to switches in wireless networks consists of minimizing the total operating cost, that is, the cost of linking cells to switches and the cost of handover from one cell to another, by taking into account factors such as network topology, switch capacity and traffic load in the entire network. Such a problem is well known in the literature as NP-hard, such that exact enumerative approaches are not suitable for solving real-size instances of this problem. Thus, heuristics are recommended and have been used for finding good solutions in reasonable execution times. Tabu Search (TS) is one of the best heuristics used to solve this problem. This research proposes a hybrid heuristic approach for further improving the quality of solutions obtained from TS. This approach applies TS in combination with variable neighborhood search, a recent metaheuristic that is based on the principle of systematic change of neighborhood during the local search.. A key element in the success of this approach is the use of several neighborhood structures that complement each other well and that remain within the feasible region of the search space.
Mots clés
Cell Assignment, Mobile Networks, Variable Neighborhood Search, Tabu Search, Heuristics
Sujet(s): |
2500 Génie électrique et électronique > 2525 Systèmes de télécommunications sans fil 2700 Technologie de l'information > 2713 Algorithmes |
---|---|
Département: | Département de génie informatique et génie logiciel |
URL de PolyPublie: | https://publications.polymtl.ca/4750/ |
Titre de la revue: | Journal of Computer Science (vol. 1, no 2) |
Maison d'édition: | Science Publications |
DOI: | 10.3844/jcssp.2005.175.181 |
URL officielle: | https://doi.org/10.3844/jcssp.2005.175.181 |
Date du dépôt: | 11 mars 2021 11:29 |
Dernière modification: | 08 avr. 2024 19:34 |
Citer en APA 7: | André, M., Pesant, G., & Pierre, S. (2005). A variable neighborhood search algorithm for assigning cells to switches in wireless networks. Journal of Computer Science, 1(2), 175-181. https://doi.org/10.3844/jcssp.2005.175.181 |
---|---|
Statistiques
Total des téléchargements à partir de PolyPublie
Téléchargements par année
Provenance des téléchargements
Dimensions