<  Back to the Polytechnique Montréal portal

A variable neighborhood search algorithm for assigning cells to switches in wireless networks

Matthieu André, Gilles Pesant and Samuel Pierre

Article (2005)

Open Acess document in PolyPublie and at official publisher
Open Access to the full text of this document
Published Version
Terms of Use: Creative Commons Attribution
Download (716kB)
Show abstract
Hide 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.

Uncontrolled Keywords

Cell Assignment, Mobile Networks, Variable Neighborhood Search, Tabu Search, Heuristics

Subjects: 2500 Electrical and electronic engineering > 2525 Wireless communication systems
2700 Information technology > 2713 Algorithms
Department: Department of Computer Engineering and Software Engineering
PolyPublie URL: https://publications.polymtl.ca/4750/
Journal Title: Journal of Computer Science (vol. 1, no. 2)
Publisher: Science Publications
DOI: 10.3844/jcssp.2005.175.181
Official URL: https://doi.org/10.3844/jcssp.2005.175.181
Date Deposited: 11 Mar 2021 11:29
Last Modified: 23 May 2023 15:03
Cite in 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


Total downloads

Downloads per month in the last year

Origin of downloads


Repository Staff Only

View Item View Item